Hostname: page-component-7479d7b7d-jwnkl Total loading time: 0 Render date: 2024-07-13T17:51:45.259Z Has data issue: false hasContentIssue false
  • English
  • Français

Separation Probabilities for Products of Permutations

Published online by Cambridge University Press:  13 December 2013

OLIVIER BERNARDI ,
ROSENA R. X. DU ,
ALEJANDRO H. MORALES  and
RICHARD P. STANLEY
OLIVIER BERNARDI
Affiliation:
Department of Mathematics, Massachusetts Institute of Technology; Cambridge, MAUSA02139 (e-mail: bernardi@math.mit.edu, ahmorales@math.mit.edu, rstan@math.mit.edu)
ROSENA R. X. DU
Affiliation:
Department of Mathematics, East China Normal University; Shanghai, China200041 (e-mail: rxdu@math.ecnu.edu.cn)
ALEJANDRO H. MORALES
Affiliation:
Department of Mathematics, Massachusetts Institute of Technology; Cambridge, MAUSA02139 (e-mail: bernardi@math.mit.edu, ahmorales@math.mit.edu, rstan@math.mit.edu)
RICHARD P. STANLEY
Affiliation:
Department of Mathematics, Massachusetts Institute of Technology; Cambridge, MAUSA02139 (e-mail: bernardi@math.mit.edu, ahmorales@math.mit.edu, rstan@math.mit.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements 1,2,. . .,k are in distinct cycles of the random permutation of {1,2,. . .,n} obtained as a product of two uniformly random n-cycles.

Keywords

Primary 05A05Secondary 05E0560C05
Type
Paper
Information
Combinatorics, Probability and Computing , Volume 23 , Issue 2 , March 2014 , pp. 201 - 222
Copyright
Copyright © Cambridge University Press 2013 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Bernardi, O. (2012) An analogue of the Harer–Zagier formula for unicellular maps on general surfaces. Adv. Appl. Math. 48 164–180.Google Scholar
[2]Bernardi, O. and Morales, A. H. (2013) Bijections and symmetries for the factorizations of the long cycle. Adv. Appl. Math. 50 702–722.Google Scholar
[3]Bóna, M. and Flynn, R. (2009) The average number of block interchanges needed to sort a permutation and a recent result of Stanley. Inform. Process. Lett. 109 927–931.Google Scholar
[4]Cori, R., Marcus, M. and Schaeffer, G. (2012) Odd permutations are nicer than even ones. Europ. J. Combin. 33 1467–1478.Google Scholar
[5]Féray, V. and Rattan, A. (2012) On products of long cycles: short cycle dependence and separation probabilities. arXiv:1211.6630Google Scholar
[6]Harer, J. and Zagier, D. (1986) The Euler characteristic of the moduli space of curves. Invent. Math. 85 457–485.CrossRefGoogle Scholar
[7]Jackson, D. M. (1988) Some combinatorial problems associated with products of conjugacy classes of the symmetric group. J. Combin. Theory Ser. A 49 363–369.CrossRefGoogle Scholar
[8]Lando, S. K. and Zvonkin, A. K. (2004) Graphs on Surfaces and their Applications, Springer.Google Scholar
[9]Mohar, B. and Thomassen, C. (2001) Graphs on Surfaces, Johns Hopkins University Press.CrossRefGoogle Scholar
[10]Morales, A. H. and Vassilieva, E. A. (2009) Bijective enumeration of bicolored maps of given vertex degree distribution. In DMTCS Proc. AK.CrossRefGoogle Scholar
[11]Schaeffer, G. and Vassilieva, E. A. (2008) A bijective proof of Jackson's formula for the number of factorizations of a cycle. J. Combin. Theory Ser. A 115 903–924.Google Scholar
[12]Stanley, R. P. (1999) Enumerative Combinatorics, Vol. 2, Cambridge University Press.Google Scholar
[13]Stanley, R. P. (2010) Products of cycles. Slides for the conference Permutation Patterns 2010. www-math.mit.edu/~rstan/transparencies/cycleprod.pdf.Google Scholar
[14]Stanley, R. P. (2011) Two enumerative results on cycles of permutations. Europ. J. Combin. 32 937–943.CrossRefGoogle Scholar
[15]Vassilieva, E. A. (2011) Explicit monomial expansions of the generating series for connection coefficients. arXiv:1111.6215Google Scholar