Grant: Discovery Grants Program - Individual
University of British Columbia
$32,000.00
Problems in additive combinatorics
FY 2012-13
Summary
My main field of research is in Additive Combinatorics. The central problem of the area is to characterize additive or multiplicative structures. I am especially interested in the ""incompatibility"" of multiplicative and additive structures. An old conjecture of Erdos and Szemeredi states that if A is a finite set of integers then the sum-set or the product-set should be large. The sum-set of A is defined as A+A={a+b | a,b \in A} and the product set is A*A={ab | a,b \in A}. Erdos and Szemeredi conjectured that the sum-set or the product set is almost quadratic in the size of A, i.e. |A+A|+|A*A|~|A||A|. The best known lower bound on the quantity |A+A|+|A*A| follows from an earlier work of mine, however it is still very far from the conjecture. The same problem was considered by Bourgain, Katz, and Tao, for the finite field case. Their result has important applications , not only to number theory, but to computer science, Ramsey theory, and cryptography. It turned out that methods from discrete geometry can be used efficiently not only for the real/complex case but for the finite field case as well.
Another major focus of my work in additive combinatorics is Szemeredi's theorem and variants. Szemeredi proved in 1970 that every dense subset of integers contains arbitrary long arithmetic progressions. His famous theorem was reproved and extended by Furstenberg, Gowers, Rodl et al., and Tao. The most famous variant of Szemeredi's theorem is a recent result of Green and Tao, they proved that the primes contain arbitrary long arithmetic progressions. Earlier, I used the so called Removal Lemma to prove a multidimensional variant of Szemeredi's theorem which had only ergodic proof before. In my future work I want extend the combinatorial methods to prove furter extensions which have only ergodic proofs now.
Program
Discovery Grants Program - Individual
Recipient
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
261014-2008
Name nom
Solymosi, Jozsef
Department département
Mathematics
Organization id
2
Institution établissement
University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2008
Award amount
32000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
337
Committee name en
Pure & Applied Maths - B
Committee name fr
Maths pures et appliquées - B
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2914
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Combinatorics
Research subject fr
Combinatoire
Partie
5
Nb partie
5
Application title
Problems in additive combinatorics
Keyword
NSERC
Application summary
My main field of research is in Additive Combinatorics. The central problem of the area is to characterize additive or multiplicative structures. I am especially interested in the ""incompatibility"" of multiplicative and additive structures. An old conjecture of Erdos and Szemeredi states that if A is a finite set of integers then the sum-set or the product-set should be large. The sum-set of A is defined as A+A={a+b | a,b \in A} and the product set is A*A={ab | a,b \in A}. Erdos and Szemeredi conjectured that the sum-set or the product set is almost quadratic in the size of A, i.e. |A+A|+|A*A|~|A||A|. The best known lower bound on the quantity |A+A|+|A*A| follows from an earlier work of mine, however it is still very far from the conjecture. The same problem was considered by Bourgain, Katz, and Tao, for the finite field case. Their result has important applications , not only to number theory, but to computer science, Ramsey theory, and cryptography. It turned out that methods from discrete geometry can be used efficiently not only for the real/complex case but for the finite field case as well.
Another major focus of my work in additive combinatorics is Szemeredi's theorem and variants. Szemeredi proved in 1970 that every dense subset of integers contains arbitrary long arithmetic progressions. His famous theorem was reproved and extended by Furstenberg, Gowers, Rodl et al., and Tao. The most famous variant of Szemeredi's theorem is a recent result of Green and Tao, they proved that the primes contain arbitrary long arithmetic progressions. Earlier, I used the so called Removal Lemma to prove a multidimensional variant of Szemeredi's theorem which had only ergodic proof before. In my future work I want extend the combinatorial methods to prove furter extensions which have only ergodic proofs now.