paper

A Chip-Firing Game on the Product of Two Graphs and the Tropical Picard Group

arXiv:1509.03380

Abstract

In his preprint https://arxiv.org/abs/1308.3813, Cartwright introduced the notion of a weak tropical complex in order to generalize the concepts of divisors and the Picard group on graphs from Baker and Norine's paper Riemann-Roch and Abel-Jacobi Theory on a Finite Graph. A tropical complex is a -complex equipped with certain algebraic data. Divisors in a tropical complex are formal linear combinations of ridges, and piecewise-linear functions on a tropical complex give rise in a natural way to divisors. Divisors that arise from PL-functions are called principal, and divisors that are locally principal are called Cartier. Two divisors that differ by a principal divisor are said to be linearly equivalent. The linear equivalence classes of Cartier divisors on a tropical complex form a group called the Picard group of , by analogy to the definition of the Picard group of a variety in algebraic geometry. Every graph has a unique tropical complex structure. If and are graphs, and is a triangulation of their product, then has a weak tropical complex structure that is compatible with the tropical complex structures on and . Thus, divisors on can be thought of as states in a higher-dimensional chip-firing game on . Cartwright conjectured that the Picard groups of , , and were closely related. Let be the tropical Picard group of , and and be the tropical Picard groups of and . Then, it was conjectured that there is a map that is always injective and is surjective if at least one of or is a tree. In this paper, we prove the conjecture. In preparation, we discuss some basic properties of tropical complexes, along with some properties specific to the product-of-graphs case.

arXiv comment17 pages, 12 figures. Removed Section 2 and reworked Sections 3 and 4 into a new Section 2