Minimal factorizations of a cycle: a multivariate generating function

MaRDI QIDQ5110958zbMATH OpenFDO

Authors Philippe Biane, Matthieu Josuat-Vergés

Publication date 26 May 2020

Full work available at URL https://arxiv.org/abs/1610.02982, https://dmtcs.episciences.org/6318

zbMATH Keywords

hook formulaminimal factorizationsnoncrossing partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Abstract: It is known that the number of minimal factorizations of the long cycle in the symmetric group into a product of $k$ cycles of given lengths has a very simple formula: it is $n^{k-1}$ where $n$ is the rank of the underlying symmetric group and $k$ is the number of factors. In particular, this is $n^{n-2}$ for transposition factorizations. The goal of this work is to prove a multivariate generalization of this result. As a byproduct, we get a multivariate analog of Postnikov's hook length formula for trees, and a refined enumeration of final chains of noncrossing partitions.

Recommendations

• Minimal Transitive Factorizations of Permutations into Cycles
• Random stable-type minimal factorizations of the \(n\)-cycle
• scientific article; zbMATH DE number 637536
• Minimal factorizations of a cycle and central multiplicative functions on the infinite symmetric group
• The number of prefixes of minimal factorisations of a cycle
• Factorizations of the product of cycles
• Multiple factorizations by cyclic subsets
• Factoring \(n\)-cycles and counting maps of given genus
• Cycle factorizations of cycle products
• On the number of factorizations of a full cycle

Cites work

• A multivariate hook formula for labelled trees
• Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions
• Enumerative properties of generalized associahedra
• Factorizations of cycles and multi-noded rooted trees
• scientific article; zbMATH DE number 3149991 (Why is no real title available?)
• Minimal factorizations of a cycle and central multiplicative functions on the infinite symmetric group
• Minimal Transitive Factorizations of Permutations into Cycles
• Permutohedra, Associahedra, and Beyond
• Refined enumeration of noncrossing chains and hook formulas
• Théorie géométrique des polynômes eulériens
• Tree codes that preserve increases and degree sequences

Cited in

(7)

• Degrees in random uniform minimal factorizations
• Minimum cycle basis of direct product of \(K_2 \times K_n\)
• Noncrossing partitions, Bruhat order and the cluster complex
• Minimal factorizations of a cycle and central multiplicative functions on the infinite symmetric group
• The number of prefixes of minimal factorisations of a cycle
• Random stable-type minimal factorizations of the \(n\)-cycle
• On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions

This page was built for publication: Minimal factorizations of a cycle: a multivariate generating function

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