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. Yamanouchi toppling
Conference paper

Yamanouchi toppling

Robert Cori (1), Domenico Senato (2) (3), Pasquale Petrullo (2) (3)
(1) Laboratoire Bordelais de Recherche en Informatique
(2) Università degli studi della Basilicata [Potenza]
(3) Università degli studi della Basilicata = University of Basilicata
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2013
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Proceedings
DOI
10.46298/dmtcs.2413
License
https://about.hal.science/hal-authorisation-v1
Indicators
646
Views
547
Downloads

Yamanouchi toppling

Robert Cori (1), Domenico Senato (2) (3), Pasquale Petrullo (2) (3)
(1) Laboratoire Bordelais de Recherche en Informatique
(2) Università degli studi della Basilicata [Potenza]
(3) Università degli studi della Basilicata = University of Basilicata
Abstract
English
We study an extension of the chip-firing game. A given set of admissible moves, called Yamanouchi moves, allows the player to pass from a starting configuration $\alpha$ to a further configuration $\beta$. This can be encoded via an action of a certain group, the toppling group, associated with each connected graph. This action gives rise to a generalization of Hall-Littlewood symmetric polynomials and a new combinatorial basis for them. Moreover, it provides a general method to construct all orthogonal systems associated with a given random variable.
French
On s’intéresse ici à une variante du modèle combinatoire du tas de sable. Un ensemble particulier de suites d’éboulements, les éboulements de Yamanouchi est défini. Les éléments de cet ensemble permettent de passer d’une configuration à une autre, ceci peut être représenté par l’action d’un certain groupe, le groupe des éboulements que l’on peut associer à tout graphe connexe. Cette action donne lieu à une généralisation de polynômes symétriques de Hall-Littlewood et un nouveau champ combinatoire pour ceux-ci. Une extension à la construction d’autres familles de polynômes orthogonaux est proposée.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • chip-firing game
  • Yamanouchi words
  • Young tableaux
  • orthogonal polynomials
  • Hall-Littlewood symmetric polynomials.
Preview
Loading PDF preview...