Chip-firing based methods in the Riemann-Roch theory of directed graphs

DOI10.1016/j.ejc.2019.01.007zbMath1414.05134arXiv1511.03568OpenAlexW2253166198MaRDI QIDQ2422214

Bálint Hujter, Lilla Tóthmérész

Publication date: 18 June 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Riemann surfaceRiemann-Roch theoremchip-firing gamesJacobian of a finite graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Riemann surfaces; Weierstrass points; gap sequences (14H55) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• On computation of Baker and Norine's rank on complete graphs
• Chip-firing games on directed graphs
• Chip-firing games on graphs
• Riemann-Roch for sub-lattices of the root lattice \(A_n\)
• Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
• Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• A Riemann-Roch theorem in tropical geometry
• CoEulerian graphs
• Abelian Networks I. Foundations and Examples
• Chip-Firing and Riemann-Roch Theory for Directed Graphs
• Algebraic Combinatorics
• On the complexity of the chip-firing reachability problem

This page was built for publication: Chip-firing based methods in the Riemann-Roch theory of directed graphs