On increasing subsequences of random permutations

DOI10.1006/jcta.1996.0095zbMath0859.05002OpenAlexW2069679066MaRDI QIDQ1924244

Jeong Han Kim

Publication date: 7 April 1997

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f5dea969a8fc09cb9908c474ac6fefd382523819

zbMATH Keywords

probabilityvariancerandom permutationlongest increasing subsequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items

Perturbation of the equilibrium for a totally asymmetric stick process in one dimension, Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem, Random partial orders defined by angular domains, Large deviation rate functions for the partition function in a log-gamma distributed random potential, On increasing subsequences of minimal Erdős-Szekeres permutations, Optimal online selection of a monotone subsequence: a central limit theorem, A concentration bound for the longest increasing subsequence of a randomly chosen involution, Fractional moments of the stochastic heat equation, The corner growth model with exponential weights