Symmetrized random permutations
Jinho Baik, Eric M. Rains
Abstract
Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed involutions. We are interested in the statistics of the length of the longest up/right path of random points selections in each symmetry type as the number of points increases to infinity. The limiting distribution functions are expressed in terms of Painlevé II equation. Some of them are Tracy-Widom distributions in random matrix theory, while there are two new classes of distribution functions interpolating GOE and GSE, and GUE and GOE2 Tracy-Widom distribution functions. Also some applications and related topics are discussed.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.