Results

**1 - 1**of**1**### A Higher Dimensional Version of a Problem of Erdős

, 2013

"... Let {p1,..., pn} ⊆ Rd. We think of d ≪ n. How big is the largest subset X of points such that all of the distances determined by elements of () X are different? We ..."

Abstract
- Add to MetaCart

(Show Context)
Let {p1,..., pn} ⊆ Rd. We think of d ≪ n. How big is the largest subset X of points such that all of the distances determined by elements of () X are different? We