科研之友
微信
新浪微博
Facebook
分享链接
摘要
A very useful fact in additive combinatorics is that analytic expressions that can be used to count the number of structures of various kinds in subsets of Abelian groups are robust under quasirandom perturbations, and moreover that quasirandomness can often be measured by means of certain easily described norms, known as uniformity norms. However, determining which uniformity norms work for which structures turns out to be a surprisingly hard question. In [GW10a] and [GW10b, GW10c], we gave a complete answer to this question for groups of the form G = F-p(n), provided p is not too small. In Z(N), substantial extra difficulties arise, of which the most important is that an "inverse theorem" even for the uniformity norm parallel to.parallel to(U3) requires a more sophisticated "local" formulation. When N is prime, Z(N) is not rich in subgroups, so one must use regular Bohr neighbourhoods instead. In this paper, we prove the first non-trivial case of the main conjecture from [GW10a]. Moreover, we obtain a doubly exponential bound.
- 出版日期2011-6
