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.