Equilateral Sets in lpn
- 66 Downloads
We show that for every odd integer p ≥1 there is an absolute positive constantcp, so that the maximum cardinality of a set of vectors in Rn such that the lp distance between any pair is precisely 1, is at most cpn log n. We prove some upper bounds for other lp norms as well.
Unable to display preview. Download preview PDF.