English

Condensation and densification for sets of large diameter

Number Theory 2023-06-01 v1 Combinatorics

Abstract

Consider a set of integers A\mathscr A having finite diameter XX, and a system of simultaneous polynomial equations to be solved over A\mathscr A. In many circumstances, it is known that the number of solutions of this system is O(XϵAθ)O(X^\epsilon |\mathscr A|^\theta) for a suitable θ>0\theta>0 and any ϵ>0\epsilon>0. These estimates become worse than trivial when the diameter XX is very large compared to A|\mathscr A|, or equivalently, when the set A\mathscr A is very sparse. This motivates the problem of seeking a new set of integers B\mathscr B, in a certain sense isomorphic to A\mathscr A, having the property that the diameter XX' of B\mathscr B is smaller than XX, and at the same time the set B\mathscr 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.

Keywords

Cite

@article{arxiv.2305.19968,
  title  = {Condensation and densification for sets of large diameter},
  author = {Trevor D. Wooley},
  journal= {arXiv preprint arXiv:2305.19968},
  year   = {2023}
}

Comments

32 pages