15 citations · 25 across the 4 of their papers we have counts for
4 papers
Graph components and dynamics over finite fields
Ryan Flynn, Derek Garton
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average nu…
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…
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…
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.