On the cycle structure of the product of random maximal cycles

The subject of this paper is the cycle structure of the random permutation $\sigma$ of $[N]$, which is the product of $k$ independent random cycles of maximal length $N$. We use the character-based Fourier transform to study the number of cycles of $\sigma$ and also the distribution of the elements of the subset $[\ell]$ among the cycles of $\sigma$.

[1]  A. Zvonkin,et al.  Graphs on Surfaces and Their Applications , 2003 .

[2]  J. Harer,et al.  The Euler characteristic of the moduli space of curves , 1986 .

[3]  Tianming Wang,et al.  Identities involving reciprocals of binomial coefficients. , 2004 .

[4]  Rosena R. X. Du,et al.  Separation Probabilities for Products of Permutations , 2014, Comb. Probab. Comput..

[5]  Alain Goupil.  On products of conjugacy classes of the symmetric group , 1990, Discret. Math..

[6]  Guillaume Fertin,et al.  Combinatorics of Genome Rearrangements , 2009, Computational molecular biology.

[7]  Anthony Labarre,et al.  On Hultman numbers , 2007 .

[8]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[9]  B. Sagan,et al.  Longest Increasing Subsequences and Log Concavity , 2015, 1511.08653.

[10]  Miklós Bóna,et al.  The average number of block interchanges needed to sort a permutation and a recent result of Stanley , 2009, Inf. Process. Lett..

[11]  D. Jackson.  Counting cycles in permutations by group characters, with an application to a topological problem , 1987 .

[12]  Richard P. Stanley,et al.  Factorization of permutations into n-cycles , 1981, Discret. Math..

[13]  P. Diaconis.  Group representations in probability and statistics , 1988 .

[14]  Doron Zeilberger,et al.  An algorithmic proof theory for hypergeometric (ordinary and “q”) multisum/integral identities , 1992 .

[15]  T. Inui,et al.  The Symmetric Group , 1990 .

[16]  Don Zagier.  On the distribution of the number of cycles of elements in symmetric groups , 1995 .

[17]  Doron Zeilberger,et al.  How to do monthly problems with your computer , 1997 .

[18]  Leonardo Cangelmi.  Factorizations of an n-cycle into two n-cycles , 2003, Eur. J. Comb..

[19]  Igor Pak,et al.  Rapidly Mixing Random Walks and Bounds on Characters of the Symmetric Group , 2002 .

[20]  P. Diaconis,et al.  Generating a random permutation with random transpositions , 1981 .

[21]  Product decompositions in finite simple groups , 2011, 1107.1528.

[22]  Boris G. Pittel.  Another Proof of the Harer-Zagier Formula , 2016, Electron. J. Comb..

[23]  Leon M. Hall,et al.  Special Functions , 1998 .

[24]  P. Diaconis,et al.  The cutoff phenomenon in finite Markov chains. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[25]  Boris Pittel,et al.  On a surface formed by randomly gluing together polygonal discs , 2015, Adv. Appl. Math..

[26]  B. Sury,et al.  Sum of the Reciprocals of the Binomial Coefficients , 1993, Eur. J. Comb..

[27]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[28]  Vineet Bafna,et al.  Sorting by Transpositions , 1998, SIAM J. Discret. Math..

[29]  T. Walsh,et al.  Counting rooted maps by genus II , 1972 .

[30]  Gilles Schaeffer,et al.  Factoring N-Cycles and Counting Maps of Given Genus , 1998, Eur. J. Comb..

[31]  Richard P. Stanley.  Two enumerative results on cycles of permutations , 2011, Eur. J. Comb..