Grant: Discovery Grants Program - Individual
University of Western Ontario
$24,000.00
Arrangements of Hyperplanes and Combinatorial Constructions in Topology
FY 2020-21
Summary
My research involves interactions between combinatorics and techniques from areas of algebra, topology, and geometry.
Combinatorics is a branch of mathematics which sits at the foundation of computer science and operations research. It involves the study of discrete structures as well as of counting problems. Many interesting objects in other areas of mathematics are fundamentally combinatorial in nature, so methods of combinatorics appear naturally in understanding families of "test" objects such as toric varieties and hyperplane arrangements. These can be used as accessible examples to help identify and understand general mathematical phenomena.
In a different direction, the well-developed techniques of algebra and geometry can sometimes answer combinatorial questions and offer deep reasons for observed or conjectured behaviour of objects in discrete mathematics. For example, if the answer to a counting problem is a number which in itself shows no extra structure, one might find that this number is, in fact, some evaluation of a polynomial. Perhaps the polynomial has coefficients which themselves may be interpreted as volumes of certain polyhedra, or they count the number of high-dimensional "holes" in a geometric object which could be built from the original problem. In this way, one may obtain a better understanding of a combinatorial object, by viewing it as a shadow of something with much more structure and, one hopes, properties which are better known or at least more easily analyzed.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2017-04759
Name nom
Denham, Graham
Department département
Mathematics
Organization id
36
Institution établissement
University of Western Ontario
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2020
Competition year année de concours
2017
Award amount
24000
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
Installment
inst:4-5
Partie
2
Nb partie
5
Application title
Arrangements of Hyperplanes and Combinatorial Constructions in Topology
Keyword
NSERC
Application summary
My research involves interactions between combinatorics and techniques from areas of algebra, topology, and geometry.
Combinatorics is a branch of mathematics which sits at the foundation of computer science and operations research. It involves the study of discrete structures as well as of counting problems. Many interesting objects in other areas of mathematics are fundamentally combinatorial in nature, so methods of combinatorics appear naturally in understanding families of "test" objects such as toric varieties and hyperplane arrangements. These can be used as accessible examples to help identify and understand general mathematical phenomena.
In a different direction, the well-developed techniques of algebra and geometry can sometimes answer combinatorial questions and offer deep reasons for observed or conjectured behaviour of objects in discrete mathematics. For example, if the answer to a counting problem is a number which in itself shows no extra structure, one might find that this number is, in fact, some evaluation of a polynomial. Perhaps the polynomial has coefficients which themselves may be interpreted as volumes of certain polyhedra, or they count the number of high-dimensional "holes" in a geometric object which could be built from the original problem. In this way, one may obtain a better understanding of a combinatorial object, by viewing it as a shadow of something with much more structure and, one hopes, properties which are better known or at least more easily analyzed.