Breaking the 3/2 Barrier for Unit Distances in Three Dimensions

DOI10.1093/IMRN/RNX336MaRDI QIDQ5206099zbMATH OpenOpenAlexFDO

Authors J. Zahl

Publication date 18 December 2019

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

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

zbMATH Keywords

cuttingsincidencespolynomial partitioningunit distances

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Abstract: We prove that every set of $n$ points in $mathbb{R}^3$ spans $O(n^{295/197+epsilon})$ unit distances. This is an improvement over the previous bound of $O(n^{3/2})$. A key ingredient in the proof is a new result for cutting circles in $mathbb{R}^3$ into pseudo-segments.

Recommendations

• Unit distances in three dimensions
• Near optimal bounds for the Erdős distinct distances problem in high dimensions
• Erdős’s Unit Distance Problem
• An improved bound on the number of point-surface incidences in three dimensions
• Incidences between points and lines in three dimensions
• Lower Bounds for Geometric Diameter Problems
• A tight lower bound for computing the diameter of a 3D convex polytope
• Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances
• Incidences between points and lines in three dimensions
• Combinatorial complexity bounds for arrangements of curves and spheres

Cited in

(14)

• On incidences of lines in regular complexes
• A general incidence bound in \(\mathbb{R}^d\)
• Incidences between points and curves with almost two degrees of freedom
• Nondegenerate spheres in four dimensions
• Uniform distribution and geometric incidence theory
• Unit distances in three dimensions
• Angle chains and pinned variants
• Sphere tangencies, line incidences and Lie's line-sphere correspondence
• Counting and Cutting Rich Lenses in Arrangements of Circles
• On the number of discrete chains
• Erratum: “Breaking the 3/2 barrier for unit distances in three dimensions”
• Classification of maps sending lines into translates of a curve
• Almost spanning distance trees in subsets of finite vector spaces
• Almost sharp bounds on the number of discrete chains in the plane

This page was built for publication: Breaking the 3/2 Barrier for Unit Distances in Three Dimensions

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