Euler Characteristics and Duality in Riemann Functions and the Graph Riemann-Roch Rank
Nicolas Folinsbee, Joel Friedman

TL;DR
This paper introduces a sheaf-theoretic framework using diagrams to analyze Riemann functions on integer lattices, establishing duality and Euler characteristic relations akin to Riemann-Roch formulas, with applications to graph theory.
Contribution
It develops a novel sheaf-theoretic approach with diagrams to model Riemann functions and their dualities, extending Riemann-Roch type formulas to higher dimensions without prior sheaf theory knowledge.
Findings
Establishes a unique Riemann-Roch formula for Riemann functions.
Models Riemann functions using diagrams and their cohomology.
Provides a canonical isomorphism linking cohomology groups of diagrams.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Graph Theory Research · Advanced Combinatorial Mathematics
