Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Research Tools and Instruments - Category 1 (<$150,000)

University of Victoria

$38,356.00

Distributed obstruction finding and fullerene research

FY 2007-08

Summary
The equipment requested includes workstations for graduate and undergraduate students which will be publically available in our theory lab and some processors without monitors to enable extensive distributed computations for two research problems.One of the most famous theorem in graph theory is Kuratowski's theorem: if a graph cannot be drawn on a plane with no crossing lines then it must contain a subgraph homeomorphic to one of two graphs. One major ongoing goal of my research program is to find a similar theorem for a torus (a surface shaped like a doughnut). Extra computational resources would greatly facilitate searching for these and the ultimate goal of finding a computer-aided proof that the set of obstructions we have found is complete. Having a complete set of obstructions could be used to prove theorems about toroidal graphs and would give insight as to how to design simple, fast algorithms for drawing pictures of them.Fullerenes are all-carbon molecules whose structures are 3-regular planar graphs with face sizes five or six. We have developed a program, FuiGui to aid in the visualization of these molecules and their parameters. Our goal is to amass a large database of parameter information for all the small fullerenes in order to investigate correlations between these parameters and important chemical properties of fullerenes. Extra computational facilities are critical for collecting this data in a reasonable amount of time.
Program
Research Tools and Instruments - Category 1 (<$150,000)
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
360290-2008
Name nom
Myrvold, Wendy
Department département
Computer Science
Organization id
7
Institution établissement
University of Victoria
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2007
Competition year année de concours
2008
Award amount
38356
Program id
EQPEQ
Program name en
Research Tools and Instruments - Category 1 (<$150,000)
Program name fr
Outils et instruments de recherche - catégorie 1 (<150 000$)
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - 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
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
1
Nb partie
1
Application title
Distributed obstruction finding and fullerene research
Keyword
NA
Application summary
The equipment requested includes workstations for graduate and undergraduate students which will be publically available in our theory lab and some processors without monitors to enable extensive distributed computations for two research problems.One of the most famous theorem in graph theory is Kuratowski's theorem: if a graph cannot be drawn on a plane with no crossing lines then it must contain a subgraph homeomorphic to one of two graphs. One major ongoing goal of my research program is to find a similar theorem for a torus (a surface shaped like a doughnut). Extra computational resources would greatly facilitate searching for these and the ultimate goal of finding a computer-aided proof that the set of obstructions we have found is complete. Having a complete set of obstructions could be used to prove theorems about toroidal graphs and would give insight as to how to design simple, fast algorithms for drawing pictures of them.Fullerenes are all-carbon molecules whose structures are 3-regular planar graphs with face sizes five or six. We have developed a program, FuiGui to aid in the visualization of these molecules and their parameters. Our goal is to amass a large database of parameter information for all the small fullerenes in order to investigate correlations between these parameters and important chemical properties of fullerenes. Extra computational facilities are critical for collecting this data in a reasonable amount of time.