Distinct distance estimates and low degree polynomial partitioning
From MaRDI portal
Publication:2340417
DOI10.1007/s00454-014-9648-8zbMath1317.52021arXiv1404.2321OpenAlexW2071141337MaRDI QIDQ2340417
Publication date: 16 April 2015
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.2321
Related Items (10)
Incidences with Curves in ℝ d ⋮ A crossing lemma for Jordan curves ⋮ Curves in \(\mathbb {R}^4\) and two-rich points ⋮ Concentration estimates for algebraic intersections ⋮ Improved Bounds for Incidences Between Points and Circles ⋮ On incidences of lines in regular complexes ⋮ A restriction estimate using polynomial partitioning ⋮ Incidences with curves in \(\mathbb{R}^d\) ⋮ Distinct distances in the complex plane ⋮ Multilevel polynomial partitions and simplified range searching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An incidence theorem in higher dimensions
- On the Erdős distinct distances problem in the plane
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- Extremal problems in discrete geometry
- Combinatorial complexity bounds for arrangements of curves and spheres
- Algebraic methods in discrete analogs of the Kakeya problem
- On lines, joints, and incidences in three dimensions
- Generalized sandwich theorems
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Incidences in Three Dimensions and Distinct Distances in the Plane
- Incidences between points and lines in three dimensions
- On the Betti Numbers of Real Varieties
- On Sets of Distances of n Points
This page was built for publication: Distinct distance estimates and low degree polynomial partitioning
