Discrete Mathematics & Theoretical Computer Science 
We consider permutations of $1,2,...,n^2$ whose longest monotone subsequence is of length $n$ and are therefore extremal for the ErdősSzekeres Theorem. Such permutations correspond via the RobinsonSchensted correspondence to pairs of square $n \times n$ Young tableaux. We show that all the bumping sequences are constant and therefore these permutations have a simple description in terms of the pair of square tableaux. We deduce a limit shape result for the plot of values of the typical such permutation, which in particular implies that the first value taken by such a permutation is with high probability $(1+o(1))n^2/2$.
Source : ScholeXplorer
IsRelatedTo ARXIV 1511.01076 Source : ScholeXplorer IsRelatedTo DOI 10.46298/dmtcs.1328
