English

An RSK correspondence for cylindric tableaux

Combinatorics 2026-03-17 v2

Abstract

This paper establishes an analogue of the Robinson--Schensted correspondence for cylindric tableaux. In particular, for any pair of positive integers (d,L)(d,L), we construct a bijection between permutations that avoid the patterns d1(d+1)d\cdots 1 (d+1) and 1(L+1)1\cdots (L+1) and pairs of (d,L)(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 SnS_n that avoid the patterns d1(d+1)d\cdots 1 (d+1) and 1(L+1)1\cdots (L+1) as nn\to\infty.

Keywords

Cite

@article{arxiv.2603.09119,
  title  = {An RSK correspondence for cylindric tableaux},
  author = {Alexander Dobner},
  journal= {arXiv preprint arXiv:2603.09119},
  year   = {2026}
}

Comments

35 pages, 9 figures

R2 v1 2026-07-01T11:11:33.629Z