Search arXivSearch

arXiv · 2607.00238

Duality and a Canonical Sheaf in Periodic Riemann Functions

Abstract

Let $f\colon{\mathbb Z}^2\to{\mathbb Z}$ be a Riemann function whose weight $W$ is a perfect matching. Then there is a family of sheaves of $k$-vector spaces $\{{M}_{W,{\bf d}}\}_{{\bf d}\in{\mathbb Z}^2}$ on a five-point topological that models $f$ in that $f({\bf d})=b^0({M}_{W,{\bf d}})$ and that $$ b^1({M}_{W,{\bf d}})= f^\wedge_{\bf K}({\bf d}-{\bf K}) $$ for any ${\bf K}\in{\mathbb Z}^2$. Hence a Riemann-Roch formula for $f$ is equivalent to an Euler characteristic computation of ${M}_{W,{\bf d}}$. If $f$ and $W$ are $r$-periodic, then the sheaves ${M}_{W,{\bf d}}$ become ${O}_r$-modules of finite type for a natural sheaf of rings ${O}={O}_r$. We show that in this case there is a ``canonical ${O}$-module'' $ω=ω_W$ and a pairing for $i=0,1$, $$ H^i(M_{W,{\bf 0}}\otimes F) \times {\rm Ext}^{1-i}(F,M_{W^\wedge_{\bf L},{\bf K}})\to H^1(ω)\cong k $$ that is perfect when ${\bf L}={\bf K}+{\bf 1}$ and ${F}$ is a certain type of line bundle or a certain type of skyscraper sheaf. In particular when ${F}$ is a line bundle, we realize the above formula for $b^1({M}_{W,{\bf d}})$ as a duality theorem akin to Serre duality. We show that canonical ${O}$-module $ω_W$ is a rather exceptional element in a family of tensor products of two modules ${M}\otimes_{O}{M}'$, where ${M}$ and ${M}'$ vary over ${O}_r$-modules of the form ${M}_{W',{\bf d}}$. This article doesn't assume any background in sheaf theory; rather we describe all our sheaves as a ``diagrams of vector spaces,'' where each diagram is essentially a sheaf of vector spaces on a fixed topological space of five points.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicolas Folinsbee, Joel Friedman. 2026-06-30. Duality and a Canonical Sheaf in Periodic Riemann Functions. https://arxiv.org/abs/2607.00238

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

KEEP EXPLORING

Related papers

Matching Complexes of Outerplanar Graphs

An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we prove that the matching complexes of outerplanar graphs are contractible or homotopy equivalent to a wedge of spheres. This extends known results about trees and polygonal line tilings.

math.CO

Awesome graph parameters

For a graph $G$, we denote by $α(G)$ the size of a maximum independent set and by $ω(G)$ the size of a maximum clique in $G$. Our paper lies on the edge of two lines of research, related to $α$ and $ω$, respectively. One of them studies $α$-variants of graph parameters, such as $α$-treewidth or $α$-degeneracy. The second line deals with graph classes where some parameters are bounded by a function of $ω(G)$. A famous example of this type is the family of $χ$-bounded classes, where the chromatic number $χ(G)$ is bounded by a function of $ω(G)$. A Ramsey-type argument implies that if the $α$-variant of a graph parameter $ρ$ is bounded by a constant in a hereditary class $\mathcal{G}$, then $ρ$ is bounded by a function of $ω$ in $\mathcal{G}$. If the reverse implication also holds, we say that $ρ$ is awesome. Otherwise, we say that $ρ$ is awful. In the present paper, we identify a number of awesome and awful graph parameters, derive some algorithmic applications of awesomeness, and propose a number of open problems related to these notions.

math.CO

Perfect matchings and $A_α$-spectral radius in 1-binding graphs

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. For $α\in[0,1)$, we use $A_α(G)$ and $ρ_α(G)$ to denote the $A_α$-matrix and the $A_α$-spectral radius of $G$, respectively. The binding number $\mbox{bind}(G)$ of $G$ is defined by $\mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptyset\neq X\subseteq V(G),N_G(X)\neq V(G)\right\}$. If $\mbox{bind}(G)\geq1$, then $G$ is called 1-binding. A perfect matching in $G$ is a set of nonadjacent edges covering every vertex of $G$. Tutte proved that a graph $G$ of even order has a perfect matching if and only if $o(G-S)\leq|S|$ holds for every $S\subseteq V(G)$ [W. Tutte, The factorization of linear graphs, J. Lond. Math. Soc. 22 (1947) 107--111]. In this paper, we use Tutte's result to prove that a connected 1-binding graph $G$ of even order $n$ with $n\geq n(α)$ has a perfect matching unless $G=K_1\vee(K_{n-5}\cup K_3\cup K_1)$ if $ρ_α(G)\geqρ_α(K_1\vee(K_{n-5}\cup K_3\cup K_1))$, where $n(α)$ is defined as follows: $n(α)=\max\{18,\frac{2+8α}{1-2α}\}$ if $α\in[0,\frac{1}{2})$, and $n(α)=18$ if $α=\frac{1}{2}$.

math.CO