Recently, Baker and Norine have proven a Riemann-Roch theorem for finite graphs. We extend their results to metric graphs and thus establish a Riemann-Roch theorem for divisors on (abstract) tropical curves.
We define a divisor theory for graphs and tropical curves endowed with a weight function on the vertices; we prove that the Riemann-Roch theorem holds in both cases. We extend Baker's Specialization Lemma to weighted graphs.
We investigate, using purely combinatorial methods, structural and algorithmic properties of linear equivalence classes of divisors on tropical curves. In particular, an elementary proof of the Riemann-Roch theorem for tropical curves, similar to the recent proof of the Riemann-Roch theorem for graphs by Baker and Norine, is presented. In addition, a conjecture of Baker asserting that the rank of a divisor D on a (non-metric) graph is equal to the rank of D on the corresponding metric graph is confirmed, and an algorithm for computing the rank of a divisor on a tropical curve is constructed.
We study Jacobian varieties for tropical curves. These are real tori equipped with integral affine structure and symmetric bilinear form. We define tropical counterpart of the theta function and establish tropical versions of the Abel-Jacobi, Riemann-Roch and Riemann theta divisor theorems.
In this thesis we study toric rank functions for chip firing games and prove special cases of a conjectural Riemann-Roch. The original motivation for an investigation into this area of study came for the adaptation (due to Matt Baker) of Riemann-Roch into a graph theoretic analogue through the use of chip-firing games. Here, we collect known results and present new observations that indicate Riemann--Roch holds for trees and polygons. We also prove an asymptotic case of Riemann--Roch (i.e.~Riemann--Roch for divisors of large degree). Finally, we also provide magma code and computational eviden…
We prove a Riemann-Roch theorem for real divisors on edge-weighted graphs over the reals, extending the result of Baker and Norine for integral divisors on graphs with multiple edges.
In [1] M. Baker and S. Norine developed a theory of divisors and linear systems on graphs, and proved a Riemann-Roch Theorem for these objects (conceived as integer-valued functions on the vertices). In [2] and [3] the authors generalized these concepts to real-valued functions, and proved a corresponding Riemann-Roch Theorem in that setting, showing that it implied the Baker-Norine result. In this article we prove a Riemann-Roch Theorem in a more general combinatorial setting that is not necessarily driven by the existence of a graph.
In the present paper we extend the Riemann-Roch formalism to structure algebras of moment graphs. We introduce and study the Chern character and pushforwards for twisted fibrations of moment graphs. We prove an analogue of the Riemann-Roch theorem for moment graphs. As an application, we obtain the Riemann-Roch type theorem for equivariant $K$-theory of some Kac-Moody flag varieties.
Some families of constant dimension codes arising from Riemann-Roch spaces associated to particular divisors of a curve $\X$ are constructed. These families are generalizations of the one constructed by Hansen
Baker and Norine proved a Riemann--Roch theorem for divisors on undirected graphs. The notions of graph divisor theory are in duality with the notions of the chip-firing game of Björner, Lovász and Shor. We use this connection to prove Riemann--Roch-type results on directed graphs. We give a simple proof for a Riemann--Roch inequality on Eulerian directed graphs, improving a result of Amini and Manjunath. We also study possibilities and impossibilities of Riemann--Roch-type equalities in strongly connected digraphs and give examples. We intend to make the connections of this theory to graph th…
Recently, Baker and Norine {Advances in Mathematics, 215(2): 766-788, 2007} found new analogies between graphs and Riemann surfaces by developing a Riemann-Roch machinery on a finite graph $G$. In this paper, we develop a general Riemann-Roch Theory for sub-lattices of the root lattice $A_n$ by following the work of Baker and Norine, and establish connections between the Riemann-Roch theory and the Voronoi diagrams of lattices under certain simplicial distance functions. In this way, we rediscover the work of Baker and Norine from a geometric point of view and generalise their results to other…
It is well-known that a finite graph can be viewed, in many respects, as a discrete analogue of a Riemann surface. In this paper, we pursue this analogy further in the context of linear equivalence of divisors. In particular, we formulate and prove a graph-theoretic analogue of the classical Riemann-Roch theorem. We also prove several results, analogous to classical facts about Riemann surfaces, concerning the Abel-Jacobi map from a graph to its Jacobian. As an application of our results, we characterize the existence or non-existence of a winning strategy for a certain chip-firing game played…
A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch theorem on an infinite graph was feasible. In this article, we take an edge-weighted infinite graph and focus on the importance of the spectral gaps of the Laplace operators defined on its finite subgraphs naturally given by Q-valued positive weights on the edges. We build a potential theoretic scheme for proof of a Riemann-Roch theorem on the edge-weighted i…
By a {\em Riemann function} we mean a function $f\colon{\mathbb Z}^n\to{\mathbb Z}$ such that $f({\bf d})=f(d_1,\ldots,d_n)$ is equals $0$ for ${\rm deg}({\bf d})=d_1+\cdots+d_n$ sufficiently small, and equals $d_1+\cdots+d_n+C$ for a constant, $C$ -- the {\em offset of $f$} -- for ${\rm deg}({\bf d})$ sufficiently large. By adding $1$ to the Baker-Norine rank function of a graph, one gets an equivalent Riemann function, and similarly for related rank functions. For such an $f$, for any ${\bf K}\in{\mathbb Z}^n$ there is a unique Riemann function $f^\wedge_{\bf K}$ such that for all ${\bf d}\i…
For each graph on two vertices, and each divisor on the graph in the sense of Baker-Norine, we describe a sheaf of vector spaces on a finite category whose zeroth Betti number is the Baker-Norine "Graph Riemann-Roch" rank of the divisor plus one. We prove duality theorems that generalize the Baker-Norine "Graph Riemann-Roch" Theorem.
The Riemann-Roch theorem on a graph G is related to Alexander duality in combinatorial commutive algebra. We study the lattice ideal given by chip firing on G and the initial ideal whose standard monomials are the G-parking functions. When G is a saturated graph, these ideals are generic and the Scarf complex is a minimal free resolution. Otherwise, syzygies are obtained by degeneration. We also develop a self-contained Riemann-Roch theory for artinian monomial ideals.
We investigate Riemann-Roch theory for directed graphs. The Riemann-Roch criteria of Amini and Manjunath is generalized to all integer lattices orthogonal to some positive vector. Using generalized notions of a $v_0$-reduced divisor and Dhar's algorithm we investigate two chip-firing games coming from the rows and columns of the Laplacian of a strongly connected directed graph. We discuss how the "column" chip-firing game is related to directed $\vec{G}$-parking functions and the "row" chip-firing game is related to the sandpile model. We conclude with a discussion of arithmetical graphs, whic…
We develop a new framework for investigating linear equivalence of divisors on graphs using a generalization of Gioan's cycle--cocycle reversal system for partial orientations. An oriented version of Dhar's burning algorithm is introduced and employed in the study of acyclicity for partial orientations. We then show that the Baker--Norine rank of a partially orientable divisor is one less than the minimum number of directed paths which need to be reversed in the generalized cycle--cocycle reversal system to produce an acyclic partial orientation. These results are applied in providing new proo…
The paper by M. Baker and S. Norine in 2007 introduced a new parameter on configurations of graphs and gave a new result in the theory of graphs which has an algebraic geometry flavour. This result was called Riemann-Roch formula for graphs since it defines a combinatorial version of divisors and their ranks in terms of configuration on graphs. The so called chip firing game on graphs and the sandpile model in physics play a central role in this theory. In this paper we give a presentation of the theorem of Baker and Norine in purely combinatorial terms, which is more accessible and shorter th…
The Ihara limit (or -constant) $A(q)$ has been a central problem of study in the asymptotic theory of global function fields (or equivalently, algebraic curves over finite fields). It addresses global function fields with many rational points and, so far, most applications of this theory do not require additional properties. Motivated by recent applications, we require global function fields with the additional property that their zero class divisor groups contain at most a small number of $d$-torsion points. We capture this by the torsion limit, a new asymptotic quantity for global function f…