English
Related papers

Related papers: Ordinary planes, coplanar quadruples, and space qu…

200 papers

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…

Combinatorics · Mathematics 2013-02-26 György Elekes , Endre Szabó

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…

Algebraic Geometry · Mathematics 2007-05-23 Aleksey Zinger

The Sylvester-Gallai theorem states that for a finite set of points in the plane, if every line determined by any two of these points also contains a third, then the set is necessarily made of collinear points. In this paper, we first…

Combinatorics · Mathematics 2025-12-17 Imre Barany , Julia Q. Du , Dan Schwarz , Liping Yuan , Tudor Zamfirescu

A rational distance set in the plane is a point set which has the property that all pairwise distances between its points are rational. Erd\H os and Ulam conjectured in 1945 that there is no dense rational distance set in the plane. In this…

Number Theory · Mathematics 2018-04-23 Jafar Shaffaf

In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…

Algebraic Geometry · Mathematics 2026-04-15 Simone Marchesi , Jean Vallès

We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general…

Computational Geometry · Computer Science 2011-11-10 Mridul Aanjaneya , Monique Teillaud

We present some elementary ideas to prove the following Sylvester-Gallai type theorems involving incidences between points and lines in the planes over the complex numbers and quaternions. (1) Let A and B be finite sets of at least two…

Combinatorics · Mathematics 2009-03-12 Jozsef Solymosi , Konrad J. Swanepoel

We describe a method to show a plane quartic over a number field has no rational points. The method can be adapted to show that a curve does not have divisors of degree 1 or 2 and can be generalized to arbitrary smooth projective curves.…

Number Theory · Mathematics 2026-05-15 Nils Bruin , Brendan Creutz

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…

Number Theory · Mathematics 2017-05-12 Nazar Arakelian

We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set P of n points determines o(n) distinct distances, then no line contains \Omega(n^{7/8}) points of P and no…

Combinatorics · Mathematics 2013-08-27 Adam Sheffer , Joshua Zahl , Frank de Zeeuw

We study the geometry of spaces of planes on smooth complete intersections of three quadrics, with a view toward rationality questions.

Algebraic Geometry · Mathematics 2019-04-15 Brendan Hassett , Yuri Tschinkel

We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…

Computational Geometry · Computer Science 2020-09-30 Boris Aronov , Esther Ezra , Micha Sharir

Given a rank 3 real arrangement $\mathcal A$ of $n$ lines in the projective plane, the Dirac-Motzkin conjecture (proved by Green and Tao in 2013) states that for $n$ sufficiently large, the number of simple intersection points of $\mathcal…

Combinatorics · Mathematics 2015-05-12 Benjamin Anzis , Stefan Tohaneanu

We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three classes of the 3-net comprises concurrent lines, and irregular…

Combinatorics · Mathematics 2009-11-23 Aart Blokhuis , Gábor Korchmáros , Francesco Mazzocca

The computation of the dimension of linear systems of plane curves through a bunch of given multiple points is one of the most classic issues in Algebraic Geometry. In general, it is still an open problem to understand when the points fail…

Algebraic Geometry · Mathematics 2020-04-07 Łucja Farnik , Francesco Galuppi , Luca Sodomaco , William Trok

Let V be a finite set of points in the plane, not contained in a line. Assume |V| = n is an odd number, and |L \cap V| \leq 3 for every line L which is spanned by V. We prove that every simple line L_{a,b} in V creates a simple wedge (i.e.,…

Combinatorics · Mathematics 2012-09-10 Shimon Garti

We study the geometry of quintic threefolds $X\subset \mathbb{P}^4$ with only ordinary triple points as singularities. In particular, we show that if a quintic threefold $X$ has a reducible hyperplane section then $X$ has at most $10$…

Algebraic Geometry · Mathematics 2019-11-13 Remke Kloosterman , Slawomir Rams

Every polygon with n vertices in the complex projective plane is naturally associated with its adjoint curve of degree n-3. Hence the adjoint of a heptagon is a plane quartic. We prove that a general plane quartic is the adjoint of exactly…

Algebraic Geometry · Mathematics 2024-08-29 Daniele Agostini , Daniel Plaumann , Rainer Sinn , Jannik Lennart Wesner

Let $P$ be a set of $n$ points in the plane, each point moving along a given trajectory. A {\em $k$-collinearity} is a pair $(L,t)$ of a line $L$ and a time $t$ such that $L$ contains at least $k$ points at time $t$, the points along $L$ do…

Computational Geometry · Computer Science 2011-05-17 Ben D. Lund , George B. Purdy , Justin W. Smith , Csaba D. Tóth

We give a practical formula for counting irreducible nodal genus-three plane curves that a fixed generic complex structure on the normalization. As an intermediate step, we enumerate rational plane curves that have a $(3,4)$-cusp.

Symplectic Geometry · Mathematics 2007-05-23 A. Zinger