Minimal factorizations of a cycle: a multivariate generating function

zbMath1440.05020arXiv1610.02982MaRDI QIDQ5110958

Philippe Biane, Matthieu Josuat-Vergès

Publication date: 26 May 2020

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

zbMATH Keywords

hook formulanoncrossing partitionsminimal factorizations

Mathematics Subject Classification ID

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

Related Items (3)

Random stable-type minimal factorizations of the n-cycle ⋮ On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions ⋮ Noncrossing partitions, Bruhat order and the cluster complex

Cites Work

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

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