Decomposing a permutation into a conjugated tensor product
Sebastian Egner, Markus Püschel, Thomas Beth · 1997
The problem of decomposing a single permutation into a conjugated tensor product of smaller permutations is solved.Iu 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. ANNEXSTEIN, F., AND BAUMSLAG, M.A unified approach to off-line permutation routing on parallel networks.