Monotone subsets in lattices and the Schensted shape of a S\'os permutation
Abstract
For a fixed irrational number α and n∈ N, we look at the shape of the sequence (f(1),…,f(n)) after Schensted insertion, where f(i) = α i 1. Our primary result is that the boundary of the Schensted shape is approximated by a piecewise linear function with at most two slopes. This piecewise linear function is explicitly described in terms of the continued fraction expansion for α. Our results generalize those of Boyd and Steele, who studied longest monotone subsequences. Our proofs are based on a careful analysis of monotone sets in two-dimensional lattices.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.