Hydrodynamical methods for analyzing longest increasing subsequences

DOI10.1016/S0377-0427(01)00461-7zbMath1001.60010MaRDI QIDQ1612295

Piet Groeneboom

Publication date: 22 August 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

longest increasing subsequenceUlam's problemHammersley's process

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Related Items (11)

Longest increasing subsequences in sliding windows ⋮ Longest increasing paths with gaps ⋮ From Hammersley's lines to Hammersley's trees ⋮ Longest increasing paths with Lipschitz constraints ⋮ Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process ⋮ The random average process and random walk in a space-time random environment in one dimension ⋮ On the collision between two PNG droplets ⋮ Unnamed Item ⋮ Order of the variance in the discrete Hammersley process with boundaries ⋮ Hammersley's process with sources and sinks ⋮ Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotics of maximal and typical dimensions of irreducible representations of a symmetric group
• Subadditive ergodic theory
• Combinatoire et représentation du groupe symétrique. Actes de la Table Ronde du C.N.R.S. tenue à l'Université Louis-Pasteur de Strasbourg, 26 au 30 avril 1976
• A variational problem for random Young tableaux
• Large deviations for increasing sequences on the plane
• Asymptotic theory of characters of the symmetric group
• Hammersley's interacting particle process and longest increasing subsequences
• A microscopic model for the Burgers equation and longest increasing subsequences
• On Increasing Subsequences of I.I.D. Samples
• 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

This page was built for publication: Hydrodynamical methods for analyzing longest increasing subsequences