author:  Criel Merino 

title:  The Chip Firing Game and Matroid Complexes 
keywords:  Chipfiring game, Tutte polynomial, Simplicial complex 
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 proves a 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.

If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files.  
reference:  Criel Merino (2001), The Chip Firing Game and Matroid Complexes, in Discrete Models: Combinatorics, Computation, and Geometry, DMCCG 2001, Robert Cori and Jacques Mazoyer and Michel Morvan and Rémy Mosseri (eds.), Discrete Mathematics and Theoretical Computer Science Proceedings AA, pp. 245256 
bibtex:  For a corresponding BibTeX entry, please consider our BibTeXfile. 
ps.gzsource:  dmAA0118.ps.gz (37 K) 
pssource:  dmAA0118.ps (101 K) 
pdfsource:  dmAA0118.pdf (113 K) 
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.