Decomposing a Permutation into a Conjugated Tensor Product
Download:
|
|
by Sebastian Egner, Markus Puschel, Thomas Beth
http://avalon.ira.uka.de/home/egner/papers/part.ps.gz
Add To MetaCart
Abstract:
The problem of decomposing a single permutation into a conjugated tensor product of smaller permutations is solved. In general, the decomposition is not uniquely determined. An algorithm is presented which enumerates all solutions. In particular, it is possible to decide considerably fast if a permutation is tensor-indecomposable. 1
Citations
| 649 | Handbook of Mathematical Functions – Abramowitz, Stegun, et al. - 1965 |
| 372 | Concrete Mathematics – Graham, Knuth, et al. - 1994 |
| 194 | A group-theoretic model for symmetric interconnection networks – Akers, Krishnamurthy - 1989 |
| 70 | Group action graphs and parallel architectures – Annexstein, Baumslag, et al. - 1990 |
| 16 | A unified approach to off-line permutation routing on parallel networks – Annexstein, Baumslag - 1990 |
| 13 | Algorithmensynthese fur lineare Systeme mit Symmetrie – Minkwitz - 1993 |
| 7 | Fast Fourier Transforms. BI-Wiss.-Verl – Clausen, Baum - 1993 |
| 5 | Methoden der Schnellen Fouriertransformation – Beth - 1984 |
| 2 | Tensor products of polynomials – Glasby - 1995 |
| 1 | Disjoint paths through a 3-dimensional grid – Brady, Brown, et al. - 1990 |
