The paper constructs an explicit, elementary bijection between sp(2n)-highest weight tableaux and Sundaram's symplectic Littlewood-Richardson tableaux, giving a new proof of the Naito-Sagaki branching conjecture.
Symplectic tableaux and quantum symmetric pairs
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We provide a new branching rule from the general linear group $GL_{2n}(\mathbb{C})$ to the symplectic group $Sp_{2n}(\mathbb{C})$ by establishing a simple algorithm which gives rise to a bijection from the set of semistandard tableaux of a fixed shape to a disjoint union of several copies of sets of symplectic tableaux of various shapes. The algorithm arises from representation theory of a quantum symmetric pair of type $A\mathrm{II}_{2n-1}$, which is a $q$-analogue of the classical symmetric pair $(\mathfrak{gl}_{2n}(\mathbb{C}), \mathfrak{sp}_{2n}(\mathbb{C}))$.
fields
math.RT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Symplectic Branching through Crystals
The paper constructs an explicit, elementary bijection between sp(2n)-highest weight tableaux and Sundaram's symplectic Littlewood-Richardson tableaux, giving a new proof of the Naito-Sagaki branching conjecture.