On the number of rich lines in high dimensional real vector spaces
From MaRDI portal
(Redirected from Publication:309656)
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.
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
- scientific article; zbMATH DE number 2145246 (Why is no real title available?)
- A Szemerédi-Trotter type theorem in R^4
- A note on rich lines in truly high dimensional sets
- Extremal problems in discrete geometry
- Incidence bounds on multijoints and generic joints
- On the Erdős distinct distances problem in the plane
- On the Number of Incidences Between Points and Curves
- 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
- The Szemerédi-Trotter theorem in the complex plane
Cited in
(7)- Incidences with curves in \(\mathbb{R}^d\)
- On the number of rich lines in truly high dimensional sets
- Incidences with curves in \(\mathbb{R}^{d}\)
- A note on rich lines in truly high dimensional sets
- Concentration estimates for algebraic intersections
- Incidences between points and lines in \({\mathbb {R}}^4\)
- Long lines in subsets of large measure in high dimension
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)
