Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this relation.We establish general connections between inequivalent factorizations and other well-studied classes of permutation factorizations, such as monotone factorizations. We also obtain several specific enumerative results, including closed form generating series for inequivalent minimal transitive factorizations of permutations having up to three cycles. Our derivations rely on a new correspondence between inequivalent factorizations and acyclic alternating digraphs. Strong similarities between the enumerative results derived here and analogous ones for "ordinary" factorizations suggest that a unified theory remains to be discovered.
['Gregory Berkolaiko', 'John Irving']
Inequivalent factorizations of permutations