Related papers: Special divisors in special divisor classes on gra…
We study special linear systems called "very special" whose dimension does not satisfy a Clifford type inequality given by Huisman. We classify all these very special linear systems when they are compounded of an involution. Examples of…
An independent set in a graph G is a set of vertices no two of which are joined by an edge. A vertex-weighted graph associates a weight with every vertex in the graph. A vertex-weighted graph G is called a unique independence…
Let C be a general connected, smooth, projective curve of positive genus g. For each nonnegative integer i we give formulas for the number of pairs (P,Q) em C x C off the diagonal such that (g+i-1)Q-(i+1)P is linearly equivalent to an…
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
Motivated by a conjecture of Xiao, we study supporting divisors of fibred surfaces. On the one hand, after developing a formalism to treat one-dimensional families of varieties of any dimension, we give a structure theorem for fibred…
The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…
For a given graph $H$, we say that a graph $G$ has a perfect $H$-subdivision tiling if $G$ contains a collection of vertex-disjoint subdivisions of $H$ covering all vertices of $G.$ Let $\delta_{\mathrm{sub}}(n, H)$ be the smallest integer…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
In geometric terms, given a singular foliation of the plane, a dicritical divisor is (whenever it exists) an irreducible component of the exceptional divisor which is transverse to the foliation. Abhyankar gave recently a definition of the…
Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these…
We give a natural sufficient condition for an intersection graph of compact convex sets in R^d to have a balanced separator of sublinear size. This condition generalizes several previous results on sublinear separators in intersection…
A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of 4n-8 edges. We show that optimal 1-planar graphs can be recognized in linear time. Our…
We produce full strong exceptional collections consisting of vector bundles on the geometric invariant theory quotient of certain linear actions of a split reductive group $G$ of rank two. The vector bundles correspond to irreducible…
We extend the notion of chip-firing to weighted graphs, and generalize the Greedy Algorithm and Dhar's Burning Algorithm to weighted graphs. For a vertex $q \in V(\Gamma)$, we give an upper bound for the number of linearly equivalent…
Let R be a finite commutative ring with unity, and let G = (V, E) be a simple graph. The zero-divisor graph, denoted by {\Gamma}(R) is a simple graph with vertex set as R, and two vertices x, y \in R are adjacent in {\Gamma}(R) if and only…
We prove that, if X is a variety over an uncountable algebraically closed field k of characteristic zero, then any irreducible exceptional divisor E on a resolution of singularities of X which is not uniruled, belongs to the image of the…
How can sparse graph theory be extended to large networks, where algorithms whose running time is estimated using the number of vertices are not good enough? I address this question by introducing 'Local Separators' of graphs. Applications…
Edge-weighted graphs play an important role in the theory of Robinsonian matrices and similarity theory, particularly via the concept of level graphs, that is, graphs obtained from an edge-weighted graph by removing all sufficiently light…
We study the dimension of loci of special line bundles on stable curves and for a fixed semistable multidegree. In case of total degree $d = g - 1$, we characterize when the effective locus gives a Theta divisor. In case of degree $g - 2$…
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…