Chip-firing games and critical groups

DOI10.1007/978-3-030-37853-0_4zbMATH Open1447.05135arXiv1908.04395OpenAlexW2967866447MaRDI QIDQ5118415FDOQ5118415

Nathan Kaplan, Darren B. Glass

Publication date: 8 September 2020

Published in: Foundations for Undergraduate Research in Mathematics (Search for Journal in Brave)

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

Full work available at URL: https://arxiv.org/abs/1908.04395

Recommendations

• Chip-firing and the critical group of a graph
• Properties of chip-firing games on complete graphs
• The chip-firing game
• Chip firing and algebraic curves
• Chip-firing games on graphs

zbMATH Keywords

finite abelian groupchip-firing operations

Mathematics Subject Classification ID

Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Games involving graphs (91A43) Finite abelian groups (20K01)

Cites Work

• Two-vertex generators of Jacobians of graphs
• Title not available (Why is that?)
• Chip-firing and the critical group of a graph
• The sand-pile model and Tutte polynomials
• On the sandpile group of dual graphs
• Chip-firing games, potential theory on graphs, and spanning trees
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• Title not available (Why is that?)
• CANONICAL REPRESENTATIVES FOR DIVISOR CLASSES ON TROPICAL CURVES AND THE MATRIX–TREE THEOREM
• A Note on Jacobians, Tutte Polynomials, and Two-Variable Zeta Functions of Graphs
• On a Cohen-Lenstra heuristic for Jacobians of random graphs
• Smith normal form and Laplacians
• Harmonic Morphisms and Hyperelliptic Graphs
• A tropical proof of the Brill-Noether theorem
• The lattice of integral flows and the lattice of integral cuts on a finite graph
• Chip-firing games on directed graphs
• Arithmetical graphs
• Chip-firing and Riemann-Roch theory for directed graphs
• The monodromy pairing and discrete logarithm on the Jacobian of finite graphs
• Orthogonal Matrices Over Finite Fields
• A finite group attached to the laplacian of a graph
• Smith normal form in combinatorics
• Counting arithmetical structures on paths and cycles
• The number of spanning trees of plane graphs with reflective symmetry
• Title not available (Why is that?)
• A Note on Brill–Noether Theory and Rank-Determining Sets for Metric Graphs
• \(p\)-adic numbers: An introduction.
• On the sandpile group of the cone of a graph
• Critical groups for homeomorphism classes of graphs
• On the structure of the Jacobian group for circulant graphs
• On the sandpile group of the square cycle \(C^{2}_{n}\)
• Introduction to Random Graphs
• Title not available (Why is that?)
• The critical group of a line graph
• Bicycles and Spanning Trees
• Critical groups of covering, voltage and signed graphs
• Critical groups for complete multipartite graphs and Cartesian products of complete graphs
• Title not available (Why is that?)
• Grothendieck's pairing on component groups of Jacobians.
• Quadratic forms on finite groups, and related topics
• Critical groups of graphs with dihedral actions
• Gonality of random graphs
• A Spectral Lower Bound for the Divisorial Gonality of Metric Graphs
• Gonality of expander graphs
• Cyclic critical groups of graphs
• The Smith and critical groups of the square rook's graph and its complement
• The Smith and critical groups of Paley graphs
• The distribution of sandpile groups of random graphs
• Random integral matrices and the Cohen-Lenstra heuristics
• Sandpile groups and the coeulerian property for random directed graphs
• Realization of groups with pairing as Jacobians of finite graphs
• Nondegenerate Symmetric Bilinear Forms on Finite Abelian 2-Groups
• Title not available (Why is that?)
• Arithmetical structures on graphs
• Chip-firing groups of iterated cones
• Chip-firing on trees of loops
• Title not available (Why is that?)
• Graphs, Vectors, and Matrices
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
• Critical groups of iterated cones
• Arithmetical structures on bidents
• Brill-Noether theory of maximally symmetric graphs
• Double exponential lower bound for the number of representations of unity by Egyptian fractions
• Arithmetical structures on graphs with connectivity one
• On the Minimal Graph with a Given Number of Spanning Trees

Cited In (4)

• Critical group structure from the parameters of a strongly regular graph
• Computational complexity of counting coincidences
• Critical groups of arithmetical structures on star graphs and complete graphs
• Critical groups of arithmetical structures under a generalized star-clique operation

Uses Software

• jacobians

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)