Additive combinatorics over finite fields and applications

Loosely speaking, additive combinatorics is the study of arithmetic structures within finite sets. It is an indication of the high level of activity in this research area that it has become the primary research interest for three Fields medalists (Terence Tao, Timothy Gowers, and Jean Bourgain), along with several more of the world`s most respected and decorated mathematicians (such as Ben Green, Nets Katz and Endre Szemeredi). Additive combinatorics over finite fields is particularly interesting because of its applications to computer science, cryptography, and coding theory. It is a very old area with celebrated results such as the Cauchy- Davenport theorem. Recent years have seen a flurry of activity in this area. One influential development was the work of Bourgain, Katz and Tao that shows that for a subset A of a finite field (which is not too large) either the product set AA or the sum set A+A is essentially larger than A. Since then this area has gained increasing interest. Among others we will study the following topics which are problems either coming directly from additive combinatorics or dealing with applications where methods from additive combinatorics are very promising: - sum-product and related problems - character sums with convolutions and Balog-Wooley decomposition - covering sets and packing sets, rewriting schemes and error-correction - Waring`s problem in finite fields and covering codes - sums of Lehmer numbers. We will use a collection of different methods and their combinations including - theorems from incidence geometry - character sum techniques - polynomial method - probabilistic method - linear programming - methods from algebraic geometry. This project brings together several very successful research directions which complement each other. For example, combinations of incidence geometry and character sums are very promising. We expect that the results and newly developed methods of this project will provide substantial contributions to both theory and applications.

Loosely speaking, additive combinatorics is the study of arithmetic structures within finite sets. It is an indication of the high level of activity in this research area that it has become the primary research interest for three Fields medalists (Terence Tao, Timothy Gowers, and Jean Bourgain), along with several more of the world's most respected and decorated mathematicians (such as Ben Green, Nets Katz and Endre Szemeredi). Additive combinatorics over finite fields is particularly interesting because of its applications to computer science, cryptography, and coding theory. It is a very old area with celebrated results. Recent years have seen a flurry of activity in this area. One influential development was the work of Bourgain, Katz and Tao that shows that for a subset A of a finite field (which is not too large) either the product set A* A={ab:a,b in A} or the sum set A+A={a+b:a,b in A} is essentially larger than A. Since then this area has gained increasing interest. Among others we studied the following topics which are problems either coming directly from additive combinatorics or dealing with applications where methods from additive combinatorics were used: - sum-product and related problems, - character sums with convolutions and Balog-Wooley decomposition, - packing sets and error-correction, - Kakeya-like problems. We used a collection of different methods and their combinations including - theorems from incidence geometry, - character sum techniques, - polynomial methods, - methods from algebraic geometry. https://www.oeaw.ac.at/ricam/research/projects/p30405-n32