Chip-Firing Games and Critical Groups
From MaRDI portal
Publication:5118415
DOI10.1007/978-3-030-37853-0_4zbMath1447.05135arXiv1908.04395OpenAlexW2967866447MaRDI QIDQ5118415
Publication date: 8 September 2020
Published in: Foundations for Undergraduate Research in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.04395
Games involving graphs (91A43) Finite abelian groups (20K01) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (3)
Critical groups of arithmetical structures on star graphs and complete graphs ⋮ Critical group structure from the parameters of a strongly regular graph ⋮ Critical groups of arithmetical structures under a generalized star-clique operation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the structure of the Jacobian group for circulant graphs
- Critical groups of covering, voltage and signed graphs
- A tropical proof of the Brill-Noether theorem
- On the sandpile group of the cone of a graph
- Chip-firing games on directed graphs
- Gonality of expander graphs
- The Smith and critical groups of the square rook's graph and its complement
- Smith normal form in combinatorics
- On the sandpile group of the square cycle \(C^{2}_{n}\)
- On a Cohen-Lenstra heuristic for Jacobians of random graphs
- Smith normal form and Laplacians
- Critical groups for homeomorphism classes of graphs
- Arithmetical graphs
- A finite group attached to the laplacian of a graph
- Chip-firing and the critical group of a graph
- \(p\)-adic numbers: An introduction.
- The sand-pile model and Tutte polynomials
- On the sandpile group of dual graphs
- Grothendieck's pairing on component groups of Jacobians.
- Counting arithmetical structures on paths and cycles
- Chip-firing groups of iterated cones
- Two-vertex generators of Jacobians of graphs
- Chip-firing on trees of loops
- Realization of groups with pairing as Jacobians of finite graphs
- Chip-firing games, potential theory on graphs, and spanning trees
- The critical group of a line graph
- The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
- 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
- The Smith and critical groups of Paley graphs
- Sandpile groups and the coeulerian property for random directed graphs
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Arithmetical structures on graphs
- Critical groups of iterated cones
- Critical groups of graphs with dihedral actions
- Quadratic forms on finite groups, and related topics
- The number of spanning trees of plane graphs with reflective symmetry
- Gonality of random graphs
- Cyclic Critical Groups of Graphs
- Chip-Firing and Riemann-Roch Theory for Directed Graphs
- Introduction to Random Graphs
- Arithmetical structures on graphs with connectivity one
- Graphs, Vectors, and Matrices
- Harmonic Morphisms and Hyperelliptic Graphs
- The monodromy pairing and discrete logarithm on the Jacobian of finite graphs
- Bicycles and Spanning Trees
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- Critical groups for complete multipartite graphs and Cartesian products of complete graphs
- A Spectral Lower Bound for the Divisorial Gonality of Metric Graphs
- Nondegenerate Symmetric Bilinear Forms on Finite Abelian 2-Groups
- 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
- The distribution of sandpile groups of random graphs
- Random integral matrices and the Cohen-Lenstra heuristics
- CANONICAL REPRESENTATIVES FOR DIVISOR CLASSES ON TROPICAL CURVES AND THE MATRIX–TREE THEOREM
- Orthogonal Matrices Over Finite Fields
- On the Minimal Graph with a Given Number of Spanning Trees
This page was built for publication: Chip-Firing Games and Critical Groups
