A multi-parameter variant of the Erdős distance problem
arXiv:1712.04060
Abstract
We study the following variant of the Erdős distance problem. Given and a point sets in and with is an increasing partition of define where with in . For it is not difficult to construct and such that . On the other hand, it is easy to see that if is the best know exponent for the distance problem in that . The question we study is whether we can improve the exponent . We first study partitions of length two in detail and prove the optimal result (up to logarithms) that In the generalised two dimensional case for we need the stronger condition that is -adaptable for , letting be the best known exponent for the Erdős-distance problem in for we gain a further optimal result of, When we use the explicit result due to Solymosi and Vu to gain For a general partition, let and . Then if is -adaptable with we have Where implies and (with ) implies .
19 Pages