Related papers: A Riemann-Roch theorem for edge-weighted graphs

The classical arithmetic Grothendieck-Riemann-Roch theorem can be applied only to projective morphisms that are smooth over the complex numbers. In this paper we generalize the arithmetic Grothendieck-Riemann-Roch theorem to the case of…

An edge weighting problem of a graph G is an assignment of an integer weight to each edge e. Based on edge weighting problem, several types of vertex-coloring problems are put forward. A simple observation illuminates that edge weighting…

We generalize the natural duality of graphs embedded into a surface to a duality with respect to a subset of edges. The dual graph might be embedded into a different surface. We prove a relation between the signed Bollobas-Riordan…

Roe's partitioned manifold index theorem applies when a complete Riemannian manifold $M$ is cut into two pieces along a compact hypersurface $N$. It states that a version of the index of a Dirac operator on $M$ localized to $N$ equals the…

The edge-of-the-wedge theorem in several complex variables gives the analytic continuation of functions defined on the poly upper half plane and the poly lower half plane, the set of points in $\mathbb{C}^d$ with all coordinates in the…

We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k edge-disjoint spanning trees.

We prove that both multiple Rademacher system and Rademacher chaos possess the property of random unconditional convergence in the space $L_\infty$. This fact combined with some intimate connections between $L_\infty$-norms of linear…

Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minh's conjecture for wheel graphs,…

In this note we propose an $\omega$-operadical way to prove the existence of the $\omega$-graph of the $\omega$-graphs and the reflexive $\omega$- graph of the reflexive $\omega$-graphs.

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse…

We confirm the eventual evasiveness of several classes of monotone graph properties under widely accepted number theoretic hypotheses. In particular we show that Chowla's conjecture on Dirichlet primes implies that (a) for any graph $H$,…

We show that, in characteristic zero, the obvious integral version of the Grothendieck-Riemann-Roch formula obtained by clearing the denominators of the Todd and Chern characters is true (without having to divide the Chow groups by their…

We prove a generalisation of the Grothendieck-Riemann-Roch theorem, which is valid for any proper and flat morphism between noetherian and separated schemes of odd characteristic.

In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…

In an influential 2008 paper, Baker proposed a number of conjectures relating the divisor theory of algebraic curves with an analogous combinatorial theory on finite graphs. In this note, we examine Baker's Brill--Noether existence…

Consider a `dense' Erd\H{o}s--R\'enyi random graph model $G=G_{n,M}$ with $n$ vertices and $M$ edges, where we assume the edge density $M/\binom{n}{2}$ is bounded away from 0 and 1. Fix $k=k(n)$ with $k/n$ bounded away from 0 and~1, and let…

Let $\mathcal{D}$ be a weighted oriented graph and let $I(\mathcal{D})$ be its edge ideal in a polynomial ring $R$. We give the formula of Castelnuovo-Mumford regularity of $R/I(\mathcal{D})$ when $\mathcal{D}$ is a weighted oriented path…

The goal of this paper is to prove the Riemann-Roch isomorphism for the higher equivariant K-theory of varieties with action of a linear algebraic group.

The Riemann-Roch Theorem is one of the cornerstones of algebraic geometry, connecting algebraic data (sheaf cohomology) with geometric ones (intersection theory). This survey paper provides a self-contained introduction and a complete proof…

In this paper, we develop the idea to partition the edges of a weighted graph in order to uncover overlapping communities of its nodes. Our approach is based on the construction of different types of weighted line graphs, i.e. graphs whose…