Euler Characteristics and Duality in Riemann Functions and the Graph Riemann-Roch Rank
Abstract
By a {\em Riemann function} we mean a function such that is equals for sufficiently small, and equals for a constant, -- the {\em offset of } -- for sufficiently large. By adding to the Baker-Norine rank function of a graph, one gets an equivalent Riemann function, and similarly for related rank functions. For such an , for any there is a unique Riemann function such that for all we have which we call a {\em generalized Riemann-Roch formula}. We show that any such equation can be viewed as an Euler charactersitic equation of sheaves of a particular simple type that we call {\em diagrams}. This article does not assume any prior knowledge of sheaf theory. To certain Riemann functions there is a simple family of diagrams such that and . Furthermore we give a canonical isomorphism where is the weight of . General Riemann functions are similarly modeled with formal differences of diagrams. Riemann functions are modeled using their restrictions to two of their variables. These constructions involve some ad hoc choices, although the equivalence class of virtual diagram obtained is independent of the ad hoc choices.
Keywords
Cite
@article{arxiv.2207.07220,
title = {Euler Characteristics and Duality in Riemann Functions and the Graph Riemann-Roch Rank},
author = {Nicolas Folinsbee and Joel Friedman},
journal= {arXiv preprint arXiv:2207.07220},
year = {2022}
}