Minimal factorizations of a cycle: a multivariate generating function

preprint2016arXivOpen access

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 nk−1n^{k-1} where nn is the rank of the underlying symmetric group and kk is the number of factors. In particular, this is nn−2n^{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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.