Search arXivSearch

arXiv · 2207.07220

Euler Characteristics and Duality in Riemann Functions and the Graph Riemann-Roch Rank

Abstract

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}\in{\mathbb Z}^n$ we have $$ f({\bf d}) - f^\wedge_{\bf K}({\bf K}-{\bf d}) = {\rm deg}({\bf d})+C $$ 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 $f\colon{\mathbb Z}^2\to{\mathbb Z}$ there is a simple family of diagrams $\{\mathcal{M}_{W,{\bf d}}\}_{{\bf d}\in{\mathbb Z}^2}$ such that $f({\bf d})=b^0({\mathcal{M}}_{W,{\bf d}})$ and $f^\wedge_{\bf K}({\bf K}-{\bf d})=b^1({\mathcal{M}}_{W,{\bf d}})$. Furthermore we give a canonical isomorphism $$ H^1({\mathcal{M}}_{W,{\bf d}})^* \to H^0({\mathcal{M}}_{W',{\bf K}-{\bf d}}) $$ where $W'$ is the weight of $f^\wedge_{\bf K}$. General Riemann functions $f\colon{\mathbb Z}^2\to{\mathbb Z}$ are similarly modeled with formal differences of diagrams. Riemann functions ${\mathbb Z}^n\to{\mathbb Z}$ 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicolas Folinsbee, Joel Friedman. 2022-07-14. Euler Characteristics and Duality in Riemann Functions and the Graph Riemann-Roch Rank. https://arxiv.org/abs/2207.07220

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO