Related papers: Effective divisor classes on metric graphs

In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs are all divisor graphs, which also implies the main result…

The goal of the paper is two-fold. At first, we attempt to give a survey of some recent applications of symmetric polynomials and divided differences to intersection theory. We discuss: polynomials universally supported on degeneracy loci;…

We develop the theory of transformation semigroups that have degree 2, that is, act by partial functions on a finite set such that the inverse image of points have at most two elements. We show that the graph of fibers of such an action…

We study first order equations of continuity and transport type on metric spaces of martingale dimension one, including finite metric graphs, p.c.f. self-similar sets and classical Sierpi\'nski carpets. On such spaces solutions of the…

Two semisimple algebraic groups of the same type are said to be motivic equivalent if the motives of the associated projective homogeneous varieties of the same type are isomorphic. We give general criteria of motivic equivalence in terms…

Let $G$ be a finite group. We consider the set of the irreducible complex characters of $G$, namely $Irr(G)$, and the related degree set $cd(G)=\{\chi(1) : \chi\in Irr(G)\}$. Let $\rho(G)$ be the set of all primes which divide some…

We propose a new framework for designing test and query functions for complex structures that vary across a given parameter such as genetic marker position. The operations we are interested in include equality testing, set operations,…

The problem of characterizing graphs with a prescribed number of main eigenvalues is a long-standing problem in spectral graph theory. Although some constructions are known, only a few produce infinite families of simple connected graphs…

The main goal of this article is to compute the class of the divisor of $\overline{\mathcal{M}}_3$ obtained by taking the closure of the image of $\Omega\mathcal{M}_3(6;-2)$ by the forgetful map. This is done using Porteous formula and the…

Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the…

The class of Euclidean unit disk graphs is one of the most fundamental and well-studied graph classes with underlying geometry. In this paper, we identify this class as a special case in the broader class of hyperbolic unit disk graphs and…

We study types that appear in ultraproducts that have distributions which can be thought of as a sequence of graphs. The property of having distributions that are captured by graphs is motivated by a commonality of $\mathrm{SOP}_2$-types…

There is a long line of research in the literature dedicated to word-representable graphs, which generalize several important classes of graphs. However, not much is known about word-representability of split graphs, another important class…

The dimension of spaces of global sections for line bundles on semistable curves parametrized by the compactified Picard scheme is studied. The theorem of Riemann is shown to hold. The theorem of Clifford is shown to hold in the following…

We investigate the product structure of hereditary graph classes admitting strongly sublinear separators. We characterise such classes as subgraphs of the strong product of a star and a complete graph of strongly sublinear size. In a more…

A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. A split comparability graph is a split graph which is transitively orientable. In this work, we characterize split comparability graphs in…

It is a consequence of the Jacobi Inversion Theorem that a line bundle over a Riemann surface M of genus g has a meromorphic section having at most g poles, or equivalently, the divisor class of a divisor D over M contains a divisor having…

The paper by M. Baker and S. Norine in 2007 introduced a new parameter on configurations of graphs and gave a new result in the theory of graphs which has an algebraic geometry flavour. This result was called Riemann-Roch formula for graphs…

Let $G=\Gamma(S)$ be a semigroup graph, i.e., a zero-divisor graph of a semigroup $S$ with zero element 0. For any adjacent vertices $x, y$ in $G$, denote $C(x,y)={z\in V(G) | N(z)={x,y}}$. Assume that in $G$ there exist two adjacent…

Let $G$ be a finite group. The bipartite divisor graph for the set of irreducible complex character degrees is the undirected graph with vertex set consisting of the prime numbers dividing some character degree and of the non-identity…