On the number of factorizations of a full cycle

DOI10.1016/J.JCTA.2005.11.005zbMATH Open1106.05101arXivmath/0510362OpenAlexW2056514476WikidataQ114162757 ScholiaQ114162757MaRDI QIDQ855850FDOQ855850

Authors: J. Irving 

Publication date: 7 December 2006

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

Abstract: We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic means, extending work of Biane. We deduce from our result a formula of Poulalhon and Schaeffer that was previously derived through an intricate combinatorial argument.

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

Recommendations

• Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle)
• Bijections and symmetries for the factorizations of the long cycle
• Long cycle factorizations: bijective computation in the general case
• Factorizations of large cycles in the symmetric group
• scientific article

zbMATH Keywords

permutationscombinatoricssymmetric groupcharacters

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)
• Factorizations of large cycles in the symmetric group
• Enumeration of planar constellations

Cited In (17)

• On the matchings-Jack conjecture for Jack connection coefficients indexed by two single part partitions
• Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule
• Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle)
• Polynomial properties of Jack connection coefficients and generalization of a result by Dénes
• On Jack's connection coefficients and their computation
• On the matchings-Jack and hypermap-Jack conjectures for labelled matchings and star maps
• Long cycle factorizations: bijective computation in the general case
• Title not available (Why is that?)
• Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group
• Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit bijective computation
• The number of shortest paths in the arrangement graph
• Two enumerative results on cycles of permutations
• The Oberwolfach problem and factors of uniform odd length cycles
• Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit algebraic computation
• The number of shortest paths in the \((n, k)\)-star graph
• Title not available (Why is that?)
• Minimal factorizations of a cycle: a multivariate generating function

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

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