GL(n, q) and increasing subsequences in non-uniform random permutations (Q1865113): Difference between revisions

The relationship between increasing subsequences of random permutations and eigenvalues of random complex matrices is studied. On the basis of properties of a probability measure \(P_{n,q}\) on partitions of size \(n\) and a measure \(Q_{n,q}\) on partitions of size \(n\) it is proved that although \(P_{n,q}\) and \(Q_{n,q}\) are different, they are sufficiently similar that information about \(P_{n,q}\) can be used to deduce information about \(Q_{n,q}\). The connection between eigenvalues of elements of finite classical groups \(GL(n,q)\) and longest increasing and decreasing subsequences in non-uniform random permutations is presented.