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. Stability properties ...
Conference paper

Stability properties of Plethysm: new approach with combinatorial proofs (Extended abstract)

Laura Colmenarejo ORCID (1)
(1) Departamento de Algebra [Sevilla]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2014
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Proceedings
DOI
10.46298/dmtcs.2526
License
Attribution 4.0 International (CC BY 4.0)
Indicators
806
Views
887
Downloads

Stability properties of Plethysm: new approach with combinatorial proofs (Extended abstract)

Laura Colmenarejo ORCID (1)
(1) Departamento de Algebra [Sevilla]
Abstract
English
Plethysm coefficients are important structural constants in the theory of symmetric functions and in the representations theory of symmetric groups and general linear groups. In 1950, Foulkes observed stability properties: some sequences of plethysm coefficients are eventually constants. Such stability properties were proven by Brion with geometric techniques and by Thibon and Carré by means of vertex operators. In this paper we present a newapproach to prove such stability properties. This new proofs are purely combinatorial and follow the same scheme. We decompose plethysm coefficients in terms of other plethysm coefficients (related to the complete homogeneous basis of symmetric functions). We show that these other plethysm coefficients count integer points in polytopes and we prove stability for them by exhibiting bijections between the corresponding sets of integer points of each polytope.
French
Les coefficients du pléthysme sont des constantes de structure importantes de la théorie des fonctions symétriques, ainsi que de la théorie de la représentation des groupes symétriques et des groupes généraux linéaires. En 1950, Foulkes a observé pour ces coefficients de phénomènes de stabilité: certaines suites de coefficients du pléthysme sont stationnaires. De telles propriétés ont été démontrées par Brion, au moyen de techniques géométriques, et par Thibon et Carré, au moyen d’opérateurs vertex. Dans ce travail, nous présentons une nouvelle approche, purement combinatoire, pour démontrer des propriétés de stabilité de ce type. Nous décomposons les coefficients du pléthysme comme somme alternées de coefficients de pléthysme d’un autre type (liés à la base des fonctions symétriques sommes complètes), qui comptent les points entiers dans des polytopes. Nous démontrons la stabilité des suites de ces coefficients en exhibant des bijections entres les ensembles de points entiers des polytopes correspondants.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Combinatorial representation theory
  • symmetric functions
  • plethysm
  • combinatorial intepretation of coefficients
  • stability
Preview
Loading PDF preview...