A multi-parameter variant of the Erdos distance problem
Abstract
We study the following variant of the Erdos distance problem. Given E and F a point sets in Rd and p = (p1, …, pq) with p1+ ·s + pq = d is an increasing partition of d define Bp(E,F)=\(|x1-y1|, …, |xq-yq|): x ∈ E, y ∈ F \, where x=(x1, …, xq) with xi in Rpi. For p1 ≥ 2 it is not difficult to construct E and F such that |Bp(E,F)|=1. On the other hand, it is easy to see that if γq is the best know exponent for the distance problem in Rpi that |Bp(E,E)| ≥ C|E|γqq. The question we study is whether we can improve the exponent γqq. We first study partitions of length two in detail and prove the optimal result (up to logarithms) that |B2,2(E)| |E|. In the generalised two dimensional case for Bk,l we need the stronger condition that E is s-adaptable for s<k2+13, letting γm be the best known exponent for the Erdos-distance problem in Rm for k ≠ l we gain a further optimal result of, |Bk,l(E)| |E|γl. When k=l we use the explicit γm=m2-2m(m+2) result due to Solymosi and Vu to gain |Bk,k(E)| |E|1314γk. For a general partition, let γi = 2pi-2pi(pi+2) and ηi = 22d-(pi-1). Then if E is s-adaptable with s>d-p12+13 we have Bp(E) |E|τ 0.5cm where 0.5cm τ = γq(γ1+η1γq+(q-1)(γ1+η1)). Where pi dq implies τ γq(1q+1dq) and pq d (with q<<d) implies τ γq(1q+1q2).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.