On sets defining few ordinary lines
From MaRDI portal
Publication:368773
Abstract: 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 Dirac and Motzkin. In fact we describe the exact extremisers for this problem, as well as all sets having fewer than n - C ordinary lines for some absolute constant C. We also solve, for large n, the "orchard-planting problem", which asks for the maximum number of lines through exactly 3 points of P. Underlying these results is a structure theorem which states that if P has at most Kn ordinary lines then all but O(K) points of P lie on a cubic curve, if n is sufficiently large depending on K.
Recommendations
Cites work
- scientific article; zbMATH DE number 3425719 (Why is no real title available?)
- scientific article; zbMATH DE number 53994 (Why is no real title available?)
- scientific article; zbMATH DE number 863486 (Why is no real title available?)
- scientific article; zbMATH DE number 5060434 (Why is no real title available?)
- scientific article; zbMATH DE number 3040001 (Why is no real title available?)
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- A survey of Sylvester's problem and its generalizations
- Abschätzung der asymptotischen Dichte von Summenmengen
- Additive combinatorics
- COLLINEARITY PROPERTIES OF SETS OF POINTS
- Cayley-Bacharach theorems and conjectures
- Combinatorial geometry and its algorithmic applications. The Alcalá lectures
- Convexity and sumsets
- Cubic pencils of lines and bivariate interpolation
- Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
- Extremal problems related to the Sylvester-Gallai theorem
- Generalized principal lattices and cubic pencils
- On a question of Erdős and Moser
- On the Number of Ordinary Lines Determined by n Points
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- Sylvester's Problem on Collinear Points
- The Lines and Planes Connecting the Points of a Finite Set
- The Number of Intersection Points Made by the Diagonals of a Regular Polygon
- The orchard problem
- There exist \(6n/13\) ordinary points
Cited in
(58)- On the parameter spaces of some Böröczky configurations
- A Sylvester-Gallai result for concurrent lines in the complex plane
- scientific article; zbMATH DE number 7666855 (Why is no real title available?)
- On the usage of lines in \(GC_n\) sets
- scientific article; zbMATH DE number 7603356 (Why is no real title available?)
- Tits arrangements on cubic curves
- Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
- Model theory: combinatorics, groups, valued fields and neostability. Abstracts from the workshop held January 8--14, 2023
- On the energy variant of the sum-product conjecture
- On the existence of ordinary triangles
- Many collinear \(k\)-tuples with no \(k+1\) collinear points
- A Sylvester-Gallai theorem for cubic curves
- On sets defining few ordinary solids
- Generalizing Korchmáros-Mazzocca arcs
- Unexpected curves arising from special line arrangements
- There exist \(6n/13\) ordinary points
- Orchards in elliptic curves over finite fields
- On the number of ordinary lines determined by sets in complex space
- Real and complex supersolvable line arrangements in the projective plane
- Intersections and circuits in sets of line segments
- A pseudoline counterexample to the strong Dirac conjecture
- Joints tightened
- On the minimum number of ordinary conics
- Line arrangements with the maximal number of triple points
- Simple wedge points
- On sets defining few ordinary hyperplanes
- Nordhaus-Gaddum-type problems for lines in hypergraphs
- A greedy algorithm to compute arrangements of lines in the projective plane
- Classification theorem for strong triangle blocking arrangements
- Book review of: L. Guth, Polynomial methods in combinatorics
- On the number of ordinary lines determined by sets in complex space
- Extremal problems related to the Sylvester-Gallai theorem
- Webs of rational curves on real surfaces and a classification of real weak del Pezzo surfaces
- Incidence geometry and universality in the tropical plane
- On sets defining few ordinary planes
- A generalisation of Sylvester's problem to higher dimensions
- Bisector energy and few distinct distances
- Hirzebruch-type inequalities viewed as tools in combinatorics
- On the number of ordinary conics
- On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points
- On the geometry of real or complex supersolvable line arrangements
- On sets defining few ordinary circles
- From Pappus theorem to parameter spaces of some extremal line point configurations and applications
- Ordinary hyperspheres and spherical curves
- A \(t_k\) inequality for arrangements of pseudolines
- On the affine Sylvester problem
- Consistent sets of lines with no colorful incidence
- A theorem about vectors in \(\mathbb{R}^2\) and an algebraic proof of a conjecture of Erdős and Purdy
- Ordinary planes, coplanar quadruples, and space quartics
- Probabilities of incidence between lines and a plane curve over finite fields
- Unexpected properties of the Klein configuration of 60 points in \(\mathbb{P}^3\)
- Concyclic intervals in the plane
- On triple lines and cubic curves: the orchard problem revisited
- A structural Szemerédi-Trotter theorem for Cartesian products
- The Dirac-Goodman-Pollack conjecture
- Line arrangements with many triple points
- The generalized Sylvester's and orchard problems via discriminantal arrangement
- On the structure of pointsets with many collinear triples
This page was built for publication: On sets defining few ordinary lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368773)