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.
The honeycomb model of gln(c) tensor products i: Proof of the saturation conjecture
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.