Interpreting Polynomial Structure Analytically
Presenter
February 8, 2010
Keywords:
- Computer Science and Discrete Mathematics (CSDM)
Abstract
I will be describing recent joint efforts with Tim Gowers to decompose a bounded function into a sum of polynomially structured phases and a uniform error, based on the recent inverse theorem for the Uk norms on Fpn by Bergelson, Tao and Ziegler. The main innovation is the idea of defining the rank of a cubic or higher- degree polynomial (or a locally defined quadratic phase) analytically via the corresponding exponential sum, which turns out to imply all the properties of rank needed in proofs. As an application we prove a conjecture regarding the complexity of a system of linear forms that we made in 2007: A system of linear forms L1, ... , Lm on Fpn is controlled by the Uk+1 norm if and only if k is the least integer such that the functions Lik+1 are linearly independent.