On the Erdős distinct distances problem in the plane

In this paper, we prove that a set of N points in R2 has at least cNlogN distinct distances, thus obtaining the sharp exponent in a problem of Erdős. We follow the setup of Elekes and Sharir which, in the spirit of the Erlangen program, allows us to study the problem in the group of rigid motions of...

全面介紹

書目詳細資料
Main Authors: Guth, Lawrence, Katz, Nets Hawk
其他作者: Massachusetts Institute of Technology. Department of Mathematics
格式: Article
語言:en_US
出版: Princeton University Press 2015
在線閱讀:http://hdl.handle.net/1721.1/92873
https://orcid.org/0000-0002-1302-8657