Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Descent sets for osc ...
Conference paper

Descent sets for oscillating tableaux

Martin Rubey (1) (2), Bruce E. Sagan (3), Bruce W. Westbury (4)
(1) Institut für Algebra, Zahlentheorie und Diskrete Mathematik
(2) Fakultät für Mathematik und Geoinformation [Wien]
(3) Department of Mathematics [Lansing]
(4) Department of Mathematics, University of Warwick
Download article
Open on HAL
Imported on
November 20, 2016
Published on
December 31, 2012
Last modified on
April 1, 2025
Volume
DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Proceedings
DOI
10.46298/dmtcs.12796
License
https://about.hal.science/hal-authorisation-v1
Indicators
438
Views
392
Downloads

Descent sets for oscillating tableaux

Martin Rubey (1) (2), Bruce E. Sagan (3), Bruce W. Westbury (4)
(1) Institut für Algebra, Zahlentheorie und Diskrete Mathematik
(2) Fakultät für Mathematik und Geoinformation [Wien]
(3) Department of Mathematics [Lansing]
(4) Department of Mathematics, University of Warwick
Abstract
English
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.
French
Dans cet article, nous définissons la notion d’ensemble de descentes pour un tableau oscillant. Ces descentes sont analogues aux descentes d’un tableau standard dans la théorie des représentations des groupes généraux linéaires. Nous montrons que la correspondance de Sundaram préserve cet ensemble et nous donnons une interprétation combinatoire directe des règles de branchement pour la représentation des groupes symplectiques. Enfin, nous décrivons combinatoirement les caractères de Frobenius associés à l’action du groupe symétrique sur les composantes isotypiques du produit tensoriel des représentations d’un groupe symplectique.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • oscillating tableaux
  • quasisymmetric expansion
  • Frobenius character
Preview
Loading PDF preview...