Michael J. Earnest

most citedPermutation Patterns in Latin Squares

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

collaborators

3 papers

math.PR2016

A countdown process, with application to the rank of random matrices over $F_{q} (n)$

Richard Arratia, Michael Earnest

Motivated by the work of Fulman and Goldstein, comparing the distribution of the corank of random matrices in $F_{q} [n]$ with the limit distribution as $n \to \infty$ , we def…

math.CO2014★ 1 cited

Permutation Patterns in Latin Squares

Michael J. Earnest, Samuel C. Gutekunst

In this paper we study pattern avoidance in Latin Squares, which gives us a two dimensional analogue of the well studied notion of pattern avoidance in permutations. Our main resul…

math.CO2014

On the Longest Common Pattern Contained in Two or More Random Permutations

Michael Earnest, Anant Godbole, Yevgeniy Rudoy

We provide upper and lower bounds for the expected length $E (L_{n, m})$ of the longest common pattern contained in $m$ random permutations of length $n$ . We also address the…

A countdown process, with application to the rank of random matrices over Fq​(n)

Permutation Patterns in Latin Squares

On the Longest Common Pattern Contained in Two or More Random Permutations

A countdown process, with application to the rank of random matrices over $F_{q} (n)$