Symmetrized random permutations

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\'e 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…