Equilateral sets in lpn

Noga Alon, Pavel Pudlák

Research output: Contribution to journalArticlepeer-review

27 Scopus citations


We show that for every odd integer p ≥ 1 there is an absolute positive constant cp, 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.

Original languageEnglish (US)
Pages (from-to)467-482
Number of pages16
JournalGeometric and Functional Analysis
Issue number3
StatePublished - 2003
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Analysis
  • Geometry and Topology


Dive into the research topics of 'Equilateral sets in lpn'. Together they form a unique fingerprint.

Cite this