Condensation and densification for sets of large diameter

Abstract

Consider a set of integers $\mathcal{A}$ having finite diameter $X$, and a system of simultaneous polynomial equations to be solved over $\mathcal{A}$. In many circumstances, it is known that the number of solutions of this system is $O(X^{\epsilon }|\mathcal{A}{|}^{\theta })$ for a suitable $\theta >0$ and any $\epsilon >0$. These estimates become worse than trivial when the diameter $X$ is very large compared to $|\mathcal{A}|$, or equivalently, when the set $\mathcal{A}$ is very sparse. This motivates the problem of seeking a new set of integers $\mathcal{B}$, in a certain sense isomorphic to $\mathcal{A}$, having the property that the diameter $X^{\prime }$ of $\mathcal{B}$ is smaller than $X$, and at the same time the set $\mathcal{B}$ preserves the salient features of the solution set of the system of equations in question. We report on our speculative investigations concerning this problem closely associated with the topic of Freiman homomorphisms.

32 pages