Chip firing on general invertible matrices
DOI10.1137/15M1034404zbMATH Open1336.05088arXiv1508.04262OpenAlexW2205827985MaRDI QIDQ2808165FDOQ2808165
Authors: Johnny Guzmán, Caroline Klivans
Publication date: 26 May 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.04262
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrices of integers (15B36) Combinatorial aspects of simplicial complexes (05E45) Lattices and convex bodies (number-theoretic aspects) (11H06)
Cites Work
- Computing the Continuous Discretely
- Chip-firing and the critical group of a graph
- Chip-firing games, potential theory on graphs, and spanning trees
- Primer for the algebraic geometry of sandpiles
- Self-organized criticality
- Self-organized critical state of sandpile automaton models
- Chip-firing games on graphs
- M-matrix characterizations. I: nonsingular M-matrices
- Maximum principle and uniform convergence for the finite element method
- Stabilized Galerkin approximation of convection-diffusion-reaction equations: discrete maximum principle and convergence
- Trees, parking functions, syzygies, and deformations of monomial ideals
- Asymmetric Abelian sandpile models
- Critical groups of simplicial complexes
- Chip-firing and energy minimization on M-matrices
- Abelian networks. II: Halting on all inputs
- An introduction to the geometry of numbers.
Cited In (2)
This page was built for publication: Chip firing on general invertible matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808165)