Related papers: Special divisors in special divisor classes on gra…
The divisorial gonality of a graph is the minimum degree of a positive rank divisor on that graph. We introduce the multiplicity-free gonality of a graph, which restricts our consideration to divisors that place at most \(1\) chip on each…
Since the works of Krasnov and Scheiderer, there has been an interest in studying effective totally real divisors on a curve X defined over a real closed field, i.e., effective divisors supported on the real locus. Scheiderer proved that,…
We establish that a simple polynomial-time algorithm that we call reweighted spectral partitioning obtains small 2/3-balanced vertex-separators for a number of graph classes, including $O(\sqrt{n})$-sized separators for planar graphs,…
Let M be a graph manifold. We prove that fundamental groups of embedded incompressible surfaces in M are separable in the fundamental group of M, and that the double cosets for crossing surfaces are also separable. We deduce that if there…
In this paper we introduced an arithmetic graph function which associates with every group G the directed graph whose vertices corresponds to the divisors of |G|. With the help of such functions we introduced arithmetic graphs of classes of…
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…
In this note, we extend work of Farkas and Rim\'anyi on applying quadric rank loci to finding divisors of small slope on the moduli space of curves by instead considering all divisorial conditions on the hypersurfaces of a fixed degree…
The geometry of divisors on algebraic curves has been studied extensively over the years. The foundational results of this Brill-Noether theory imply that on a general curve, the spaces parametrizing linear series (of fixed degree and…
The divisor graph is the non oriented graph whose vertices are the positive integers, and edges are the {a,b} such that a divides b or b divides a. Let F(x,y) be the maximum number of integers<= x belonging in one of y pairwise disjoint…
In this paper, we continue the program initiated by I. Beck's now classical paper concerning zero-divisor graphs of commutative rings. After the success of much research regarding zero-divisor graphs, many authors have turned their…
A graph labeling assigns values to the components of a graph (vertices, edges, etc.). In particular, distance magic labelings have been widely studied in undirected graphs. In such a labeling, the vertices are labeled with unique values…
We believe we have made progress in the age-old problem of divisibility rules for integers. Universal divisibility rule is introduced for any divisor in any base number system. The divisibility criterion is written down explicitly as a…
We study the ramification divisors of projections of a smooth projective variety onto a linear subspace of the same dimension. We prove that the ramification divisors vary in a maximal dimensional family for a large class of varieties.…
We say that a vertex or edge colouring of a graph is distinguishing if the only automorphism that preserves this colouring is the identity. A (proper) distinguishing colouring is irreducible if there is no possibility of merging two…
We show that the prime divisors in every class on a projective curve over a finite field contain arbitrary large truncated generalized classes of finite effective divisors.
On a weighted projective surface $\mathbb{P}(a,b,c)$ with $\min(a,b,c)\leq 4$, we compute lower bounds for the {\em effective threshold} of an ample divisor, in other words, the highest multiplicity a section of the divisor can have at a…
We consider fair allocation of indivisible items under an additional constraint: there is an undirected graph describing the relationship between the items, and each agent's share must form a connected subgraph of this graph. This framework…
We study slope stability of smooth surfaces and its connection with exceptional divisors. We show that a surface containing an exceptional divisor with arithmetic genus at least two is slope unstable for some polarisation. In the converse…
We study how many comparability subgraphs are needed to partition the edge set of a perfect graph. We show that many classes of perfect graphs can be partitioned into (at most) two comparability subgraphs and this holds for almost all…
The graph isomorphism problem is a main problem which has numerous applications in different fields. Thus, finding an efficient and easy to implement method to discriminate non-isomorphic graphs is valuable. In this paper, a new method is…