Near optimal bounds for the Erdős distinct distances problem in high dimensions

DOI10.1007/s00493-008-2099-1zbMath1174.52009OpenAlexW2031397195MaRDI QIDQ949786

József Solymosi, Van H. Vu

Publication date: 21 October 2008

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-008-2099-1

zbMATH Keywords

Erdős problemcombinatorial geometrycutting lemmadistinct distance problem

Mathematics Subject Classification ID

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

Related Items (20)

Zeta functions and solutions of Falconer-type problems for self-similar subsets of ℤⁿ ⋮ Distinct distances on hyperbolic surfaces ⋮ The \(k\)-resultant modulus set problem on algebraic varieties over finite fields ⋮ Nearly \(k\)-distance sets ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Finite point configurations in the plane, rigidity and Erdős problems ⋮ On distance sets and product sets in vector spaces over finite rings ⋮ The generalized Erdős-Falconer distance problems in vector spaces over finite fields ⋮ Distribution of distances in positive characteristic ⋮ On the number of incidences between points and planes in three dimensions ⋮ ON THREE-VARIABLE EXPANDERS OVER FINITE FIELDS ⋮ A reduction for the distinct distances problem in \(\mathbb{R}^d\) ⋮ A note on the number of different inner products generated by a finite set of vectors ⋮ Results on the Erdős-Falconer distance problem in \(\mathbb{Z}_q^d\) for odd \(q\) ⋮ Distance sets of two subsets of vector spaces over finite fields ⋮ Non-Degenerate Spheres in Three Dimensions ⋮ Distribution of the determinants of sums of matrices ⋮ On Falconer's distance set problem in the plane ⋮ An improved result for Falconer's distance set problem in even dimensions ⋮ Distinct Volume Subsets

Cites Work

• Unnamed Item
• Unnamed Item
• A deterministic view of random sampling and its use in geometry
• The number of different distances determined by n points in the plane
• Combinatorial complexity bounds for arrangements of curves and spheres
• The number of different distances determined by a set of points in the Euclidean plane
• On distinct sums and distinct distances.
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Distinct Distances in Three and Higher Dimensions
• On the Different Distances Determined by n Points
• On Sets of Distances of n Points
• Distinct distances in the plane

This page was built for publication: Near optimal bounds for the Erdős distinct distances problem in high dimensions