Unit distances
From MaRDI portal
\textit{P. Erdős} [Am. Math. Mon. 53, 248-250 (1946; Zbl 0060.348)] asked for the maximal number f(n) of unit distances determined by n points in the plane. The authors show \(f(n)\leq n^{3/2-\epsilon},\) where \(\epsilon >0\) is independent of n; the result improves previously known bounds.
Recommendations
Cites work
Cited in
(39)- Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs
- Repeated angles in the plane and related problems
- The maximum number of second smallest distances in finite planar sets
- On the number of circles determined by \(n\) points in the Euclidean plane
- Some exact distance constants
- On point sets with many unit distances in few directions
- The maximum number of unit distances among n points in dimension four
- The maximum number of unit distances in a convex n-gon
- The unit distance problem for centrally symmetric convex polygons
- Multiplicities of interpoint distances in finite planar sets
- Erdös distance problems in normed spaces
- Unit distance graphs and algebraic integers
- A product inequality for extreme distances
- Using the subspace theorem to bound unit distances
- n points in the plane can determine \(n^{3/2}\) unit circles
- Uniform distribution and geometric incidence theory
- Erdős’s Unit Distance Problem
- Rational distances with rational angles
- Unit distances in three dimensions
- scientific article; zbMATH DE number 3884879 (Why is no real title available?)
- On the approximate unit distance problem
- scientific article; zbMATH DE number 4024175 (Why is no real title available?)
- scientific article; zbMATH DE number 1234826 (Why is no real title available?)
- scientific article; zbMATH DE number 1054773 (Why is no real title available?)
- Distance to longitude
- On unit distances in a convex polygon
- An improved constant factor for the unit distance problem
- On the number of discrete chains
- scientific article; zbMATH DE number 3893918 (Why is no real title available?)
- Unit distance problems
- Forbidden patterns and unit distances
- A note on the unit distance problem for planar configurations with \(\mathbb{Q}\)-independent direction set
- Erratum: “Breaking the 3/2 barrier for unit distances in three dimensions”
- Research problems
- The number of unit distances is almost linear for most norms
- On some non-rigid unit distance patterns
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- The number of different distances determined by n points in the plane
- Combinatorial complexity bounds for arrangements of curves and spheres
This page was built for publication: Unit distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801059)
