Higher-Order Fourier Analysis Of {\mathbb{F}_{p}^n} And The Complexity Of Systems Of Linear Forms |
| |
Authors: | Hamed Hatami Shachar Lovett |
| |
Institution: | 1. School of Computer Science, McGill University, Montr??al, Canada 2. School of Mathematics, Institute for Advanced Study, Princeton, USA
|
| |
Abstract: | In this article we are interested in the density of small linear structures (e.g. arithmetic progressions) in subsets A of the group
\mathbbFpn{\mathbb{F}_{p}^n} . It is possible to express these densities as certain analytic averages involving 1
A
, the indicator function of A. In the higher-order Fourier analytic approach, the function 1
A
is decomposed as a sum f
1 + f
2 where f
1 is structured in the sense that it has a simple higher-order Fourier expansion, and f
2 is pseudo-random in the sense that the k-th Gowers uniformity norm of f
2, denoted by ||f2||Uk{\|{f_2}\|_{U^k}}, is small for a proper value of k. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|