Permutations with short monotone subsequences
From MaRDI portal
Recommendations
Cites work
Cited in
(17)- Monotonic subsequences in permutations of n natural numbers
- Erdős-Szekeres theorem for cyclic permutations
- Saturation problems in the Ramsey theory of graphs, posets and point sets
- Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization
- On five types of crucial permutations with respect to monotone patterns
- Second class particles and limit shapes of evacuation and sliding paths for random tableaux.
- An Erdős-Hajnal analogue for permutation classes
- Permutations with short monotone subsequences
- Erdős-Szekeres tableaux
- On increasing subsequences of minimal Erdős-Szekeres permutations
- Monotone subsets in lattices and the Schensted shape of a Sós permutation
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- On Erdős' theorem for monotonic subsequences
- The feasible region for consecutive patterns of permutations is a cycle polytope
- The skew Brownian permuton: A new universality class for random constrained permutations
- Baxter permuton and Liouville quantum gravity
- Increasing subsequences of linear size in random permutations and the Robinson-Schensted tableaux of permutons
This page was built for publication: Permutations with short monotone subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867911)