加载中…
A set is of type if all sums , with , , are distinct. It is well known that the largest such set is of size asymptotic to . For a set of this size we show that, under mild assumptions on the size of the modulus and on the difference (these quantities should not be too large) the elements of are uniformly distributed in the residue classes mod . Quantitative estimates on how uniform the distribution is are also provided. This generalizes recent results of Lindstr"om whose approach was combinatorial. Our main tool is an upper bound on the minimum of a cosine sum of terms, , all of whose positive integer frequencies are at most in size.

生成讲解博客的中文版本

生成AI智能校验的中文版本