dmtcs:2413 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2014,
DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
-
https://doi.org/10.46298/dmtcs.2413
Yamanouchi topplingArticle
Authors: Robert Cori 1; Domenico Senato 2,3; Pasquale Petrullo 2,3
NULL##NULL##NULL
Robert Cori;Domenico Senato;Pasquale Petrullo
1 Laboratoire Bordelais de Recherche en Informatique
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.