On the number of rich lines in high dimensional real vector spaces
From MaRDI portal
Publication:309656
DOI10.1007/S00454-016-9774-6zbMATH Open1351.52016arXiv1412.7025OpenAlexW1549113609MaRDI QIDQ309656FDOQ309656
Zachary Scherr, Márton Hablicsek
Publication date: 7 September 2016
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Abstract: In this short note we use the polynomial partitioning lemma to strengthen a recent result of Dvir and Gopi about the number of rich lines in high dimensional Euclidean spaces. Our result shows that if there are sufficiently many rich lines incident to a set of points then large fraction of them must be contained in a hyperplane.
Full work available at URL: https://arxiv.org/abs/1412.7025
Recommendations
- On the number of rich lines in truly high dimensional sets
- A note on rich lines in truly high dimensional sets
- Abundance of Real Lines on Real Projective Hypersurfaces
- On rich points and incidences with restricted sets of lines in 3-space
- Distinct distance estimates and low degree polynomial partitioning
Cites Work
- On the Erdős distinct distances problem in the plane
- The Szemerédi-Trotter theorem in the complex plane
- On the Number of Incidences Between Points and Curves
- Title not available (Why is that?)
- Extremal problems in discrete geometry
- A Szemerédi-Trotter type theorem in \(\mathbb R^4\)
- A NOTE ON RICH LINES IN TRULY HIGH DIMENSIONAL SETS
- On the number of rich lines in truly high dimensional sets
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- Incidence bounds on multijoints and generic joints
Cited In (6)
This page was built for publication: On the number of rich lines in high dimensional real vector spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309656)
