The number of unit distances is almost linear for most norms
From MaRDI portal
Publication:624331
Abstract: We prove that there exists a norm in the plane under which no n-point set determines more than O(n log n log log n) unit distances. Actually, most norms have this property, in the sense that their complement is a meager set in the metric space of all norms (with the metric given by the Hausdorff distance of the unit balls).
Recommendations
Cites work
- scientific article; zbMATH DE number 3538432 (Why is no real title available?)
- scientific article; zbMATH DE number 3893918 (Why is no real title available?)
- A combinatorial distinction between the Euclidean and projective planes
- Combinatorial complexity bounds for arrangements of curves and spheres
- Convex and Discrete Geometry
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Cutting circles into pseudo-segments and improved bounds for incidences
- How Many Points Can Be Reconstructed from k Projections?
- On Sets of Distances of n Points
- Rational distances with rational angles
- Research Problems in Discrete Geometry
- Some new results on smoothness and rotundity in normed linear spaces
Cited in
(10)- On the number of discrete chains
- Few distance sets in \(\ell_p\) spaces and \(\ell_p\) product spaces
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Crescent configurations in normed spaces
- Rational distances with rational angles
- Distinct distances with \(\ell_p\) metrics
- Additive structure in convex translates
- Classification of maps sending lines into translates of a curve
- A product inequality for extreme distances
- On the pinned distances problem in positive characteristic
This page was built for publication: The number of unit distances is almost linear for most norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q624331)