Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-25T17:00:52.206Z Has data issue: false hasContentIssue false

CANONICAL REPRESENTATIVES FOR DIVISOR CLASSES ON TROPICAL CURVES AND THE MATRIX–TREE THEOREM

Published online by Cambridge University Press:  26 September 2014

YANG AN
Affiliation:
Columbia University, USA; yangan@math.columbia.edu
MATTHEW BAKER
Affiliation:
Georgia Institute of Technology, USA; mbaker@math.gatech.edu
GREG KUPERBERG
Affiliation:
University of California, Davis, USA; greg@math.ucdavis.edu
FARBOD SHOKRIEH
Affiliation:
Cornell University, USA; farbod@math.cornell.edu

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}\Gamma $ be a compact tropical curve (or metric graph) of genus $g$. Using the theory of tropical theta functions, Mikhalkin and Zharkov proved that there is a canonical effective representative (called a break divisor) for each linear equivalence class of divisors of degree $g$ on $\Gamma $. We present a new combinatorial proof of the fact that there is a unique break divisor in each equivalence class, establishing in the process an ‘integral’ version of this result which is of independent interest. As an application, we provide a ‘geometric proof’ of (a dual version of) Kirchhoff’s celebrated matrix–tree theorem. Indeed, we show that each weighted graph model $G$ for $\Gamma $ gives rise to a canonical polyhedral decomposition of the $g$-dimensional real torus $\mathrm{Pic}^g(\Gamma )$ into parallelotopes $C_T$, one for each spanning tree $T$ of $G$, and the dual Kirchhoff theorem becomes the statement that the volume of $\mathrm{Pic}^g(\Gamma )$ is the sum of the volumes of the cells in the decomposition.

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/3.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s) 2014

References

Amini, O., ‘Reduced divisors and embeddings of tropical curves’, Trans. Amer. Math. Soc. 365 (9) (2013), 48514880.Google Scholar
Backman, S., ‘Riemann–Roch theory for graph orientations’, available atarXiv:1401.3309, 27 pages, 2014.Google Scholar
Baker, M. and Faber, X., ‘Metric properties of the tropical Abel–Jacobi map’, J. Algebraic Combin. 33 (3) (2011), 349381.Google Scholar
Baker, M. and Shokrieh, F., ‘Chip-firing games, potential theory on graphs, and spanning trees’, J. Combin. Theory Ser. A 120 (1) (2013), 164182.Google Scholar
Chen, S. and Ye, S. K., ‘Critical groups for homeomorphism classes of graphs’, Discrete Math. 309 (1) (2009), 255258.Google Scholar
Gathmann, A. and Kerber, M., ‘A Riemann–Roch theorem in tropical geometry’, Math. Z. 259 (1) (2008), 217230.Google Scholar
Hakimi, S. L., ‘On the degrees of the vertices of a directed graph’, J. Franklin Inst. 279 (1965), 290308.Google Scholar
Hladký, J., Král, D. and Norine, S., ‘Rank of divisors on tropical curves’, J. Combin. Theory Ser. A 120 (7) (2013), 15211538.Google Scholar
Kotani, M. and Sunada, T., ‘Jacobian tori associated with a finite graph and its abelian covering graphs’, Adv. Appl. Math. 24 (2) (2000), 89110.Google Scholar
Luo, Y., ‘Rank-determining sets of metric graphs’, J. Combin. Theory Ser. A 118 (6) (2011), 17751793.Google Scholar
Mikhalkin, G. and Zharkov, I., ‘Tropical curves, their Jacobians and theta functions’, inCurves and Abelian Varieties, Contemporary Mathematics 465 (American Mathematical Society, Providence, RI, 2008), 203230. Available at arXiv:math/0612267.Google Scholar
Schrijver, A., ‘Matroids, trees, stable sets’, inCombinatorial Optimization. Polyhedra and Efficiency. Vol. B, Algorithms and Combinatorics 24 (Springer, Berlin, 2003) (Chs 39–69).Google Scholar