On distinct distances in homogeneous sets in the Euclidean space
Abstract
A homogeneous set of n points in the d-dimensional Euclidean space determines at least (n2d/(d2+1) / c(d) n) distinct distances for a constant c(d)>0. In three-space, we slightly improve our general bound and show that a homogeneous set of n points determines at least (n.6091) distinct distances.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.