Linear forms and higher-degree uniformity for functions on Fpn
Abstract
In [GW09a] we conjectured that uniformity of degree k-1 is sufficient to control an average over a family of linear forms if and only if the kth powers of these linear forms are linearly independent. In this paper we prove this conjecture in Fpn, provided only that p is sufficiently large. This result represents one of the first applications of the recent inverse theorem for the Uk norm over Fpn by Bergelson, Tao and Ziegler [BTZ09,TZ08]. We combine this result with some abstract arguments in order to prove that a bounded function can be expressed as a sum of polynomial phases and a part that is small in the appropriate uniformity norm. The precise form of this decomposition theorem is critical to our proof, and the theorem itself may be of independent interest.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.