The Average Number of Block Interchanges Needed to Sort A Permutation and a recent result of Stanley
classification
🧮 math.CO
keywords
averageblockinterchangesneedednumberpermutationresultsort
read the original 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 $n$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.