Related papers: Curve Counting \`a la G\"ottsche
We prove that for every $\epsilon>0$ there exists $\delta>0$ such that the following holds. Let $\mathcal{C}$ be a collection of $n$ curves in the plane such that there are at most $(\frac{1}{4}-\epsilon)\frac{n^{2}}{2}$ pairs of curves…
Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…
In this paper we prove that, for any $n\ge 3$, there exist infinitely many $r\in \N$ and for each of them a smooth, connected curve $C_r$ in $\P^r$ such that $C_r$ lies on exactly $n$ irreducible components of the Hilbert scheme…
Recent work of Kass--Wickelgren gives an enriched count of the $27$ lines on a smooth cubic surface over arbitrary fields. Their approach using $\mathbb{A}^1$-enumerative geometry suggests that other classical enumerative problems should…
We say that a line in $\mathbb P^{n+1}_k$ is osculating to a hypersurface $Y$ if they meet with contact order $n+1$. When $k=\mathbb C$, it is known that through a fixed point of $Y$, there are exactly $n!$ of such lines. Under some parity…
We prove that the problem of counting the number of colourings of the vertices of a graph with at most two colours, such that the colour classes induce connected subgraphs is #P-complete. We also show that the closely related problem of…
In a Lombardi drawing of a graph the vertices are drawn as points and the edges are drawn as circular arcs connecting their respective endpoints. Additionally, all vertices have perfect angular resolution, i.e., all angles incident to a…
Helton and Vinnikov showed that every rigidly convex curve in the real plane bounds a spectrahedron. This leads to the computational problem of explicitly producing a symmetric (positive definite) linear determinantal representation for a…
Let V^{r}_{d,g, \delta} be the Hilbert scheme of nodal curves in P^r of degree d and arithmetic genus g with \delta nodes. Under suitable numerical assumptions on d and g, for every 0 \le \delta \le g we construct an irreducible component…
Enge and Schertz gave the method of using the double eta-quotient for the construction of elliptic curves over finite fields. In their method, it is necessary to count the number of rational points of elliptic curves corresponding to…
Let $Y$ be the complement of a plane quartic curve $D$ defined over a number field. Our main theorem confirms the Lang-Vojta conjecture for $Y$ when $D$ is a generic smooth quartic curve, by showing that its integral points are confined in…
Working over an algebraically closed field of arbitrary characteristic we study, for integers $N\geq 2$ and $g\geq 2$, the set of points of order dividing $N$ lying on an irreducible smooth proper curve of genus $g$ embedded in its jacobian…
A class of generalized Schr\"{o}dinger elliptic problems involving concave-convex and other types of nonlinearities is studied. A reasonable overview about the set of solutions is provided when the parameters involved in the equation assume…
In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials $f$, $g \in \mathbb{Z}[x,y]$ and an arbitrary polynomial $h \in…
For each integer $k \in [0,9]$, we count the number of plane cubic curves defined over a finite field $\mathbb{F}_q$ that do not share a common component and intersect in exactly $k\ \mathbb{F}_q$-rational points. We set this up as a…
We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and $G_\delta$-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to…
We prove that the enumerative geometry of lines on smooth cubic surfaces is governed by the arithmetic of the base field. In 1949, Segre proved that the number of lines on a smooth cubic surface over any field is 0, 1, 2, 3, 5, 7, 9, 15, or…
A point on a plane curve is said to be Galois (for the curve) if the projection from the point as a map from the curve to a line induces a Galois extension of function fields. It is known that the number of Galois points is finite except…
Recent advances in Quantum Topology assign $q$-series to knots in at least three different ways. The $q$-series are given by generalized Nahm sums (i.e., special $q$-hypergeometric sums) and have unknown modular and asymptotic properties.…
Let a set of nodes $\mathcal X$ in the plane be $n$-independent, i.e., each node has a fundamental polynomial of degree $n.$ Assume that $\#\mathcal X=d(n,k-3)+3= (n+1)+n+\cdots+(n-k+5)+3$ and $4 \le k\le n-1.$ In this paper we prove that…