Explicit deformation of lattice ideals via chip-firing games on directed graphs
From MaRDI portal
Publication:902956
DOI10.1007/s10801-015-0618-xzbMath1328.05119arXiv1401.3268OpenAlexW1763840904MaRDI QIDQ902956
Madhusudan Manjunath, Spencer Backman
Publication date: 4 January 2016
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3268
Laplacian matrixdirected graphsbinomial idealslattice idealsScarf complexchip-firing on graphsexplicit deformationfree resolutions of ideals
Directed graphs (digraphs), tournaments (05C20) Lattices (06B99) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (1)
Cites Work
- Unnamed Item
- Laplacian ideals, arrangements, and resolutions
- Asymmetric Abelian sandpile models
- Polynomial ideals for sandpiles and their Gröbner bases
- Monomials, binomials and Riemann-Roch
- Another proof of Wilmes' conjecture
- Matrices with Identical Sets of Neighbors
- A Family of Quasisymmetry Models
- Chip-Firing and Riemann-Roch Theory for Directed Graphs
- Divisors on Graphs, Connected Flags, and Syzygies
- Primer for the algebraic geometry of sandpiles
- An Introduction to the Geometry of Numbers
- Chip-Firing and Rotor-Routing on Directed Graphs
- Cellular resolutions of monomial modules
- Generic lattice ideals
- Trees, parking functions, syzygies, and deformations of monomial ideals
- Minimal free resolutions of the 𝐺-parking function ideal and the toppling ideal
This page was built for publication: Explicit deformation of lattice ideals via chip-firing games on directed graphs