On the longest increasing subsequence for finite and countable alphabets

DOI10.1214/09-IMSCOLL513zbMath1243.60022arXivmath/0612364OpenAlexW2104410155MaRDI QIDQ2900956

Trevis J. Litherland, Christian Houdré

Publication date: 26 July 2012

Published in: Institute of Mathematical Statistics Collections (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0612364

zbMATH Keywords

functional central limit theoremlongest increasing subsequenceBrownian functionaltracy-widom distribution

Mathematics Subject Classification ID

Gaussian processes (60G15) Central limit and other weak theorems (60F05) Sample path properties (60G17) Asymptotic enumeration (05A16) Functional limit theorems; invariance principles (60F17)

Related Items (8)

On the rate of approximation in finite-alphabet longest increasing subsequence problems ⋮ Asymptotics for random Young diagrams when the word length and alphabet size simultaneously grow to infinity ⋮ On the limiting law of the length of the longest common and increasing subsequences in random words ⋮ Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm ⋮ Simultaneous large deviations for the shape of Young diagrams associated with random words ⋮ On the limiting law of the length of the longest common and increasing subsequences in random words with arbitrary distribution ⋮ On the Limiting Shape of Young Diagrams Associated with Inhomogeneous Random Words ⋮ Multi-state asymmetric simple exclusion processes

This page was built for publication: On the longest increasing subsequence for finite and countable alphabets