On the number of factorizations of a full cycle

We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic means, extending recent work of Biane [Nombre de factorisations d'un grand cycle, S

• Type: Journal
• Year: 2006
• Where: JCT
• Authors: John Irving
• Keywords: Discrete Math, Grand Cycle, JCT 2006, Large Cycles