English

Integral flow and cycle chip-firing on graphs

Combinatorics 2021-08-26 v3

Abstract

Motivated by the notion of chip-firing on the dual graph of a planar graph, we consider `integral flow chip-firing' on an arbitrary graph GG. The chip-firing rule is governed by L(G){\mathcal L}^*(G), the dual Laplacian of GG determined by choosing a basis for the lattice of integral flows on GG. We show that any graph admits such a basis so that L(G){\mathcal L}^*(G) is an MM-matrix, leading to a firing rule on these basis elements that is avalanche finite. This follows from a more general result on bases of integral lattices that may be of independent interest. Our results provide a notion of zz-superstable flow configurations that are in bijection with the set of spanning trees of GG. We show that for planar graphs, as well as for the graphs K5K_5 and K3,3K_{3,3}, one can find such a flow M-basis that consists of cycles of the underlying graph. We consider the question for arbitrary graphs and address some open questions.

Keywords

Cite

@article{arxiv.2006.13397,
  title  = {Integral flow and cycle chip-firing on graphs},
  author = {Anton Dochtermann and Eli Meyers and Raghav Samavedan and Alex Yi},
  journal= {arXiv preprint arXiv:2006.13397},
  year   = {2021}
}

Comments

18 pages, 4 figures; v2: typos fixed, other minor changes; v3: title change, author name corrected, some changes in terminology, other corrections and minor revisions incorporating comments from referees

R2 v1 2026-06-23T16:34:28.562Z