scientific article; zbMATH DE number 7250398
From MaRDI portal
Publication:5121952
zbMath1463.05004MaRDI QIDQ5121952
Publication date: 22 September 2020
Full work available at URL: https://www.dmlett.com/archive/v4/DML20_v4_p56_59.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
generating functionspattern-avoidancepattern-avoiding involutionslongest increasing subsequence problem
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Patterns in permutations and words.
- Stack sortable permutations
- A variational problem for random Young tableaux
- Level-spacing distributions and the Airy kernel
- A microscopic model for the Burgers equation and longest increasing subsequences
- Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
- Longest monotone subsequences and rare regions of pattern-avoiding permutations
- Combinatorics of Permutations
- The Surprising Mathematics of Longest Increasing 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
- Recent progress in algebraic combinatorics
- Combinatorics and Random Matrix Theory
- Restricted permutations