Divisors on graphs, binomial and monomial ideals, and cellular resolutions
From MaRDI portal
(Redirected from Publication:284775)
Abstract: We study various binomial and monomial ideals arising in the theory of divisors, orientations, and matroids on graphs. We use ideas from potential theory on graphs and from the theory of Delaunay decompositions for lattices to describe their minimal polyhedral cellular free resolutions. We show that the resolutions of all these ideals are closely related and that their -graded Betti tables coincide. As corollaries, we give conceptual proofs of conjectures and questions posed by Postnikov and Shapiro, by Manjunath and Sturmfels, and by Perkinson, Perlman, and Wilmes. Various other results related to the theory of chip-firing games on graphs also follow from our general techniques and results.
Recommendations
Cites work
- scientific article; zbMATH DE number 49719 (Why is no real title available?)
- scientific article; zbMATH DE number 67325 (Why is no real title available?)
- scientific article; zbMATH DE number 3586175 (Why is no real title available?)
- scientific article; zbMATH DE number 482758 (Why is no real title available?)
- scientific article; zbMATH DE number 503444 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- scientific article; zbMATH DE number 5790250 (Why is no real title available?)
- scientific article; zbMATH DE number 2190625 (Why is no real title available?)
- scientific article; zbMATH DE number 3365295 (Why is no real title available?)
- A Riemann-Roch theorem in tropical geometry
- A family of quasisymmetry models
- Algebraic Potential Theory on Graphs
- Another proof of Wilmes' conjecture
- Arithmetical graphs
- Canonical representatives for divisor classes on tropical curves and the matrix-tree theorem
- Cellular resolutions from mapping cones
- Cellular resolutions of monomial modules
- Chip firing and the Tutte polynomial
- Chip-firing and the critical group of a graph
- Chip-firing games on graphs
- Chip-firing games, potential theory on graphs, and spanning trees
- Combinatorics and commutative algebra.
- Compactifications of the Generalized Jacobian Variety
- Complexes of directed trees
- Complexes of directed trees and independence complexes
- Degree and algebraic properties of lattice and matrix ideals
- Discrete Morse theory for cellular resolutions
- Divisors on graphs, connected flags, and syzygies
- Free resolutions and sparse determinantal ideals
- Laplacian ideals, arrangements, and resolutions
- Metrized graphs, Laplacian operators, and electrical networks
- Minimal free resolutions of the \(G\)-parking function ideal and the toppling ideal
- Monomial Ideals
- Monomials, binomials and Riemann-Roch
- Nice initial complexes of some classical ideals
- On lattice dicing
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- On the Orlik-Terao ideal and the relation space of a hyperplane arrangement
- Orientations, semiorders, arrangements, and parking functions
- Oriented Matroids
- Polynomial ideals for sandpiles and their Gröbner bases
- Prime splittings of determinantal ideals
- Primer for the algebraic geometry of sandpiles
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- SINGULAR
- Schälbare Cohen-Macaulay-Komplexe und ihre Parametrisierung. (Shellable Cohen-Macaulay complexes and their parametrization)
- Self-organized critical state of sandpile automaton models
- Self-organized criticality
- Shellability of complexes of directed trees
- Spécialisation du foncteur de Picard
- Syzygies of oriented matroids
- Syzygies of unimodular Lawrence ideals
- The Geometry of Syzygies
- The algebraic method in tree percolation
- The capacity pairing.
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- The monodromy pairing and discrete logarithm on the Jacobian of finite graphs
- The sand-pile model and Tutte polynomials
- Trees, parking functions, syzygies, and deformations of monomial ideals
- Triangulations. Structures for algorithms and applications
- Tropical curves, their Jacobians and theta functions
- Types of signature analysis in reliability based on Hilbert series
Cited in
(20)- Divisors on graphs, connected flags, and syzygies
- The algebraic method in tree percolation
- Fourientations and the Tutte polynomial
- Certain variants of multipermutohedron ideals
- Tutte short exact sequences of graphs
- Laplacian ideals, arrangements, and resolutions
- Combinatorial and Geometric View of the System Reliability Theory
- Geometric bijections between spanning trees and break divisors
- Combinatorics and Algebra of Geometric Subdivision Operations
- Explicit deformation of lattice ideals via chip-firing games on directed graphs
- Partial graph orientations and the Tutte polynomial
- Divisors on graphs, connected flags, and syzygies
- Another proof of Wilmes' conjecture
- Divisors on graphs, orientations, syzygies, and system reliability
- Types of signature analysis in reliability based on Hilbert series
- Cellular Structure on the Minimal Resolution of the Edge Ideal of the Complement of then-Cycle
- On power ideals of transversal matroids and their ``parking functions
- Gröbner degenerations of determinantal ideals with an application to toric degenerations of Grassmannians
- Polarization and depolarization of monomial ideals with application to multi-state system reliability
- Minimal free resolutions of the \(G\)-parking function ideal and the toppling ideal
This page was built for publication: Divisors on graphs, binomial and monomial ideals, and cellular resolutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284775)
