Random permutations and the discrete Bessel kernel
From MaRDI portal
Recommendations
- On the distribution of the length of the longest increasing subsequence of random permutations
- The longest increasing subsequence in a random permutation and a unitary random matrix model
- On increasing subsequences of random permutations
- The asymptotics of monotone subsequences of involutions
- Permutations without long decreasing subsequences and random matrices
Cited in
(6)- Random discretization of the finite Fourier transform and related kernel random matrices
- Symmetrized random permutations
- Gaussian fluctuations of Young diagrams and structure constants of Jack characters
- Increasing subsequences and the hard-to-soft edge transition in matrix ensembles
- A Stirling-type formula for the distribution of the length of longest increasing subsequences
- Asymptotics of the Airy-kernel determinant
This page was built for publication: Random permutations and the discrete Bessel kernel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2759650)