A concentration bound for the longest increasing subsequence of a randomly chosen involution
From MaRDI portal
Publication:2500530
DOI10.1016/j.dam.2006.03.025zbMath1098.60008MaRDI QIDQ2500530
Publication date: 17 August 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.025
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the length of the longest monotone subsequence in a random permutation
- The height of a random partial order: Concentration of measure
- The asymptotics of monotone subsequences of involutions
- Concentration of measure and isoperimetric inequalities in product spaces
- On increasing subsequences of random permutations
- Expected length of the longest common subsequence for large alphabets
- 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
- Recent progress in algebraic combinatorics