An RSK correspondence for cylindric tableaux
Abstract
This paper establishes an analogue of the Robinson--Schensted correspondence for cylindric tableaux. In particular, for any pair of positive integers (d,L), we construct a bijection between permutations that avoid the patterns d·s 1 (d+1) and 1·s (L+1) and pairs of (d,L)-cylindric standard Young tableaux with a common shape. This arises as a special case of a Knuth-type generalization involving cylindric semistandard tableaux and a further generalization involving oscillating tableaux. Using these results, we construct several other bijections and derive enumerative consequences involving cylindric tableaux and pattern-avoiding permutations. For example, we give an asymptotic for the number of permutations in Sn that avoid the patterns d·s 1 (d+1) and 1·s (L+1) as n∞.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.