Abstract:
We consider representations of a permutation $\pi$ of degree $2n$, $n\geqslant3$, by a product of three so-called pairwise-cycle permutations, all of whose cycles have length $2$. This is a valid question for even permutations if $n$ is even and for odd permutations if $n$ is odd. We prove constructively that for $n\geqslant4$, $n\neq8$, such a representation holds for all permutations $\pi$ of the same parity as $n$, apart from four exceptional conjugacy classes. For $n=8$ there are five exceptional conjugacy classes, and for $n=3$ there is one such class.
Bibliography: 32 titles.
Keywords:permutations, involutions, cyclic structure, products of involutions, cubic graphs.
Fulltext:
PDF file (838 kB)
