Skip to Main content Skip to Navigation
Conference papers

The Chip Firing Game and Matroid Complexes

Abstract : 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.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01182958
Contributor : Coordination Episciences Iam <>
Submitted on : Tuesday, August 11, 2015 - 3:31:04 PM
Last modification on : Tuesday, March 7, 2017 - 3:00:02 PM
Long-term archiving on: : Thursday, November 12, 2015 - 10:32:25 AM

File

dmAA0118.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01182958, version 1

Collections

Citation

Criel Merino. The Chip Firing Game and Matroid Complexes. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. pp.245-256. ⟨hal-01182958⟩

Share

Metrics

Record views

196

Files downloads

678