相关论文: Real Zeuthen numbers for two lines

We prove a correspondence theorem for singular tropical surfaces in real three space, which recovers singular algebraic surfaces in an appropriate toric three-fold that tropicalize to a given singular tropical surface. Furthermore, we…

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.…

In this paper we obtain an explicit formula for the number of curves in two dimensional complex projective space, of degree d, passing through d(d+3)/2-(k+1) generic points and having one node and one codimension k singularity, where k is…

We develop a version of Mikhalkin's lattice path algorithm for projective hypersurfaces of arbitrary degree and dimension, which enumerates singular tropical hypersurfaces passing through appropriate configuration of points. By proving a…

Welschinger's invariant bounds from below the number of real rational curves through a given generic collection of real points in the real projective plane. We estimate this invariant using Mikhalkin's approach which deals with a…

We present a construction explaining the existence of (unexpected) curves of degree $d+k$, passing through a set $Z$ of points on $\mathbb{P}^2$, and having a generic point $P$ of multiplicity $d$. The construction is based on the syzygies…

We obtain a recursive formula for the characteristic number of degree $d$ curves in $\mathbb{P}^2$ with prescribed singularities (of type $A_k$) that are tangent to a given line. The formula is in terms of the characteristic number of…

We show that the number of tropical curves of given genus and degree through some given general points in the plane does not depend on the position of the points. In the case when the degree of the curves contains only primitive integral…

We give a formula for the number of genus-two fixed-complex-structure degree-d plane curves passing through 3d-2 points in general position. This is achieved by completing Katz-Qin-Ruan's approach. This paper's formula agrees with the one…

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 study a generalization of Erd\H os's unit distances problem to chains of $k$ distances. Given $\mathcal P,$ a set of $n$ points, and a sequence of distances $(\delta_1,\ldots,\delta_k)$, we study the maximum possible number of tuples of…

Two well-studied Diophantine equations are those of Pythagorean triples and elliptic curves, for the first we have a parametrization through rational points on the unit circle, and for the second we have a structure theorem for the group of…

The classical No-Three-In-Line problem seeks the maximum number of points that may be selected from an $n\times n$ grid while avoiding a collinear triple. The maximum is well known to be linear in $n$. Following a question of Erde, we seek…

Kontsevich's formula is a recursion that calculates the number of rational degree $d$ curves in $\mathbb{P}_{\mathbb{C}}^2$ passing through $3d-1$ general positioned points. Kontsevich proved it by considering curves that satisfy extra…

Finding the so-called characteristic numbers of the complex projective plane ${\mathbb C}P^2$ is a classical problem of enumerative geometry posed by Zeuthen more than a century ago. For a given $d$ and $g$ one has to find the number of…

The Tur\'{a}n number of a graph $H$ is the maximum number of edges in any graph of order $n$ that does not contain $H$ as a subgraph. In 1959, Erd\H os and Gallai obtained a sharp upper bound of Tur\'{a}n numbers for a path of arbitrary…

Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…

Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…

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…

Since the first famous correspondence theorem by Mikhalkin appeared in 2005, tropical geometry has allowed a parallel treatment of real and complex counting problems. A prime example are the genus 0 Gromov-Witten invariants of the plane…