Logarithmic Picard groups, chip firing, and the combinatorial rank
Abstract
Illusie has suggested that one should think of the classifying group of -torsors on a logarithmically smooth curve over a standard logarithmic point as a logarithmic analogue of the Picard group of . This logarithmic Picard group arises naturally as a quotient of the algebraic Picard group by lifts of the chip firing relations of the associated dual graph. We connect this perspective to Baker and Norine's theory of ranks of divisors on a finite graph, and to Amini and Baker's metrized complexes of curves. Moreover, we propose a definition of a combinatorial rank for line bundles on and prove that an analogue of the Riemann-Roch formula holds for our combinatorial rank. Our proof proceeds by carefully describing the relationship between the logarithmic Picard group on a logarithmic curve and the Picard group of the associated metrized complex. This approach suggests a natural categorical framework for metrized complexes, namely the category of logarithmic curves.
Keywords
Cite
@article{arxiv.1611.10233,
title = {Logarithmic Picard groups, chip firing, and the combinatorial rank},
author = {Tyler Foster and Dhruv Ranganathan and Mattia Talpo and Martin Ulirsch},
journal= {arXiv preprint arXiv:1611.10233},
year = {2020}
}
Comments
15 pages, minor changes. Final version to appear in Mathematische Zeitschrift