Permutations with short monotone subsequences

DOI10.1016/J.AAM.2005.08.008zbMATH Open1109.05015OpenAlexW2068671917MaRDI QIDQ867911FDOQ867911

Authors: 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

Recommendations

• Permutations with short monotone subsequences
• The minimum number of monotone subsequences
• Monotone subsets in lattices and the Schensted shape of a Sós permutation
• Limit shapes for random square Young tableaux
• Longest increasing subsequences in pattern-restricted permutations

zbMATH Keywords

Young tableauxRobinson-Schensted correspondenceErdős-Szekeres theorem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Limit shapes for random square Young tableaux
• Balanced tableaux
• The number of steps in the Robinson-Schensted algorithm

Cited In (17)

• Monotonic subsequences in permutations of n natural numbers
• An Erdős-Hajnal analogue for permutation classes
• Baxter permuton and Liouville quantum gravity
• Permutations with short monotone subsequences
• The feasible region for consecutive patterns of permutations is a cycle polytope
• Saturation problems in the Ramsey theory of graphs, posets and point sets
• Increasing subsequences of linear size in random permutations and the Robinson-Schensted tableaux of permutons
• 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
• The skew Brownian permuton: A new universality class for random constrained permutations
• Erdős-Szekeres theorem for cyclic permutations
• Second class particles and limit shapes of evacuation and sliding paths for random tableaux.
• Monotone subsets in lattices and the Schensted shape of a Sós permutation
• Minimum Number of Monotone Subsequences of Length 4 in Permutations
• Erdős-Szekeres tableaux
• On increasing subsequences of minimal Erdős-Szekeres permutations
• On Erdős' theorem for monotonic subsequences

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)