Chip-Firing and Riemann-Roch Theory for Directed Graphs

zbMath1274.05189arXiv1012.0287MaRDI QIDQ2857320

Spencer Backman, Arash Sh. Asadi

Publication date: 1 November 2013

Full work available at URL: https://arxiv.org/abs/1012.0287

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C20: Directed graphs (digraphs), tournaments

05C57: Games on graphs (graph-theoretic aspects)

Related Items

Abelian networks IV. Dynamics of nonhalting networks, Chip-Firing Games and Critical Groups, Multi-Eulerian tours of directed graphs, Chip firing on Dynkin diagrams and McKay quivers, Parking functions on nonsingular \(M\)-matrices, Explicit deformation of lattice ideals via chip-firing games on directed graphs, Minimal free resolutions of lattice ideals of digraphs, A maximizing characteristic for critical configurations of chip-firing games on digraphs, Arithmetical structures on bidents, Chip-firing and energy minimization on M-matrices, Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph, Monomials, binomials and Riemann-Roch, Chip-firing based methods in the Riemann-Roch theory of directed graphs, CoEulerian graphs

Cites Work

• Unnamed Item
• Arithmetical graphs
• Asymmetric Abelian sandpile models
• Riemann-Roch for sub-lattices of the root lattice \(A_n\)
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• Two-Variable Zeta-Functions on Graphs and Riemann–Roch Theorems
• Chip-Firing and Rotor-Routing on Directed Graphs
• Self-organized critical state of sandpile automaton models