Related papers: Curve Counting \`a la G\"ottsche

The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…

This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…

We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in $\mathbb{R}^4$. Specifically, we show that an arrangement of $n$ algebraic curves determines at most $C_\epsilon…

The defect of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre upper bound for the number of points on the curve. We present algorithms for constructing curves of genus 5,…

Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…

The purpose of this paper is to study low degree points on plane curves. We prove results analogous to those of Debarre and Klassen for singular plane curves with a finite number $\delta$ of ordinary nodes/cusps, where $\delta$ is bounded…

Let $G$ be a multigraph with $n$ vertices and $e>4n$ edges, drawn in the plane such that any two parallel edges form a simple closed curve with at least one vertex in its interior and at least one vertex in its exterior. Pach and T\'oth (A…

For a set of curves, Ahn et al. introduced the notion of a middle curve and gave algorithms computing these with run time exponential in the number of curves. Here we study the computational complexity of this problem: we show that it is…

We consider the following problem: on any given complete Riemannian manifold $(M,g)$, among all curves which have fixed length as well as fixed end-points and tangents at the end-points, minimise the $L^\infty$ norm of the curvature. We…

We prove the conjectures of Yau-Zaslow and Gottsche concerning the number curves on K3 surfaces. Specifically, let X be a K3 surface and C be a holomorphic curve in X representing a primitive homology class. We count the number of curves of…

This is an extended version of an invited lecture I gave at the Journees Arithmetiques in St. Etienne in July 2009. We discuss the state of the art regarding the problem of finding the set of rational points on a (smooth projective)…

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…

We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends previous work of ours to all curves for which a good lift to characteristic zero is known. We develop all the necessary bounds,…

We study the following question: given a set P of 3d-2 points and an immersed curve G in the real plane R^2, all in general position, how many real rational plane curves of degree d pass through these points and are tangent to this curve.…

We consider the problem of untangling a given (non-planar) straight-line circular drawing $\delta_G$ of an outerplanar graph $G=(V, E)$ into a planar straight-line circular drawing by shifting a minimum number of vertices to a new position…

We consider systems of simple closed curves on surfaces and their total number of intersection points, their so-called crossing number. For a fixed number of curves, we aim to minimise the crossing number. We determine the minimal crossing…

This is a survey describing recents developments in enumerative geometry of curves on projective varieties. Various methods to arrive at results such as Kontsevich's formula for plane rational curves, or Caporaso-Harris's formula for plane…

Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n vertices in…

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…

Let $X\to \mathbb P^2$ be the elliptic Calabi-Yau threefold given by a general Weierstrass equation. We answer the enumerative question of how many discrete rational curves lie over lines in the base, proving part of a conjecture by Huang,…