Related papers: A Riemann-Roch theorem for edge-weighted graphs
The goal of this paper is to prove Riemann-Roch type theorems for Deligne-Mumford algebraic stacks. To this end, we introduce a "cohomology with coefficients in representations" and a Chern character, and we prove a…
Karo\'nski, {\L}uczak and Thomason conjectured in 2004 that for every finite graph without isolated edge, the edges can be assigned weights from $\{1,2,3\}$ in such a way that the endvertices of each edge have different sums of incident…
The divisor theory of the complete graph $K_n$ is in many ways similar to that of a plane curve of degree $n$. We compute the splitting types of all divisors on the complete graph $K_n$. We see that the possible splitting types of divisors…
We give yet another proof of the list-color version of Brooks' theorem that is due, independently, to Vizing and to Erd\H{o}s, Rubin and Taylor, via a famous theorem of Dirac on chordal graphs.
Let $(G, \omega)$ be a hyperelliptic vertex-weighted graph of genus $g \geq 2$. We give a characterization of $(G, \omega)$ for which there exists a smooth projective curve $X$ of genus $g$ over a complete discrete valuation field with…
We study Brill-Noether existence on a finite graph using methods from polyhedral geometry and lattices. We start by formulating analogues of the Brill-Noether conjectures (both the existence and non-existence parts) for…
In this paper, we study the task of detecting the edge dependency between two weighted random graphs. We formulate this task as a simple hypothesis testing problem, where under the null hypothesis, the two observed graphs are statistically…
The Riemann-Roch formula is a cornerstone in the classical theory of algebraic curves. Here we present a novel approach to its proof, by answering a question posed in 2007 by Matthew Baker and Serguei Norine.
By considering graphs as discrete analogues of Riemann surfaces, Baker and Norine (Adv. Math. 2007) developed a concept of linear systems of divisors for graphs. Building on this idea, a concept of gonality for graphs has been defined and…
We show a Riemann-Roch theorem for group ring bundles over an arithmetic surface; this is expressed using the higher adeles of Beilinson-Parshin and the tame symbol via a theory of adelic equivariant Chow groups and Chern classes. The…
We study invariants of virtual graphoids, which are virtual spatial graph diagrams with two distinguished degree-one vertices modulo graph Reidemeister moves applied away from the distinguished vertices. Generalizing previously known…
In this paper, we prove the real part of the Riemann-Roch-Grothendieck theorem for complex flat vector bundles at the differential form level.
Given a fixed integer $n$, we prove Ramsey-type theorems for the classes of all finite ordered $n$-colorable graphs, finite $n$-colorable graphs, finite ordered $n$-chromatic graphs, and finite $n$-chromatic graphs.
Using the concept of a twisted trace density on a cyclic groupoid, a trace is constructed on a formal deformation quantization of a symplectic orbifold. An algebraic index theorem for orbifolds follows as a consequence of a local…
We proved in another paper that every connected graph can be realized as the cut locus of some point on some riemannian surface. Here we give upper bounds on the number of such realizations.
We characterize unmixed and Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs. We also provide examples of oriented graphs which have unmixed and non-Cohen-Macaulay vertex-weighted edge ideals, while the edge ideal of…
Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…
We prove an analogue in Arakelov geometry of the Grothendieck-Riemann-Roch theorem.
Let $ D $ be a finite digraph, and let $ V_0,\dots,V_{k-1} $ be nonempty subsets of $ V(D) $. The (strong form of) Edmonds' branching theorem states thatthere are pairwise edge-disjoint spanning branchings $ \mathcal{B}_0,\dots,…
A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph $\Gamma$ is an element of the free abelian group on $\Gamma$. The rank of a divisor on a metric graph is…