Related papers: Riemann-Roch theory on finite sets
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…
Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…
Beck's conjecture on coloring of graphs associated to various algebraic objects has generated considerable interest in the community of discrete mathematics and combinatorics since its inception in the year 1988. The version of this…
We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a…
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 contrast to the abundance of "direct" Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a…
The paper deals with a comprehensive theory of mappings, whose local behavior can be described by means of linear subspaces, contained in the graphs of two (primal and dual) generalized derivatives. This class of mappings includes the…
On a non-compact, smooth, connected, boundaryless, complete Riemannian manifold $(M,g)$, one can define its ideal boundary by rays (or equivalently, Busemann functions). From the viewpoint of Mather theory, boundary elements could be…
Bidirected graphs are a generalisation of directed graphs that arises in the study of undirected graphs with perfect matchings. Menger's famous theorem - the minimum size of a set separating two vertex sets $X$ and $Y$ is the same as the…
We prove well-posedness for very general linear wave- and diffusion equations on compact or non-compact metric graphs allowing various different conditions in the vertices. More precisely, using the theory of strongly continuous operator…
The paper is a short supplement of the longer paper "The Algebraic Proof of the Universality Theorem", preprint math.AG/0402045. In this short note, we outline the geometric meaning of Universality theorem (conjecture by Gottsche) as a…
We gave an alternative short proof on the finite generation of holomorphic functions with polynomial growth on Riemann surfaces with nonnegative curvature. The first proof was due to Li and Tam.
We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…
The main result of this paper is a Pfaffian formula for the partition function of the dimer model on a graph G embedded in a closed, possibly non-orientable surface S. This formula is suitable for computational purposes, and it is obtained…
We give optimal effective bounds for some well-known theorems on complex algebraic surfaces, which are respectively due to Serre, Zariski (1962), Castelnuovo (1897), Artin (1962, 1966), Benveniste (1984), Cutkosky and Srinivas (1993). These…
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present paper we reprove their theorem using many of the same ideas, but with the key…
In this paper, we formulate axioms of certain graded cohomology theory for which Chern class maps from higher K-theory are defined, following the method of Gillet [Gi1]. We will not include homotopy invariance nor purity in our axioms. It…
In 1988, I. Beck introduced the notion of a zero-divisor graph of a commutative rings with $1$. There have been several generalizations in recent years. In particular, in 2007 J. Coykendall and J. Maney developed the irreducible divisor…
In the present paper, we discuss applications of the derived completion theorems proven in our previous two papers. One of the main applications is to Riemann-Roch problems for forms of higher equivariant K-theory, which we are able to…