Related papers: Free divisors on metric graphs
A metric basis in a graph $G$ is a smallest possible set $S$ of vertices of $G$, with the property that any two vertices of $G$ are uniquely recognized by using a vector of distances to the vertices in $S$. A strong metric basis is a…
In this largely-expository note, we describe a class of divisors on elliptic curves that index the inflection points of linear series arising (as subspaces of holomorphic sections) from line bundles on $\mathbb{P}^1$ via pullback along the…
Steinerberger proposed a notion of curvature on graphs involving the graph distance matrix (J. Graph Theory, 2023). We show that nonnegative curvature is almost preserved under three graph operations. We characterize the distance matrix and…
In [1] M. Baker and S. Norine developed a theory of divisors and linear systems on graphs, and proved a Riemann-Roch Theorem for these objects (conceived as integer-valued functions on the vertices). In [2] and [3] the authors generalized…
We prove a Reeb sphere theorem for finite simple graphs. The result bridges two different definitions of spheres in graph theory. We also reformulate Morse conditions in terms of the center manifolds, the level surface graphs {f=f(x)} in…
We consider the primes which divide the denominator of the x-coordinate of a sequence of rational points on an elliptic curve. It is expected that for every sufficiently large value of the index, each term should be divisible by a primitive…
Graphs are mathematical tools that can be used to represent complex real-world interconnected systems, such as financial markets and social networks. Hence, machine learning (ML) over graphs has attracted significant attention recently.…
A graph is $H$-free if it has no induced subgraph isomorphic to $H$. We characterize all graphs $H$ for which there are only finitely many minimal non-three-colorable $H$-free graphs. Such a characterization was previously known only in the…
Let X be a smooth projective variety defined over an algebraically closed field, and let Y in X be a reduced and irreducible ample divisor in X. We give a numerical sufficient condition for a base point free pencil on $Y$ to be the…
For causal discovery in the presence of latent confounders, constraints beyond conditional independences exist that can enable causal discovery algorithms to distinguish more pairs of graphs. Such constraints are not well-understood yet. In…
We study obstacle problems governed by two distinct types of diffusion operators involving interacting free boundaries. We obtain a somewhat surprising coupling property, leading to a comprehensive analysis of the free boundary. More…
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,…
The independence gap of a graph was introduced by Ekim et al. (2018) as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum and minimum size of a maximal independent set. We…
Comparability graphs are a popular class of graphs. We introduce as the digraph analogue of comparability graphs the class of comparability digraphs. We show that many concepts such as implication classes and the knotting graph for a…
The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a…
In this paper we collect the main properties of free curves in the complex projective plane and a lot of conjectures and open problems, both old and new. In the quest to understand the mystery of free curves, many tools were developed and…
In [1] the problem of finding a sharp lower bound on lower against number of a general graph is mentioned as an open question. We solve the problem by establishing a tight lower bound on lower against number of a general graph in terms of…
We define a distance metric between partitions of a graph using machinery from optimal transport. Our metric is built from a linear assignment problem that matches partition components, with assignment cost proportional to transport…
Conditional independence and graphical models are well studied for probability distributions on product spaces. We propose a new notion of conditional independence for any measure $\Lambda$ on the punctured Euclidean space $\mathbb…
Given a singular curve on a smooth surface, we determine which exceptional divisors on the minimal resolution of that curve contribute toward its jumping numbers.