Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Simon Fraser University

$11,000.00

Topical Studies in Graph and Matroid Theory

EF 2017-18

Résumé
Graphs are mathematical abstractions which are used to model structures exhibiting a ""discrete"" nature. Examples include communication and transportation networks, crew scheduling, vehicle routing, computer chip design and digital devices. Matroids are structures which are more abstract than graphs, which are vital to the understanding of geometry, rigidity, and good algorithms for optimization problems. My research seeks to understand fundamental properties of such structures, with an aim toward optimizing various parameters of interest. For example, the problem of assigning shows to venues at a film festival can be modeled as a type of graph colouring problem. Advances in our knowledge can lead to improved scheduling algorithms. With the advent of digital communication such studies are vital to the efficient design and deployment of arising technologies. In more technical language, three of the projects comprising this proposal are as follows.- Few Long Lists for Edge Choosability: For graphs that can be embedded in the plane, the problem is to find a selection of colours for the edges, from preassigned lists, that avoid colour conflicts.- Colouring Oriented Matroids: The notion of graph colouring can be extended to geometric objects in two different ways. We compare properties of the two extensions, and the information that they carry.- Classification of Triangulated Surfaces with Few High-degree Vertices: Triangulated surfaces are central to computer rendering of surfaces. We investigate certain classes of such surfaces which deviate only slightly from canonical triangulations, where six edges meet at each vertex.
Programme
Discovery Grants Program - Individual
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
105452-2013
Name nom
Goddyn, Luis
Department département
Mathematics
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2017
Competition year année de concours
2013
Award amount
11000
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
Partie
5
Nb partie
5
Application title
Topical Studies in Graph and Matroid Theory
Keyword
NSERC
Application summary
Graphs are mathematical abstractions which are used to model structures exhibiting a ""discrete"" nature. Examples include communication and transportation networks, crew scheduling, vehicle routing, computer chip design and digital devices. Matroids are structures which are more abstract than graphs, which are vital to the understanding of geometry, rigidity, and good algorithms for optimization problems. My research seeks to understand fundamental properties of such structures, with an aim toward optimizing various parameters of interest. For example, the problem of assigning shows to venues at a film festival can be modeled as a type of graph colouring problem. Advances in our knowledge can lead to improved scheduling algorithms. With the advent of digital communication such studies are vital to the efficient design and deployment of arising technologies. In more technical language, three of the projects comprising this proposal are as follows.- Few Long Lists for Edge Choosability: For graphs that can be embedded in the plane, the problem is to find a selection of colours for the edges, from preassigned lists, that avoid colour conflicts.- Colouring Oriented Matroids: The notion of graph colouring can be extended to geometric objects in two different ways. We compare properties of the two extensions, and the information that they carry.- Classification of Triangulated Surfaces with Few High-degree Vertices: Triangulated surfaces are central to computer rendering of surfaces. We investigate certain classes of such surfaces which deviate only slightly from canonical triangulations, where six edges meet at each vertex.