On the Erdos distance problem
Abstract
In this paper, using the compression method, we recover the lower bound for the Erdos unit distance problem and provide an alternative proof to the distinct distance conjecture. In particular, in Rk for all k≥ 2, we have align \#\(xt,xj)∈ E⊂Rk~:~||xj-xt||=1,~1≤ t,j≤ n\≥ Ck2n1+o(1) align for some C>0. We also show that align \# \dj:dj=||xs-yt||,~dj≠ di,~1≤ s,t≤ n\≥ Dk2n2k-o(1) align for some D>0. These lower bounds generalize the lower bounds of the Erdos unit distance and the distinct distance problem to higher dimensions.
0