On sets defining few ordinary lines

DOI10.1007/s00454-013-9518-9zbMath1309.51002arXiv1208.4714OpenAlexW2053849387WikidataQ55953877 ScholiaQ55953877MaRDI QIDQ368773

Ben Green, Terence C. Tao

Publication date: 23 September 2013

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.4714

zbMATH Keywords

Dirac-Motzkin conjecturecubic curvesorchard-planting problemordinary linesSylvester-Gallai theorem

Mathematics Subject Classification ID

Linear algebraic groups over finite fields (20G40) Other designs, configurations (05B30) Incidence structures embeddable into projective geometries (51A45) Configuration theorems in linear incidence geometry (51A20)

Related Items

A Sylvester-Gallai theorem for cubic curves ⋮ Bisector energy and few distinct distances ⋮ Line arrangements with the maximal number of triple points ⋮ Book review of: L. Guth, Polynomial methods in combinatorics ⋮ On the parameter spaces of some Böröczky configurations ⋮ Ordinary hyperspheres and spherical curves ⋮ Many collinear \(k\)-tuples with no \(k+1\) collinear points ⋮ On the energy variant of the sum-product conjecture ⋮ A generalisation of Sylvester's problem to higher dimensions ⋮ A greedy algorithm to compute arrangements of lines in the projective plane ⋮ A Sylvester-Gallai result for concurrent lines in the complex plane ⋮ On the number of ordinary lines determined by sets in complex space ⋮ A pseudoline counterexample to the strong Dirac conjecture ⋮ Model theory: combinatorics, groups, valued fields and neostability. Abstracts from the workshop held January 8--14, 2023 ⋮ Nordhaus-Gaddum-type problems for lines in hypergraphs ⋮ On the existence of ordinary triangles ⋮ A structural Szemerédi-Trotter theorem for Cartesian products ⋮ Joints tightened ⋮ On sets defining few ordinary circles ⋮ Unnamed Item ⋮ On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points ⋮ Unnamed Item ⋮ Hirzebruch-type inequalities viewed as tools in combinatorics ⋮ Unnamed Item ⋮ Orchards in elliptic curves over finite fields ⋮ Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory ⋮ From Pappus theorem to parameter spaces of some extremal line point configurations and applications ⋮ On the minimum number of ordinary conics ⋮ Consistent sets of lines with no colorful incidence ⋮ On sets defining few ordinary planes ⋮ Incidence geometry and universality in the tropical plane ⋮ On sets defining few ordinary hyperplanes ⋮ On the geometry of real or complex supersolvable line arrangements ⋮ On sets defining few ordinary solids ⋮ Tits arrangements on cubic curves ⋮ Probabilities of incidence between lines and a plane curve over finite fields ⋮ Ordinary planes, coplanar quadruples, and space quartics ⋮ Real and complex supersolvable line arrangements in the projective plane ⋮ Unexpected curves arising from special line arrangements ⋮ On the Number of Ordinary Conics ⋮ Generalizing Korchmáros-Mazzocca arcs ⋮ Classification theorem for strong triangle blocking arrangements ⋮ Webs of rational curves on real surfaces and a classification of real weak del Pezzo surfaces ⋮ Intersections and circuits in sets of line segments ⋮ A \(t_k\) inequality for arrangements of pseudolines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Cubic pencils of lines and bivariate interpolation
• There exist \(6n/13\) ordinary points
• The orchard problem
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• Convexity and sumsets
• On a question of Erdős and Moser
• A survey of Sylvester's problem and its generalizations
• Generalized principal lattices and cubic pencils
• Abschätzung der asymptotischen Dichte von Summenmengen
• Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
• On the Number of Ordinary Lines Determined by n Points
• The Number of Intersection Points Made by the Diagonals of a Regular Polygon
• Cayley-Bacharach theorems and conjectures
• Sylvester's Problem on Collinear Points
• COLLINEARITY PROPERTIES OF SETS OF POINTS
• The Lines and Planes Connecting the Points of a Finite Set