The average number of block interchanges needed to sort a permutation and a recent result of Stanley
From MaRDI portal
Publication:989529
DOI10.1016/J.IPL.2009.04.019zbMATH Open1202.68272arXiv0811.0740OpenAlexW2022299043MaRDI QIDQ989529FDOQ989529
Publication date: 20 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Abstract: We use an interesting result of probabilistic flavor concerning the product of two permutations consisting of one cycle each to find an explicit formula for the average number of block interchanges needed to sort a permutation of length .
Full work available at URL: https://arxiv.org/abs/0811.0740
Recommendations
Cites Work
- Title not available (Why is that?)
- Inductive and injective proofs of log concavity results
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nombre de représentations d'une permutation comme produit de deux cycles de longueurs données
- Two enumerative results on cycles of permutations
- Sorting permutations by block-interchanges
Cited In (9)
- Data Exchange and Permutation Length
- A versatile combinatorial approach of studying products of long cycles in symmetric groups
- An improved algorithm for sorting by block-interchanges based on permutation groups
- Approximation algorithms for sorting permutations by extreme block-interchanges
- On the average number of reversals needed to sort signed permutations
- On products of permutations with the most uncontaminated cycles by designated labels
- The distribution of cycles in breakpoint graphs of signed permutations
- Plane permutations and applications to a result of Zagier-Stanley and distances of permutations
- Separation Probabilities for Products of Permutations
This page was built for publication: The average number of block interchanges needed to sort a permutation and a recent result of Stanley
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989529)
