The average number of block interchanges needed to sort a permutation and a recent result of Stanley

Information Processing Letters

Volumn 109, Issue 16, 2009, Pages 927-931

  Bóna, Miklós ^a   Flynn, Ryan ^b  

^a UNIVERSITY OF FLORIDA   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Analysis of algorithms; Block interchanges; Cycles; Permutations; Probability; Sorting

Indexed keywords

ANALYSIS OF ALGORITHMS; AVERAGE NUMBERS; BLOCK INTERCHANGES; CYCLES; EXPLICIT FORMULA; PERMUTATIONS;

INTERCHANGES;

EID: 67649365634     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.04.019     Document Type: Article

References (9)

1. Boccara G. Nombres de répresentations d'une permutation comme produit de deux cycles de longueur données. Discrete Math. 29 (1980) 105-134
2. Bóna M. Introduction to Enumerative Combinatorics (2007), McGraw-Hill
3. Christie D.A. Sorting permutations by block interchanges. Inform. Process. Lett. 60 (1996) 165-169
4. Doignon J.-P., and Labarre A. On Hultman numbers. Journal of Integer Sequences 10 (2007) Article 07.6.2
5. A. Hultman, Toric Permutations, Master's thesis, Department of Mathematics, KTH, Stockholm, Sweden, 1999
6. Sagan B.E. Inductive and injective proofs of log concavity results. Discrete Math. 68 2-3 (1988) 281-292
7. R. Stanley, Two enumerative results on cycles of permutations, preprint
8. R. Stanley, Personal communication, October, 2008
9. Stanley R. Enumerative Combinatorics vol. 2 (1999), Cambridge University Press. (Supplementary Exercises (without solutions) for Ch. 7 (Symmetric functions)); Internet resource available at math.mit.edu/~rstan/ec/ch7supp.pdf