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 α to a further configuration β. 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
Yamanouchi toppling
PETRULLO, PASQUALE;SENATO PULLANO, Domenico
2014-01-01
Abstract
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 α to a further configuration β. 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 variableFile in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
Yamanouci Toppling.pdf
accesso aperto
Tipologia:
Documento in Post-print
Licenza:
DRM non definito
Dimensione
351.64 kB
Formato
Adobe PDF
|
351.64 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.