Grant: Discovery Grants Program - Individual
University of Waterloo
$28,000.00
Topological generalizations of graphs
FY 2013-14
Summary
My work is in pure mathematics, typically on the boundary between combinatorics and topology. I have a long-standing interest in drawing graphs (or networks) in the plane so as to minimize the number of crossing points of edges. This is related to the design of a computer chip. Finding a drawing with a minimum number of crossings is difficult in general. Much of my work has centred on finding optimal drawings for certain special cases and trying to improve the arguments in specific cases to apply more generally.Many facts about finite networks either use proof techniques or have a form that suggests they might be applicable in much greater generality. For example, we have recently been able to describe when a member of a large class of standard topological spaces is contained in the sphere and previously characterized which such spaces are uniquely embeddable in the sphere. By pursuing this work, I hope to broaden the available methods and results from graph theorists to other mathematicians.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
41705-2009
Name nom
Richter, Bruce
Department département
Combinatorics and Optimization
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2009
Award amount
28000
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
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
5
Nb partie
5
Application title
Topological generalizations of graphs
Keyword
NSERC
Application summary
My work is in pure mathematics, typically on the boundary between combinatorics and topology. I have a long-standing interest in drawing graphs (or networks) in the plane so as to minimize the number of crossing points of edges. This is related to the design of a computer chip. Finding a drawing with a minimum number of crossings is difficult in general. Much of my work has centred on finding optimal drawings for certain special cases and trying to improve the arguments in specific cases to apply more generally.Many facts about finite networks either use proof techniques or have a form that suggests they might be applicable in much greater generality. For example, we have recently been able to describe when a member of a large class of standard topological spaces is contained in the sphere and previously characterized which such spaces are uniquely embeddable in the sphere. By pursuing this work, I hope to broaden the available methods and results from graph theorists to other mathematicians.