%0 Journal Article
%T On the Longest Common Pattern Contained in Two or More Random Permutations
%A Michael Earnest
%A Anant Godbole
%A Yevgeniy Rudoy
%J Mathematics
%D 2014
%I arXiv
%X We provide upper and lower bounds for the expected length $\mathbb E(L_{n,m})$ of the longest common pattern contained in $m$ random permutations of length $n$. We also address the tightness of the concentration of $L_{n,m}$ around $\mathbb E(L_{n,m})$.
%U http://arxiv.org/abs/1402.0137v1