Variations on Hammersley’s interacting particle process

DOI10.47443/dml.2021.0049OpenAlexW3173999780MaRDI QIDQ5051443

No author found.

Publication date: 23 November 2022

Published in: Discrete Mathematics Letters (Search for Journal in Brave)

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

zbMATH Keywords

permutation patternslongest increasing subsequencesHammersley's process

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Excluded permutation matrices and the Stanley-Wilf conjecture
• The longest increasing subsequence in a random permutation and a unitary random matrix model
• An extension of Schensted's theorem
• Level-spacing distributions and the Airy kernel
• The asymptotics of monotone subsequences of involutions
• Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
• The Surprising Mathematics of Longest Increasing Subsequences
• Longest Increasing and Decreasing Subsequences
• 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
• Commentary on “Longest increasing subsequences: from patience sorting to the Baik–Deift–Johansson theorem” by David Aldous and Persi Diaconis
• On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation