On increasing subsequences of minimal Erdős-Szekeres permutations

DOI10.1007/S10114-011-8653-6MaRDI QIDQ475768zbMATH OpenOpenAlexFDO

Authors Zhong Gen Su

Publication date 27 November 2014

Published in Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10114-011-8653-6

zbMATH Keywords

large deviationYoung tableauxRobinson-Schensted-Knuth correspondenceminimal Erdős-Szekeres permutation

Mathematics Subject Classification ID

Large deviations (60F10) Combinatorial probability (60C05)

Recommendations

• On increasing subsequences of random permutations
• Publication:4724636
• scientific article; zbMATH DE number 3880704
• Continuously increasing subsequences of random multiset permutations
• Continuously increasing subsequences of random multiset permutations
• scientific article; zbMATH DE number 1515819
• scientific article; zbMATH DE number 1047715
• On the enumeration of \(d\)-minimal permutations
• scientific article; zbMATH DE number 795114

Cites work

• Gaussian fluctuations of Young diagrams under the Plancherel measure
• Limit shapes for random square Young tableaux
• Longest Increasing and Decreasing Subsequences
• On Increasing Subsequences of I.I.D. Samples
• On increasing subsequences of random permutations
• On the distribution of the length of the longest increasing subsequence of random permutations
• Permutations with short monotone subsequences

Cited in

(3)

• Inversions and longest increasing subsequence for \(k\)-card-minimum random permutations
• Erdős-Szekeres theorem for cyclic permutations
• Moderate deviations for longest increasing subsequences: The lower tail

This page was built for publication: On increasing subsequences of minimal Erdős-Szekeres permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475768)