<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>Logarithmic Picard groups, chip firing, and the combinatorial rank</dc:title>
   	<dc:creator>Foster, Tyler</dc:creator>
   	<dc:creator>Ranganathan, Dhruv</dc:creator>
   	<dc:creator>Talpo, Mattia</dc:creator>
   	<dc:creator>Ulirsch, Martin</dc:creator>
   	<dc:description>Illusie has suggested that one should think of the classifying group of $M_X^{gp}$-torsors on a logarithmically smooth curve $X$ over a standard logarithmic point as a logarithmic analogue of the Picard group of $X$. 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&apos;s theory of ranks of divisors on a finite graph, and to Amini and Baker&apos;s metrized complexes of curves. Moreover, we propose a definition of a combinatorial rank for line bundles on $X$ 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.</dc:description>
   	<dc:date>2016</dc:date>
   	<dc:type>info:eu-repo/semantics/article</dc:type>
   	<dc:type>doc-type:article</dc:type>
   	<dc:type>text</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_6501</dc:type>
   	<dc:identifier>https://ris.uni-paderborn.de/record/66338</dc:identifier>
   	<dc:source>Foster T, Ranganathan D, Talpo M, Ulirsch M. Logarithmic Picard groups, chip firing, and the combinatorial rank. &lt;i&gt;arXiv:161110233&lt;/i&gt;. Published online 2016.</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/arxiv/1611.10233</dc:relation>
   	<dc:rights>info:eu-repo/semantics/closedAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
