Related papers: Plane curves containing a star configuration
Bocci, Carlini, and Kileel have shown that the square-free Hadamard product of a finite set of points $Z$ that all lie on a line $\ell$ in $\mathbb{P}^n$ produces a star configuration of codimension $n$. In this paper we introduce a…
Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…
We obtain a formula for the degrees of the varieties parameterizing complex algebraic curves of any divisor class and genus on P^2_6, the projective plane blown-up at 6 generic points. Moreover, the formula computes the degrees of the…
Curve stitching is a classic educational activity where one constructs elegant curves from a family of straight lines. We perform curve stitching around a circle to make a modular stitch graph. Take $m$ points equally spaced around a…
Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the curve passes through the point. We consider such coverings by…
Consider a graph G with n vertices. In this paper we study geometric conditions for an n-tuple of points in R^d to admit a tensegrity with underlying graph G. We introduce and investigate a natural stratification, depending on G, of the…
A string graph is an intersection graph of curves in the plane. A $k$-string graph is a graph with a string representation in which every pair of curves intersects in at most $k$ points. We introduce the class of $(=k)$-string graphs as a…
Let $S$ be a complete flat surface, such as the Euclidean plane. We obtain direct characterizations of the connected components of the space of all curves on $S$ which start and end at given points in given directions, and whose curvatures…
We enumerate complex curves on toric surfaces of any given degree and genus, having a single cusp and nodes as their singularities, and matching appropriately many point constraints. The solution is obtained via tropical enumerative…
In a recent paper arXiv:1602.02300v2, Cook II, Harbourne, Migliore and Nagel related the splitting type of a line arrangement in the projective plane to the number of conditions imposed by a general fat point of multiplicity $j$ to the…
Modular curves $X_{1}(N)$ parametrize elliptic curves with a point of order $N$. They can be identified with connected components of projectivized strata $\mathbb{P}\mathcal{H}(a,-a)$ of meromorphic differentials. As strata of meromorphic…
We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…
Let K be a field and let L/K be a finite extension. Let X/K be a scheme of finite type. A point of X(L) is said to be new if it does not belong to the union of X(F), when F runs over all proper subextensions of L. Fix now an integer g>0 and…
We study the normal map for plane projective curves, i.e., the map associating to every regular point of the curve the normal line at the point in the dual space. We first observe that the normal map is always birational and then we use…
Lebesgue curve is a space-filling curve that fills the unit square through linear interpolation. In this study, we generalise Lebesgue's construction to generate space-filling curves from any given planar substitution satisfying a mild…
Let $X$ be a complex nonsingular projective surface and let $L$ be an ample line bundle on $X$. We study multi-point Seshadri constants of $L$ at singular points of certain arrangements of curves on $X$. We pose some questions about such…
A subspace arrangement in a vector space is a finite collection of vector subspaces. Similarly, a configuration of linear spaces in a projective space is a finite collection of linear subspaces. In this paper we study the degree 2 part of…
One of the most important and useful examples in discrete geometry is a finite sequence of points on the moment curve $\gamma(t)=(t,t^2,t^3,\dots ,t^d)$ or, more generally, on a {\it strictly monotone curve} in $\mathbb R^d$. These…
A construction sequence for a graph is a listing of the elements of the graph (the set of vertices and edges) such that each edge follows both its endpoints. The construction number of the graph is the number of such sequences. We determine…
A curve in the plane is $x$-monotone if every vertical line intersects it at most once. A family of curves are called pseudo-segments if every pair of them have at most one point in common. We construct $2^{\Omega(n^{4/3})}$ families, each…