2000 character limit reached
A Bijection Between the Recurrent Configurations of a Hereditary Chip-Firing Model and Spanning Trees
Published 26 Jul 2012 in math.CO, cond-mat.stat-mech, cs.DM, math-ph, and math.MP | (1207.6175v2)
Abstract: Hereditary chip-firing models generalize the Abelian sandpile model and the cluster firing model to an exponential family of games induced by covers of the vertex set. This generalization retains some desirable properties, e.g. stabilization is independent of firings chosen and each chip-firing equivalence class contains a unique recurrent configuration. In this paper we present an explicit bijection between the recurrent configurations of a hereditary chip-firing model on a graph and its spanning trees.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.