Related papers: Counting maps from curves to projective space via …
Rational curves on Hilbert schemes of points on $K3$ surfaces and generalised Kummer manifolds are constructed by using Brill-Noether theory on nodal curves on the underlying surface. It turns out that all wall divisors can be obtained, up…
Severi varieties and Brill-Noether theory of curves on K3 surfaces are well understood. Yet, quite little is known for curves on abelian surfaces. Given a general abelian surface $S$ with polarization $L$ of type $(1,n)$, we prove…
We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
The Brill-Noether Theorem gives necessary and sufficient conditions for the existence of a linear series. Here we consider a general n-fold, etale cyclic cover p of a curve C of genus g and investigate for which numbers r,d a linear series…
The language of graph theory, or network science, has proven to be an exceptional tool for addressing myriad problems in neuroscience. Yet, the use of networks is predicated on a critical simplifying assumption: that the quintessential unit…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
In this paper we obtain an explicit formula for the number of degree d curves in two dimensional complex projective space, passing through (d(d+3)/2 -k) generic points and having a codimension k singularity, where k is at most 7. In the…
We formulate a refined theory of linear systems, using the methods of a previous paper, "A Theory of Branches for Algebraic Curves", and use it to give a geometric interpretation of the genus of an algebraic curve. Using principles of…
The splitting number is effective to distinguish the embedded topology of plane curves, and it is not determined by the fundamental group of the complement of the plane curve. In this paper, we give a generalization of the splitting number,…
We investigate graph representation learning approaches that enable models to generalize across graphs: given a model trained using the representations from one graph, our goal is to apply inference using those same model parameters when…
Mayer's theory of cluster integrals allows one to write the partition function of a gas model as a generating function of weighted graphs. Recently, Labelle, Leroux and Ducharme have studied the graph weights arising from the…
We extend a previous result of Feyzbakhsh concerning the injectivity of a map of moduli spaces and we use this result to construct curves whose Brill-Noether loci have unexpected dimension.
We survey some properties of a class of curves lying on certain elliptic ruled surfaces, studied by A. Treibich and J.L. Verdier in connection with elliptic solitons and KP equations. In particular we discuss their Brill-Noether generality,…
Tropical geometry is a piecewise linear "shadow" of algebraic geometry. It allows for the computation of several cohomological invariants of an algebraic variety. In particular, its application to enumerative algebraic geometry led to…
We analyze a family of graphs known as banana graphs, with two marked vertices, through the lens of Hurwitz-Brill-Noether theory. As an application, we construct explicit new examples of finite graphs which are Brill-Noether general. These…
We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…