Kammoun, Slim (2020) On the Longest Common Subsequence of Conjugation Invariant Random Permutations. The Electronic Journal of Combinatorics, 27 (4). ISSN 1077-8926
Full text not available from this repository.Abstract
Bukh and Zhou conjectured that the expectation of the length of the longest common subsequence of two i.i.d random permutations of size n is greater than √ n . We prove in this paper that there exists a universal constant n 1 such that their conjecture is satisfied for any pair of i.i.d random permutations of size greater than n 1 with distribution invariant under conjugation. More generally, in the case where the laws of the two permutations are not necessarily the same, we give a lower bound for the expectation. In particular, we prove that if one of the permutations is invariant under conjugation and with a good control of the expectation of the number of its cycles, the limiting fluctuations of the length of the longest common subsequence are of Tracy-Widom type. This result holds independently of the law of the second permutation.