English

Minimal factorizations of a cycle: a multivariate generating function

Combinatorics 2021-01-29 v1

Abstract

It is known that the number of minimal factorizations of the long cycle in the symmetric group into a product of kk cycles of given lengths has a very simple formula: it is nk1n^{k-1} where nn is the rank of the underlying symmetric group and kk is the number of factors. In particular, this is nn2n^{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.

Keywords

Cite

@article{arxiv.1610.02982,
  title  = {Minimal factorizations of a cycle: a multivariate generating function},
  author = {Philippe Biane and Matthieu Josuat-Vergès},
  journal= {arXiv preprint arXiv:1610.02982},
  year   = {2021}
}

Comments

Published as a FPSAC abstract (FPSAC 2016, Vancouver)

R2 v1 2026-06-22T16:16:35.052Z