Minimal factorizations of a cycle: a multivariate generating function

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…