How many ways can a permutation be factored into two n-cycles?

DOI10.1016/0012-365X(79)90138-9zbMath0429.05006MaRDI QIDQ1137579

David W. Walkup

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

permutationproduct of two n-cycles

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

Decomposing a Permutation into Two Large Cycles: An Enumeration ⋮ A duality for permutations ⋮ A versatile combinatorial approach of studying products of long cycles in symmetric groups ⋮ On products of long cycles: short cycle dependence and separation probabilities ⋮ Factorization of permutations into n-cycles ⋮ Factorizations of an \(n\)-cycle into two \(n\)-cycles ⋮ Odd permutations are nicer than even ones ⋮ Cardinality of Rauzy classes ⋮ The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group ⋮ A Differential Operator for Symmetric Functions and the Combinatorics of Multiplying Transpositions ⋮ Wrappings of Permutations ⋮ A combinatorial analog of the Jordan Curve Theorem ⋮ Cycle type factorizations in \(\mathrm{GL}_n \mathbb{F}_q\) ⋮ Decomposition of certain products of conjugacy classes of \(S_ n\)

Cites Work

• Unnamed Item
• Matchings in random regular bipartite digraphs
• Reflection classes whose cubes cover the alternating group
• Even permutations as a product of two conjugate cycles
• For How Many Edges is a Digraph Almost Certainly Hamiltonian?
• Noncanonical Factorization of a Permutation
• Some Remarks on Commutators
• Ramified coverings of Riemann surfaces

This page was built for publication: How many ways can a permutation be factored into two n-cycles?