Descent sets for symplectic groups
Martin Rubey (Fakult\"at f\"ur Mathematik und Geoinformation, TU Wien,, Austria), Bruce Sagan (Department of Mathematics, Michigan State University),, and Bruce W. Westbury (Department of Mathematics, University of Warwick,, Coventry)

TL;DR
This paper introduces a descent set for oscillating tableaux that parallels the role of descent sets in standard tableaux, providing combinatorial insights into symplectic group representations and their branching rules.
Contribution
It defines a new descent set for oscillating tableaux and demonstrates its preservation under Sundaram's correspondence, linking combinatorics to symplectic representation theory.
Findings
Descent set for oscillating tableaux is introduced.
Descent set is preserved by Sundaram's correspondence.
Provides combinatorial interpretation of symplectic group branching rules.
Abstract
The descent set of an oscillating (or up-down) tableau is introduced. This descent set plays the same role in the representation theory of the symplectic groups as the descent set of a standard tableau plays in the representation theory of the general linear groups. In particular, we show that the descent set is preserved by Sundaram's correspondence. This gives a direct combinatorial interpretation of the branching rules for the defining representations of the symplectic groups; equivalently, for the Frobenius character of the action of a symmetric group on an isotypic subspace in a tensor power of the defining representation of a symplectic group.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Geometry · Finite Group Theory Research · Algebraic structures and combinatorial models
