Related papers: A Riemann-Roch theorem for edge-weighted graphs
This paper proves an integral version of the Riemann-Roch theorem for surface bundles, comparing the standard cohomology classes with the cohomology classes coming from the symplectic group.
The divisor theory for graphs is compared to the theory of linear series on curves through the correspondence associating a curve to its dual graph. An algebro-geometric interpretation of the combinatorial rank is proposed, and proved in…
We present a largely self contained account on the K-theory of a weighted smooth projective curve over an algebraically closed field. In particular, we discuss the weighted version of divisor theory, Euler form, and Riemann-Roch theorem.…
In this paper, by the generalized Bell umbra and Rolle's theorem, we give some results on the real rootedness of polynomials. Some applications on partition polynomials and the sigma polynomials of graphs are given.
The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the…
We prove that for any two graphs $G$ and $H$, the edges of $G$ can be strongly separated by a collection of linearly many subdivisions of $H$ and single edges. This confirms a conjecture of Botler and Naia.
Baker and Norine initiated the study of graph divisors as a graph-theoretic analogue of the Riemann-Roch theory for Riemann surfaces. One of the key concepts of graph divisor theory is the {\it rank} of a divisor on a graph. The importance…
We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
In algebraic geometry, there is a reduction algorithm that transforms the unreduced divisor into a unique reduced divisor, which existence is guaranteed by the Riemann-Roch theorem. We discuss application of this algorithm to construction…
We give a simple proof of the Riemann-Roch theorem for Deligne-Mumford stacks using the equivariant Riemann-Roch theorem and the localization theorem in equivariant K-theory together with some basic commutative algebra of Artin rings.
In this lecture we review apprearance of the Riemann-Roch Theorem in classical function theory, Algebraic topology, in theory of pseudo-differential operators and finally in noncommutative geometry. We show also it usefulness in many…
A metrized complex of algebraic curves is a finite metric graph together with a collection of marked complete nonsingular algebraic curves, one for each vertex, the marked points being in bijection with incident edges. We establish a…
We get central limit type theorems for the total number of edges in the generalized random graphs with random vertex weights under different moment conditions on distributions of the weights.
We show that if a graph contains few induced copies of a given graph then its edges are distribited unevenly.
We present a comprehensive $L^2$-theory for the $\overline\partial$-operator on singular complex curves, including $L^2$-versions of the Riemann-Roch theorem and some applications.
In this paper, we introduce some reduction processes on graphs which preserve the regularity of related edge ideals. As a consequence, an alternative proof for the theorem of R. Fr\"oberg on linearity of resolution of edge ideal of graphs…
Nash-Williams proved that for an undirected graph $ G $ the set $ E(G) $ can be partitioned into cycles if and only if every cut has either even or infinite number of edges. Later C. Thomassen gave a simpler proof for this and conjectured…
The dollar game is a chip-firing game introduced by Baker and Norine (2007) as a context in which to formulate and prove the Riemann-Roch theorem for graphs. A divisor on a graph is a formal integer sum of vertices. Each determines a dollar…