Unit Distance Problems
Classical Analysis and ODEs
2012-10-01 v1
Abstract
We study some discrete and continuous variants of the following problem of Erdos: given a finite subset P of R^2 or R^3, what is the maximum number of pairs (p_1,p_2) with p_1,p_2 in P and |p_1 -p_2 |=1?
Keywords
Cite
@article{arxiv.1209.6537,
title = {Unit Distance Problems},
author = {Daniel Oberlin and Richard Oberlin},
journal= {arXiv preprint arXiv:1209.6537},
year = {2012}
}