Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. The expected number ...
Article

The expected number of inversions after n adjacent transpositions

Mireille Bousquet-Mélou ORCID
Download article
Open on HAL
Imported on
March 26, 2015
Published on
August 31, 2009
Last modified on
March 31, 2025
Volume 12
vol. 12:2
DOI
10.46298/dmtcs.478
Indicators
890
Views
746
Downloads

The expected number of inversions after n adjacent transpositions

Mireille Bousquet-Mélou ORCID
Abstract
We give a new expression for the expected number of inversions in the product of n random adjacent transpositions in the symmetric group S_{m+1}. We then derive from this expression the asymptotic behaviour of this number when n scales with m in various ways. Our starting point is an equivalence, due to Eriksson et al., with a problem of weighted walks confined to a triangular area of the plane.
Keywords
  • 05A05, 05A15, 05A16, 60J10
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [MATH.MATH-PR]Mathematics [math]/Probability [math.PR]
  • Permutations
  • Markov chains
  • inversions
Preview
Loading PDF preview...