Increasing subsequences and the classical groups
Summary: We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we show that the \(2n\)th moment of the trace of a random \(k\)-dimensional unitary matrix is equal to the number of permutations of length \(n\) with no increasing subsequence of length greater than \(k\). We then generalize this to other expectations over the unitary group, as well as expectations over the orthogonal and symplectic groups. In each case, the expectations count objects with restricted ``increasing subsequence length.
- Unitary designs and codes
- Moments of characteristic polynomials enumerate two-rowed lexicographic arrays
- Integrals over Grassmannians and random permutations.
- Affine shuffles, shuffles with cuts, the Whitehouse module, and patience sorting
- Random unitary matrices, permutations and Painlevé
- Toeplitz minors
- Notes on \(G_{2}\), determinants, and equidistribution
- GL(n, q) and increasing subsequences in non-uniform random permutations
- Stieltjes moment sequences for pattern-avoiding permutations
- Painlevé II in random matrix theory and related fields
- Averages over classical Lie groups, twisted by characters
- Limiting distribution of maximal crossing and nesting of Poissonized random matchings
- Symmetrized models of last passage percolation and non-intersecting lattice paths
- Counting formulas associated with some random matrix averages
- Finite size corrections relating to distributions of the length of longest increasing subsequences
- Flat matrix models for quantum permutation groups
- On the distribution of the length of the longest increasing subsequence of random permutations
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Asymptotics of Plancherel measures for symmetric groups
- Spin correlation functions, Ramus-like identities, and enumeration of constrained lattice walks and plane partitions
- On the distribution of the number of fixed vectors for the finite classical groups
- Asymptotic expansions relating to the distribution of the length of longest increasing subsequences
- Non-intersecting Brownian walkers and Yang-Mills theory on the sphere
- Magic squares, the symmetric group and Möbius randomness
- A Stirling-type formula for the distribution of the length of longest increasing subsequences
- Identity between restricted Cauchy sums for the \(q\)-Whittaker and skew Schur polynomials
- Analysing quantum systems with randomised measurements
- Higher-order linear differential equations for unitary matrix integrals: applications and generalisations (with an appendix by Folkmar Bornemann)
- Asymptotic Expansions Relating to the Lengths of Longest Monotone Subsequences of Involutions
- Random circuits in the black hole interior
- Edge density expansions for the classical Gaussian and Laguerre ensembles
- Third moments of qudit Clifford orbits and 3-designs based on magic orbits
- On the averages of characteristic polynomials from classical groups
- Giambelli compatible point processes
This page was built for publication: Increasing subsequences and the classical groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379136)
