Condensation and densification for sets of large diameter
Abstract
Consider a set of integers having finite diameter , and a system of simultaneous polynomial equations to be solved over . In many circumstances, it is known that the number of solutions of this system is for a suitable and any . These estimates become worse than trivial when the diameter is very large compared to , or equivalently, when the set is very sparse. This motivates the problem of seeking a new set of integers , in a certain sense isomorphic to , having the property that the diameter of is smaller than , and at the same time the set 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