Related papers: Counting Curves with Tangencies
Using the Semple bundle construction, we derive an intersection-theoretic formula for the number of simultaneous contacts of specified orders between members of a generic family of degree $d$ plane curves and finitely many fixed curves. The…
We enumerate plane complex algebraic curves of a given degree with one singularity of any given topological type. Our approach is to compute the homology classes of the corresponding equisingular strata in the parameter spaces of plane…
We use stable maps, and their stable lifts to the Semple bundle variety of second-order curvilinear data, to calculate certain characteristic numbers for rational plane curves. These characteristic numbers involve first-order (tangency) and…
We obtain a recursive formula for the number of rational degree $d$ curves in $\mathbb{CP}^2$ that pass through $3d+1-m$ generic points and that have an $m$-fold singular point. The special case of counting curves with a triple point was…
In this paper we compute the number of rational curves with one node passing through a given number of points, lines and tangent to a given number of planes in $\mathbb{P}^3$.
The goal of this text is to present the computation by Salmon, in the second half of the XIXth century, of various numbers enumerating planes with a prescribed tangency pattern with a sufficiently general surface $S$ in $\mathbf{P}^3$ (or,…
Reconstructing a finite set of curves from an unordered set of sample points is a well studied topic. There has been less effort that considers how much better the reconstruction can be if tangential information is given as well. We show…
A closed plane meander of order $n$ is a closed self-avoiding curve intersecting an infinite line $2n$ times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm,…
Let $\calP$ be a general pencil of curves of degree $d$ in the projective plane. In this paper we review the computation of the number of curves in $\calP$ that have a hyperflex line, a flex bitangent line or a tritangent line. Then we…
Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces $P(x,y,z)=Q(x,y,z)=0$…
We obtain an explicit formula for the number of rational cuspidal curves of a given degree on a del-Pezzo surface that pass through an appropriate number of generic points of the surface. This enumerative problem is expressed as an Euler…
A differentiable curve y = y(x) is determined by its tangent lines and is said to be the envelope of its tangent lines. The coefficients of the curve's tangent lines form a curve in another space, called the dual space. There is a…
Let $\mathcal{F}$ be a plane singular curve defined over a finite field $\mathbb{F}_q$. The linear system of plane curves of a given degree passing through the singularities of $\cF$ provides potentially good bounds for the number of points…
These notes are intended as an easy-to-read supplement to part of the background material presented in my talks on enumerative geometry. In particular, the numbers $n_3$ and $n_4$ of plane rational cubics through eight points and of plane…
Below we consider the evolutes of plane real-algebraic curves and discuss some of their complex and real-algebraic properties. In particular, for a given degree $d\ge 2$, we provide lower bounds for the following four numerical invariants:…
Enumerative algebraic geometry deals with problems of counting geometric objects defined algebraically, An important class of enumerative problems is that of counting curves: given a class of curves in some projective variety defined by…
We continue the development of methods for enumerating nodal curves on smooth complex surfaces, stressing the range of validity. We illustrate the new methods in three important examples. First, for up to eight nodes, we confirm…
In this paper we show how, under surprisingly weak assumptions, one can split a planar curve into three arcs and rearrange them (matching tangent directions) to obtain a closed curve. We also generalize this construction to curves split…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
For each $1\leq n\leq6$ we present formulas for the number of $n-$nodal curves in an $n-$dimensional linear system on a smooth, projective surface. This yields in particular the numbers of rational curves in the system of hyperplane…