Skip to main content
Article thumbnail
Location of Repository

A Higher Dimensional Version of a Problem of Erdős

By William Gasarch, Douglas Ulrich, David G. Harris and Sam Zbarsky

Abstract

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? W

Topics: 2a−1)d
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.363.848
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.umd.edu/~gasarch... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.