Grant: Discovery Grants Program - Individual
University of Calgary
$20,000.00
Geometric combinatorics and recursive space partitions
FY 2011-12
Summary
This project proposes research on several classical and recently posed
problems in discrete geometry related to so-called geometric incidences.
Erdos-type problems in discrete geometry often translate directly
into incidence problems, with the distance problems being the
flagship example. Over the last few decades, geometric incidence
theory was very productive. This is due largely to the successful
methods associated with it, such as random sampling over finite
VC-dimensional range spaces and the crossing number theory, which lead
to innumerable new discoveries. They had tremendous impact on modern
geometric algorithms and data structures, extremal combinatorics,
additive number theory, harmonic analysis, and graph theory.
Program
Discovery Grants Program - Individual
Recipient
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
355865-2008
Name nom
Toth, Csaba
Department département
Mathematics and Statistics
Organization id
11
Institution établissement
University of Calgary
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2008
Award amount
20000
Program id
RGPIN
Program nane 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
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
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
4
Nb partie
5
Application title
Geometric combinatorics and recursive space partitions
Keyword
NSERC
Application summary
This project proposes research on several classical and recently posed
problems in discrete geometry related to so-called geometric incidences.
Erdos-type problems in discrete geometry often translate directly
into incidence problems, with the distance problems being the
flagship example. Over the last few decades, geometric incidence
theory was very productive. This is due largely to the successful
methods associated with it, such as random sampling over finite
VC-dimensional range spaces and the crossing number theory, which lead
to innumerable new discoveries. They had tremendous impact on modern
geometric algorithms and data structures, extremal combinatorics,
additive number theory, harmonic analysis, and graph theory.