2000 character limit reached
Symplectic tableaux and quantum symmetric pairs
Published 3 Aug 2023 in math.RT, math.CO, and math.QA | (2308.01718v2)
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}))$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.