On the approximate unit distance problem

DOI10.1007/978-3-030-32353-0_5MaRDI QIDQ3294767zbMATH OpenOpenAlexFDO

Authors Alex Iosevich

Publication date 29 June 2020

Published in New Trends in Applied Harmonic Analysis, Volume 2 (Search for Journal in Brave)

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

zbMATH Keywords

discrete \(s\)-energyhomogeneous point setunit distance problemwell-distributed point set

Mathematics Subject Classification ID

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

Abstract: The ErdH os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $leq{C}_{epsilon}{n}^{1+epsilon}$ for any $epsilon>0$. The best known bound is $C{n}^{frac43}$. We show that if the set under consideration is well-distributed and the fixed distance is much smaller than the diameter of the set, then the exponent $frac43$ is significantly improved. Corresponding results are also established in higher dimensions. The results are obtained by solving the corresponding continuous problem and using a continuous-to-discrete conversion mechanism. The degree of sharpness of results is tested using the known results on the distribution of lattice points dilates of convex domains. We also introduce the following variant of the ErdH os unit distance problem: how many pairs of points from a set of size $n$ are separated by an integer distance? We obtain some results in this direction and formulate a conjecture.

Recommendations

• Erdős’s Unit Distance Problem
• Unit distances
• An improved constant factor for the unit distance problem
• scientific article; zbMATH DE number 3893918
• Unit distance problems

Cites work

• K-distance sets, Falconer conjecture, and discrete analogs
• Circular averages and Falconer/Erdös distance conjecture in the plane for random metrics
• Exponential Sums and Lattice Points III
• Fourier analysis and geometric combinatorics
• Fourier analysis and Hausdorff dimension
• Geometric incidence theorems via Fourier analysis
• scientific article; zbMATH DE number 3769711 (Why is no real title available?)
• scientific article; zbMATH DE number 1305358 (Why is no real title available?)
• scientific article; zbMATH DE number 928873 (Why is no real title available?)
• scientific article; zbMATH DE number 3893918 (Why is no real title available?)
• Lectures on number theory. Vol. 1, part 2, Vol. 2, Vol. 3
• On Sets of Distances of n Points
• On the Hausdorff dimensions of distance sets
• Research Problems in Discrete Geometry
• Sharpness of Falconer's (d+1)/2 estimate
• Theory of Dimension for Large Discrete Sets and Applications

Cited in

(16)

• A product inequality for extreme distances
• The distance matching problem
• Using the subspace theorem to bound unit distances
• Uniform distribution and geometric incidence theory
• Erdős’s Unit Distance Problem
• Favorite distances in high dimensions
• Rational distances with rational angles
• On sets containing a unit distance in every direction
• scientific article; zbMATH DE number 1234826 (Why is no real title available?)
• scientific article; zbMATH DE number 2145248 (Why is no real title available?)
• An improved constant factor for the unit distance problem
• Unit distance problems
• A note on the unit distance problem for planar configurations with \(\mathbb{Q}\)-independent direction set
• The number of unit distances is almost linear for most norms
• On some non-rigid unit distance patterns
• Unit distances

This page was built for publication: On the approximate unit distance problem

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