Semistandard Oscillating Tableaux (SSOT)

• SSOT is a combinatorial object that synthesizes classical semistandard tableaux and oscillating tableau chains with weight labeling to capture representation-theoretic information.
• It employs horizontal strip additions and deletions to create a structured sequence of partitions, establishing bijections with King tableaux and semistandard Young tableaux.
• SSOTs generate symmetric functions and facilitate crystal structure analysis, enabling explicit combinatorial formulas for computing representation-theoretic multiplicities.

A semistandard oscillating tableau (SSOT) is a combinatorial object synthesizing classical semistandard tableaux and oscillating (up/down) tableau chains, equipped with labelings that track weights in crystal-theoretic and representation-theoretic frameworks. Originally emerging in the context of type C RSK correspondences, SSOTs underpin crucial bijections, combinatorial identities, and structural properties for classical groups, notably $\mathrm{Sp}(2n)$. SSOTs generalize both standard oscillating tableaux (Sundaram/Proctor) and semistandard Young tableaux, and have been established as Q-tableaux in symplectic RSK, crystal models for KR crystals, and combinatorial tools for representation-theoretic multiplicities (Okada, 2016, Lee, 2019, Krattenthaler, 2014, Kobayashi et al., 7 Jun 2025, Kobayashi et al., 24 Jan 2026).

1. Formal Definition and Structure

An SSOT, parameterized by a partition $\lambda$ of length $\leq k$, an integer length $n$, and (optionally) a weight composition, is most commonly given in one of two equivalent forms:

• Partition Sequence Formulation: An SSOT is a sequence of partitions

$$S = (S^{(0)}, S^{(1)}, S^{(2)},\dots,S^{(2k)}=\lambda)$$

with $S^{(0)} = \varnothing$, such that for each $1\leq i \leq k$, - $S^{(2i-2)} \supseteq S^{(2i-1)}$ (deletion of a horizontal strip) - $S^{(2i-1)} \subseteq S^{(2i)}$ (addition of a horizontal strip) and the differences $S^{(2i-2)} \setminus S^{(2i-1)}$ and $S^{(2i)} \setminus S^{(2i-1)}$ are horizontal strips (at most one box per column). The total number of boxes added or deleted is $n$ (Kobayashi et al., 7 Jun 2025, Kobayashi et al., 24 Jan 2026).

• Multiset-Valued Tableau Formulation: Alternatively, record at each step the index (or weight label) when a box is added/removed. The result is a multiset-valued tableau of shape $\lambda$ where each box is labeled by the set of sub-step indices in which it is involved. The weak increase of labels in columns and structural constraints reflect the horizontal-strip condition (Kobayashi et al., 7 Jun 2025, Kobayashi et al., 24 Jan 2026).

This formalism is uniform across classical types (A, B, C, D): type A reduces to usual semistandard tableaux, while in types B/C/D, supplementary constraints (on shape and strip growth) model highest-weight branching in the corresponding classical group (Okada, 2016).

2. Generating Functions and Symmetry

For $S \in \mathrm{SSOT}_\lambda(n)$, define the monomial weight $x^S = x_{u_1}x_{u_2}\cdots x_{u_n}$, where $(u_1,\dots,u_n)$ is the sequence of labels. The generating function

$$ss_{\lambda, n}(x) = \sum_{S \in \mathrm{SSOT}_\lambda(n)} x^S$$

captures the total weight distribution across all SSOTs of length $n$ and shape $\lambda$ (Kobayashi et al., 24 Jan 2026).

A central result establishes that $$ss_\lambda(x) = \sum_{n\geq |\lambda|,\, n \equiv |\lambda| \pmod2} ss_{\lambda, n}(x)$$ is a symmetric function. This conclusion is drawn by explicit combinatorial involutions (generalized Bender-Knuth) that interchange weights and, by comparison with Cauchy-type expansions, yields

$$ss_\lambda(x) = \prod_{i<j} (1 - x_i x_j)^{-1} s_\lambda(x)$$

where $s_\lambda(x)$ is the classical Schur function. Thus, $ss_\lambda(x)$ is not only symmetric but also Schur-positive (Kobayashi et al., 7 Jun 2025, Kobayashi et al., 24 Jan 2026).

3. Bijective Correspondences to Other Tableaux

SSOTs serve as the bridge in equinumerous correspondences among various tableau classes:

• Generalized Oscillating Tableaux (GOT): These are up/down walks on partitions with type-dependent constraints. There exists a bijection

$$|\mathrm{GOT}^X(\lambda; p, r)| = \sum_{\mu} |\mathrm{SSOT}^X(\emptyset, \lambda; p, \mu)| = |\mathrm{SST}^X(\lambda; 1^r)|$$

for classical types $X$ (Okada, 2016).

• Semistandard Young Tableaux (SSYT): Krattenthaler established a bijection where, for fixed weight $(j_1,\dots,j_n)$, SSOTs correspond to SSYTs with exactly $j_i$ entries $i$, prescribed odd column counts, and column-length bounds. The mapping uses a sequence of jeu de taquin slides, growth diagrams, and partitioned boundary tracking (Krattenthaler, 2014).
• King Tableaux (type C): There is a weight-preserving, crystal-compatible bijection between King tableaux of shape $\lambda$ and SSOTs of shape $\lambda^\perp$ (the rectangle complement) (Lee, 2019).

These combinatorial correspondences are not only enumerative: they preserve deeper crystal and representation-theoretic structures, and in the symplectic setting underpin double-crystal actions arising in RSK-type correspondences (Lee, 2019, Kobayashi et al., 7 Jun 2025).

4. Crystal Structure and Representation Theory

Each SSOT naturally carries a crystal structure with operators $e_i, f_i$ defined by local moves on the oscillating strip decomposition. In type C:

• For $i>0$, $e_i$ and $f_i$ modify the multiset of row indices in the strip chains, consistently with Kashiwara's crystal operators for $\mathfrak{sp}_{2m}$ (Lee, 2019).
• For $i=0$, a special symplectic move adds/removes pairs in row 1.
• Each SSOT crystal is isomorphic as a graph to that on the set of King tableaux, and, where the shape is a full rectangle, to Kirillov-Reshetikhin (KR) crystals $B^{m,g}$ (Lee, 2019).
• Highest-weight vectors correspond to elements with row-sequences concatenations $(1, \ldots, 1|2, \ldots, 2|\cdots|m, \ldots, m)$ (Lee, 2019).

The SSOT framework facilitates explicit descriptions, crystal-theoretic and combinatorial, for decompositions of tensor products and branching multiplicities---in particular for Littlewood–Richardson rules in symplectic type, where SSOTs count certain skew tableaux annihilated by all $e_i$ (Lee, 2019).

5. Insertion Algorithms, RSK, and Cauchy Identities

SSOTs function as $Q$-symbols in the type C (symplectic) RSK correspondence, specifically the King–Berele variation:

• Each input word (two-line arrays) produces a pair $(P_C(w), Q_C(w))$, where $P_C(w)$ is a King tableau and $Q_C(w)$ is the corresponding SSOT.
• The insertion procedure tracks the "time-stamp" of each addition or deletion, which is then recorded in the SSOT structure.
• The type C dual Cauchy identity under this correspondence reads

$$\sum_\lambda sp_\lambda(x) ss_\lambda(y) = \prod_{i,j=1}^k \frac{1}{(1-x_j y_i)(1-x_j^{-1} y_i)}$$

expressing the generating function of SSOTs in a symmetric, representation-theoretic framework (Kobayashi et al., 7 Jun 2025).

Classical Bender-Knuth involutions on SSYTs lift uniquely to SSOTs via the commutative diagram with King–Berele RSK and type A RSK, proving symmetry of the generating series in the weight variables (Kobayashi et al., 7 Jun 2025).

6. Enumerative and Algebraic Properties

SSOT sequences are counted by determinantal formulas and enjoy links with symmetric and quasisymmetric function theory:

• The generating function $ss_{\lambda,n}(x)$ expands positively in the fundamental quasisymmetric functions $F_a(x)$, per a type C Gessel formula, and admits further refinement to quasi-Yamanouchi representatives in a finite alphabet (Kobayashi et al., 24 Jan 2026).
• Each $ss_\lambda(x)$ is symmetric, Schur-positive, and possesses the saturated Newton polytope (SNP) property: the Newton polytope of $ss_{\lambda,n}(x_1,\dots,x_k)$ contains exactly the exponent vectors associated to nonzero monomial coefficients (Kobayashi et al., 24 Jan 2026).
• Enumeration in the stable range for classical types employs explicit determinantal and combinatorial formulas, generalizing the hook-content formula and leading to closed expressions involving Bessel functions and plethystic generating series (Okada, 2016, Krattenthaler, 2014).

7. Generalizations and Applications

SSOTs have been leveraged to:

• Give explicit character formulas and branching multiplicities for classical groups, notably via Pieri rules, reducing representation-theoretic computations to tableau enumeration (Okada, 2016).
• Provide new combinatorial interpretations for symplectic Littlewood–Richardson coefficients and $q$-weight multiplicities, including connections with Lusztig $q$-weight theory (Lee, 2019, Kobayashi et al., 24 Jan 2026).
• Unify models for other tableau-like objects, such as King tableaux, Kashiwara-Nakashima tableaux, and certain symmetric matrices underlying KR crystals (Kobayashi et al., 7 Jun 2025, Lee, 2019).
• Serve as test objects for symmetry and positivity phenomena in algebraic combinatorics and as building blocks for further generalizations in the theory of crystals and symmetric functions.

A plausible implication is that further exploration of SSOTs in new contexts (affine types, inhomogeneous crystals, $q$-deformations) could yield deeper unification in combinatorial representation theory and expand their applicability in algebraic geometry and categorification frameworks.