Linear forms and quadratic uniformity for functions on
arXiv:1002.2210 · doi:10.1007/s11854-011-0026-7
Abstract
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 [GW09a] and [GW09b, GW09c] we gave a complete answer to this question for groups of the form , provided is not too small. In , substantial extra difficulties arise, of which the most important is that an "inverse theorem" even for the uniformity norm requires a more sophisticated (local) formulation. When is prime, 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 [GW09a].
arXiv comment66 pages
References in corpus (7)
- The true complexity of a system of linear equations
- Linear forms and higher-degree uniformity for functions on
- The inverse conjecture for the Gowers norm over finite fields via the correspondence principle
- An inverse theorem for the uniformity seminorms associated with the action of
- A quantitative version of the idempotent theorem in harmonic analysis
- Linear forms and quadratic uniformity for functions on
- New bounds for Szemeredi's Theorem, I: Progressions of length 4 in finite field geometries