Improved bounds for pencils of lines

DOI10.1090/PROC/14641MaRDI QIDQ5145533zbMATH OpenOpenAlexFDO

Authors Oliver Roche-Newton, Audie Warren

Publication date 20 January 2021

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

pencils of \(n\) concurrent lines

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Erd?s problems and related topics of discrete geometry (52C10)

Abstract: We consider a question raised by Rudnev: given four pencils of $n$ concurrent lines in $mathbb{R}^2$, with the four centres of the pencils non-collinear, what is the maximum possible size of the set of points where four lines meet? Our main result states that the number of such points is $O(n^{11/6})$, improving a result of Chang and Solymosi. We also consider constructions for this problem. Alon, Ruzsa and Solymosi constructed an arrangement of four non-collinear $n$-pencils which determine $Omega(n^{3/2})$ four-rich points. We give a construction to show that this is not tight, improving this lower bound by a logarithmic factor. We also give a construction of a set of $m$ $n$-pencils, whose centres are in general position, that determine $Omeg{a}_m(n^{3/2})$ $m$-rich points.

Recommendations

• On rich points and incidences with restricted sets of lines in 3-space
• scientific article; zbMATH DE number 4015582
• Incidences between points and lines in \({\mathbb {R}}^4\)
• Tight bounds on a problem of lines and intersections
• Curves in \(\mathbb {R}^4\) and two-rich points

Cites work

• A Szemerédi-Trotter type theorem in R^4
• An improved point-line incidence bound over arbitrary fields
• Constructions for the Elekes-Szabó and Elekes-Rónyai problems
• How to find groups?
• On the number of sums and products
• On the size of the set A(A + 1)
• Polynomials vanishing on Cartesian products: the Elekes-Szabó theorem revisited
• Sum-product theorems and incidence geometry
• Sums, products, and ratios along the edges of a graph
• The distribution of integers with a divisor in a given interval
• The Szemerédi-Trotter theorem in the complex plane

Cited in

(4)

• The Elekes-Szabó problem and the uniformity conjecture
• Constructions for the Elekes-Szabó and Elekes-Rónyai problems
• Upper bounds for centerlines
• An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants

This page was built for publication: Improved bounds for pencils of lines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145533)