Grant: Discovery Grants Program - Individual
University of Manitoba
$18,000.00
Arithmetic Ramsey theory, graph theory and combinatorics
FY 2011-12
Summary
In today's fast growing world of technology, many developments have been the result of old work done in pure mathematics. For example, many modern encryption techniques are based on number theory done in the 1600's, ideas that until recently seemed to be not much more than curious properties of the counting numbers. As another example, modern transportation or communication networks are presently analyzed and optimized using basic ideas from what is known as ""graph theory"", the study of properties of structures formed using dots and lines connecting the dots. My present research proposal considers the pure mathematics underlying many of these kind of applications, however I leave the ""applying"" to other specialists. I am trying to discover more of what I consider to be beautiful properties of graphs and number theory independent of how they are utilized. It is the symmetry and inherent ""beauty"" of both number theory and graph theory, and how they relate, that forms the bulk of my research. Another area I plan to study is similar to graph theory, called lattice theory, which studies special kinds of networks that have more ""order"" and symmetry.
For example, consider prime numbers, those that have no proper divisors (e.g., 7 or 29). One can study sets of numbers that have only an even number of prime factors, and it turns out, a field called ""extremal graph theory"" plays a central role in such studies. Another area of graph theory, called ""Ramsey theory"", studies large structures and examines what kind of uniformity is preserved after such a large structure has been broken into pieces. One can solve many Ramsey-type questions using number theory, and number-theoretic results are also obtainable from Ramsey theory. My research proposes to expose more of these wonderful connections, and perhaps someday, these will also be used more in modern network theory.
Program
Discovery Grants Program - Individual
Recipient
Location
Manitoba, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
228064-2009
Name nom
Gunderson, David
Department département
Mathematics
Organization id
19
Institution établissement
University of Manitoba
Province en
Manitoba
Province fr
Manitoba
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2009
Award amount
18000
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
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
3
Nb partie
5
Application title
Arithmetic Ramsey theory, graph theory and combinatorics
Keyword
NSERC
Application summary
In today's fast growing world of technology, many developments have been the result of old work done in pure mathematics. For example, many modern encryption techniques are based on number theory done in the 1600's, ideas that until recently seemed to be not much more than curious properties of the counting numbers. As another example, modern transportation or communication networks are presently analyzed and optimized using basic ideas from what is known as ""graph theory"", the study of properties of structures formed using dots and lines connecting the dots. My present research proposal considers the pure mathematics underlying many of these kind of applications, however I leave the ""applying"" to other specialists. I am trying to discover more of what I consider to be beautiful properties of graphs and number theory independent of how they are utilized. It is the symmetry and inherent ""beauty"" of both number theory and graph theory, and how they relate, that forms the bulk of my research. Another area I plan to study is similar to graph theory, called lattice theory, which studies special kinds of networks that have more ""order"" and symmetry.
For example, consider prime numbers, those that have no proper divisors (e.g., 7 or 29). One can study sets of numbers that have only an even number of prime factors, and it turns out, a field called ""extremal graph theory"" plays a central role in such studies. Another area of graph theory, called ""Ramsey theory"", studies large structures and examines what kind of uniformity is preserved after such a large structure has been broken into pieces. One can solve many Ramsey-type questions using number theory, and number-theoretic results are also obtainable from Ramsey theory. My research proposes to expose more of these wonderful connections, and perhaps someday, these will also be used more in modern network theory.