Chip-Firing Games and Critical Groups
arXiv:1908.04395 · doi:10.1007/978-3-030-37853-0_4
Abstract
In this expository article intended to be accessible to undergraduate students we introduce a finite abelian group that can be associated to any finite connected graph. This group can be defined in an elementary combinatorial way in terms of chip-firing operations, and has been an object of interest in combinatorics, algebraic geometry, statistical physics, and several other areas of mathematics. We will begin with basic definitions and examples and develop a number of properties that can be derived by looking at this group from different angles. Throughout, we will give exercises, some of which are straightforward and some of which are open questions. We will also attempt to highlight some of the many contributions to this area made by undergraduate students
References in corpus (13)
- Chip-firing games, potential theory on graphs, and spanning trees
- Canonical representatives for divisor classes on tropical curves and the Matrix-Tree Theorem
- On the distribution of Galois groups
- On the Sandpile group of the cone of a graph
- Treewidth is a lower bound on graph gonality
- The critical group of a directed graph
- Gonality of Random Graphs
- Counting Arithmetical Structures on Paths and Cycles
- The monodromy pairing and discrete logarithm on the Jacobian of finite graphs
- Arithmetical structures on bidents
- Groups, graphs, and hypergraphs: average sizes of kernels of generic matrices with support constraints
- Cyclic Critical Groups of Graphs
- Sandpile Groups of Random Bipartite Graphs