The Chip Firing Game and Matroid Complexes
Merino, Criel
HAL, hal-01182958 / Harvested from HAL
Text on HAL
In this paper we construct from a cographic matroid M, a pure multicomplex whose degree sequence is the h―vector of the the matroid complex of M. This result provesa conjecture of Richard Stanley [Sta96] in the particular case of cographic matroids. We also prove that the multicomplexes constructed are M―shellable, so proving a conjecture of Manoj Chari [Cha97] again in the case of cographic matroids. The proofs use results on a game for graphs called the chip firing game.
Publié le : 2001-07-04
Classification:  Chip-firing game,  Tutte polynomial,  Simplicial complex,  [INFO]Computer Science [cs],  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO],  [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG],  [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM] 
@article{hal-01182958,
     author = {Merino, Criel},
     title = {The Chip Firing Game and Matroid Complexes},
     journal = {HAL},
     volume = {2001},
     number = {0},
     year = {2001},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-01182958}
}

Merino, Criel. The Chip Firing Game and Matroid Complexes. HAL, Tome 2001 (2001) no. 0, . http://gdmltest.u-ga.fr/item/hal-01182958/