Permutations with short monotone subsequences

DOI10.1016/j.aam.2005.08.008zbMath1109.05015OpenAlexW2068671917MaRDI QIDQ867911

Dan Romik

Publication date: 19 February 2007

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2005.08.008

zbMATH Keywords

Erdős-Szekeres theoremYoung tableauxRobinson-Schensted correspondence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (7)

Erdős-Szekeres theorem for cyclic permutations ⋮ The skew Brownian permuton: A new universality class for random constrained permutations ⋮ Baxter permuton and Liouville quantum gravity ⋮ Second class particles and limit shapes of evacuation and sliding paths for random tableaux. ⋮ On increasing subsequences of minimal Erdős-Szekeres permutations ⋮ Saturation problems in the Ramsey theory of graphs, posets and point sets ⋮ The feasible region for consecutive patterns of permutations is a cycle polytope

Cites Work

• Unnamed Item
• Unnamed Item
• The number of steps in the Robinson-Schensted algorithm
• Balanced tableaux
• Limit shapes for random square Young tableaux

This page was built for publication: Permutations with short monotone subsequences