The Average Number of Block Interchanges Needed to Sort A Permutation and a recent result of Stanley
Combinatorics
2008-11-06 v1
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 .
Keywords
Cite
@article{arxiv.0811.0740,
title = {The Average Number of Block Interchanges Needed to Sort A Permutation and a recent result of Stanley},
author = {Miklos Bona and Ryan Flynn},
journal= {arXiv preprint arXiv:0811.0740},
year = {2008}
}
Comments
8 pages, 4 figures