Improved bounds for pencils of lines

DOI10.1090/PROC/14641zbMATH Open1455.52017arXiv1805.09188OpenAlexW3111492337MaRDI QIDQ5145533FDOQ5145533

Authors: Oliver Roche-Newton, Audie Warren 

Publication date: 20 January 2021

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

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.

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

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

zbMATH Keywords

pencils of \(n\) concurrent lines

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Upper bounds for centerlines
• The Elekes-Szabó problem and the uniformity conjecture
• Constructions for the Elekes-Szabó and Elekes-Rónyai problems
• 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)