Polynomial ideals for sandpiles and their Gröbner bases
From MaRDI portal
Publication:1605301
DOI10.1016/S0304-3975(00)00397-2zbMath1002.68105WikidataQ60264674 ScholiaQ60264674MaRDI QIDQ1605301
Bruno Salvy, Robert Cori, Dominique Rossin
Publication date: 15 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Morphisms of commutative rings (13B10)
Related Items
Divisors on graphs, binomial and monomial ideals, and cellular resolutions, Tutte short exact sequences of graphs, Monomials, binomials and Riemann-Roch, Minimal free resolutions of lattice ideals of digraphs, Trees, parking functions, syzygies, and deformations of monomial ideals, Enumerating degree sequences in digraphs and a cycle--cocycle reversing system, Explicit deformation of lattice ideals via chip-firing games on directed graphs, On the critical ideals of graphs, Another proof of Wilmes' conjecture, Reviews, Riemann-Roch theory for graph orientations, \(G\)-parking functions, acyclic orientations and spanning trees, Chip-firing and energy minimization on M-matrices, Tutte polynomials and \(G\)-parking functions, Minimal free resolutions of the 𝐺-parking function ideal and the toppling ideal, The chip-firing game, Divisors on graphs, orientations, syzygies, and system reliability
Cites Work
- Chip-firing games on graphs
- Chip-firing and the critical group of a graph
- The computational complexity of sandpiles
- On the sandpile group of dual graphs
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Binomial ideals
- Self-organized criticality
- Self-organized critical state of sandpile automaton models
- Algebraic aspects of Abelian sandpile models
