Longest increasing subsequences of random colored permutations (Q1277789): Difference between revisions

The limit distribution of the length of the longest increasing subsequence in a random permutation of order \(n\) is well studied. Here a colored version of the problem is solved, in which the elements are randomly colored with \(m\) colors, and we are after the longest monochromatic increasing subsequence. For two colors this is also called a random signed permutation and was studied before. The proof relies on a one-to-one correspondence with generalized Young tableaux.