English

Descent sets for symplectic groups

Combinatorics 2013-10-01 v2 Representation Theory

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.

Keywords

Cite

@article{arxiv.1303.5850,
  title  = {Descent sets for symplectic groups},
  author = {Martin Rubey and Bruce Sagan and Bruce W. Westbury},
  journal= {arXiv preprint arXiv:1303.5850},
  year   = {2013}
}

Comments

22 pages, 2 figures

R2 v1 2026-06-21T23:47:07.365Z