most citedThe Average Number of Block Interchanges Needed to Sort A Permutation and a recent result of Stanley

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2008★ 2 cited

The Average Number of Block Interchanges Needed to Sort A Permutation and a recent result of Stanley

Miklos Bona, Ryan Flynn

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 b…

math.CO2008

Sorting a Permutation by block moves

Miklos Bona, Ryan Flynn

We prove a lower and an upper bound on the number of block moves necessary to sort a permutation. We put our results in contrast with existing results on sorting by block transposi…