Chip-firing games and critical groups
From MaRDI portal
Publication:5118415
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
Recommendations
Cites work
- scientific article; zbMATH DE number 1254241 (Why is no real title available?)
- scientific article; zbMATH DE number 1254302 (Why is no real title available?)
- scientific article; zbMATH DE number 4680 (Why is no real title available?)
- scientific article; zbMATH DE number 790015 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A Spectral Lower Bound for the Divisorial Gonality of Metric Graphs
- A finite group attached to the laplacian of a graph
- A note on Brill-Noether theory and rank-determining sets for metric graphs
- A note on Jacobians, Tutte polynomials, and two-variable zeta functions of graphs
- A tropical proof of the Brill-Noether theorem
- Arithmetical graphs
- Arithmetical structures on bidents
- Arithmetical structures on graphs
- Arithmetical structures on graphs with connectivity one
- Bicycles and Spanning Trees
- Brill-Noether theory of maximally symmetric graphs
- Canonical representatives for divisor classes on tropical curves and the matrix-tree theorem
- Chip-firing and Riemann-Roch theory for directed graphs
- Chip-firing and the critical group of a graph
- Chip-firing games on directed graphs
- Chip-firing games, potential theory on graphs, and spanning trees
- Chip-firing groups of iterated cones
- Chip-firing on trees of loops
- Counting arithmetical structures on paths and cycles
- Critical groups for complete multipartite graphs and Cartesian products of complete graphs
- Critical groups for homeomorphism classes of graphs
- Critical groups of covering, voltage and signed graphs
- Critical groups of graphs with dihedral actions
- Critical groups of iterated cones
- Cyclic critical groups of graphs
- Divisors and sandpiles. An introduction to chip-firing
- Double exponential lower bound for the number of representations of unity by Egyptian fractions
- Gonality of expander graphs
- Gonality of random graphs
- Graphs, vectors, and matrices
- Grothendieck's pairing on component groups of Jacobians.
- Harmonic Morphisms and Hyperelliptic Graphs
- Introduction to Random Graphs
- Nondegenerate Symmetric Bilinear Forms on Finite Abelian 2-Groups
- On a Cohen-Lenstra heuristic for Jacobians of random graphs
- On the Minimal Graph with a Given Number of Spanning Trees
- On the sandpile group of dual graphs
- On the sandpile group of the cone of a graph
- On the sandpile group of the square cycle \(C^{2}_{n}\)
- On the structure of the Jacobian group for circulant graphs
- Orthogonal Matrices Over Finite Fields
- Quadratic forms on finite groups, and related topics
- Random integral matrices and the Cohen-Lenstra heuristics
- Realization of groups with pairing as Jacobians of finite graphs
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Sandpile groups and the coeulerian property for random directed graphs
- Smith normal form and Laplacians
- Smith normal form in combinatorics
- The Smith and critical groups of Paley graphs
- The Smith and critical groups of the square rook's graph and its complement
- The critical group of a line graph
- The distribution of sandpile groups of random graphs
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- The mathematics of chip-firing
- The monodromy pairing and discrete logarithm on the Jacobian of finite graphs
- The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
- The number of spanning trees of plane graphs with reflective symmetry
- The sand-pile model and Tutte polynomials
- Two-vertex generators of Jacobians of graphs
- \(p\)-adic numbers: An introduction.
Cited in
(8)- Critical groups of arithmetical structures under a generalized star-clique operation
- Chip firing on Dynkin diagrams and McKay quivers
- Critical groups of arithmetical structures on star graphs and complete graphs
- Divisors and sandpiles. An introduction to chip-firing
- Critical group structure from the parameters of a strongly regular graph
- Computational complexity of counting coincidences
- Chip firing and algebraic curves
- Chip-firing groups of iterated cones
This page was built for publication: Chip-firing games and critical groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5118415)
