15 citations · 25 across the 4 of their papers we have counts for
Showing math.COShow all
3 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…
math.CO2006★ 8 cited
Permutations Containing Many Patterns
M. H. Albert, Micah Coleman, Ryan Flynn +1
It is shown that the maximum number of patterns that can occur in a permutation of length is asymptotically . This significantly improves a previous result of Coleman.