Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of British Columbia

$29,000.00

Additive Combinatorics

FY 2013-14

Summary
My primary field of research is additive combinatorics. This relatively new area of mathematics is concerned about the additive or multiplicative structure of subsets of groups with small sumset or product set. The sumset of a set is formed by the pairwise sums of elements of the set. (In a product set we take the pairwise products.) Additive combinatorics has strong connections to number theory, harmonic analysis, ergodic theory, and theoretical computer science. I am interested in the geometry behind some of the problems in additive combinatorics. It is often the case that a problem in additive combinatorics can be translated to a question about curve-point incidences in a plane over some field. A classical example is the so called ""sum-product problem"". An arithmetic progression has a small sumset and a geometric progression has small product set, but the arithmetic and geometric progressions have very different structure. Is it possible to find a set with small sumset and small product set at the same time? The answer very much depends on the underlying field or ring. A subfield of a finite field has very small sumset and product set but the same is not possible over fields with characteristic zero or when the set is ""very far"" from a subfield. The general problem is called the ""sum-product phenomenon"". Surprisingly the problem can be translated to bounding the number of incidences between points and lines in the plane defined over the field. Understanding such connections and giving efficient bounds on the number of point-curve incidences is a central part of this research proposal. Such results would have important applications not only to other fields of mathematics but to computer science as well.
Program
Discovery Grants Program - Individual
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
261014-2013
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
2013
Competition year année de concours
2013
Award amount
29000
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
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
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
1
Nb partie
5
Application title
Additive Combinatorics
Keyword
NSERC
Application summary
My primary field of research is additive combinatorics. This relatively new area of mathematics is concerned about the additive or multiplicative structure of subsets of groups with small sumset or product set. The sumset of a set is formed by the pairwise sums of elements of the set. (In a product set we take the pairwise products.) Additive combinatorics has strong connections to number theory, harmonic analysis, ergodic theory, and theoretical computer science. I am interested in the geometry behind some of the problems in additive combinatorics. It is often the case that a problem in additive combinatorics can be translated to a question about curve-point incidences in a plane over some field. A classical example is the so called ""sum-product problem"". An arithmetic progression has a small sumset and a geometric progression has small product set, but the arithmetic and geometric progressions have very different structure. Is it possible to find a set with small sumset and small product set at the same time? The answer very much depends on the underlying field or ring. A subfield of a finite field has very small sumset and product set but the same is not possible over fields with characteristic zero or when the set is ""very far"" from a subfield. The general problem is called the ""sum-product phenomenon"". Surprisingly the problem can be translated to bounding the number of incidences between points and lines in the plane defined over the field. Understanding such connections and giving efficient bounds on the number of point-curve incidences is a central part of this research proposal. Such results would have important applications not only to other fields of mathematics but to computer science as well.