On the number of factorizations of a full cycle

DOI10.1016/J.JCTA.2005.11.005zbMath1106.05101arXivmath/0510362OpenAlexW2056514476WikidataQ114162757 ScholiaQ114162757MaRDI QIDQ855850

John Irving

Publication date: 7 December 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

permutationscombinatoricscharacterssymmetric group

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Symmetric functions and generalizations (05E05) Symmetric groups (20B30)

Related Items (10)

On the matchings-Jack conjecture for Jack connection coefficients indexed by two single part partitions ⋮ The number of shortest paths in the (n, k)-star graph ⋮ Unnamed Item ⋮ Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit bijective computation ⋮ Polynomial properties of Jack connection coefficients and generalization of a result by Dénes ⋮ Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group ⋮ Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule ⋮ The number of shortest paths in the arrangement graph ⋮ Two enumerative results on cycles of permutations ⋮ Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit algebraic computation

Cites Work

• Unnamed Item
• Unnamed Item
• The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
• Factoring \(n\)-cycles and counting maps of given genus
• Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle)
• Enumeration of planar constellations
• Factorizations of large cycles in the symmetric group

This page was built for publication: On the number of factorizations of a full cycle