Bijective enumeration of 3-factorizations of an N-cycle

DOI10.1007/S00026-012-0138-5MaRDI QIDQ1928586zbMATH OpenOpenAlexWikidataFDO

Authors Ekaterina A. Vassilieva

Publication date 3 January 2013

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1211.7329

zbMATH Keywords

cacticactus treesfactorizations of the symmetric groupHarer-Zagier formulaJackson formulalong cyclepartitioned 3-cactipermutationsproduct of three permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10)

Abstract: This paper is dedicated to the factorizations of the symmetric group. Introducing a new bijection for partitioned 3-cacti, we derive an el- egant formula for the number of factorizations of a long cycle into a product of three permutations. As the most salient aspect, our construction provides the first purely combinatorial computation of this number.

Recommendations

• scientific article; zbMATH DE number 6928815
• Long cycle factorizations: bijective computation in the general case
• Bijections and symmetries for the factorizations of the long cycle
• Factorizations of large cycles in the symmetric group
• A bijective proof of Jackson's formula for the number of factorizations of a cycle

Cites work

• A bijective proof of Jackson's formula for the number of factorizations of a cycle
• A combinatorial proof of the Harer-Zagier formula
• A direct bijection for the Harer-Zagier formula
• Enumeration of planar constellations
• Factoring \(n\)-cycles and counting maps of given genus
• Graphs on surfaces and their applications. Appendix by Don B. Zagier
• scientific article; zbMATH DE number 3957110 (Why is no real title available?)
• Maps, hypermaps and their automorphisms: A survey. I
• Some combinatorial problems associated with products of conjugacy classes of the symmetric group
• The Euler characteristic of the moduli space of curves

Cited in

(7)

• Cycle factorizations and 1-faced graph embeddings
• Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit bijective computation
• Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group
• Calculating the Euler characteristic of the moduli space of curves
• HOW MANY n-CYCLES DOES PERIOD 3 IMPLY? AN ELEMENTARY APPROACH
• Long cycle factorizations: bijective computation in the general case
• A bijective proof of Jackson's formula for the number of factorizations of a cycle

This page was built for publication: Bijective enumeration of 3-factorizations of an \(N\)-cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928586)