Grant: Discovery Grants Program - Individual
University of Guelph
$34,000.00
Practical combinatorial algorithms
EF 2022-23
Résumé
Combinatorial objects such as strings, permutations, trees and graphs are often used as the fundamental building blocks to model real world problems. For instance, DNA sequences can be though of as strings over a four character alphabet C,G,A,T. Routing your mobile calls in wireless networks can be modelled by paths in simple undirected graphs. Other applications that apply algorithms on combinatorial objects include: musical composition, bell-ringing, theatrics, and quantum error correcting codes. Yes, combinatorial algorithms are used in all areas of the arts and sciences! By modelling these real world problems with fundamental combinatorial objects we gain access to a wealth of mathematical knowledge that can be applied to solve the problem. A primary objective of this research program is to expand the simplicity and efficiency of algorithms for these core combinatorial objects AND to make them more accessible to other researchers. The very nature of these problems helps to achieve another objective which is to engage students at the undergraduate level and get them excited about computational problems related to fundamental mathematical objects. Mentoring and training the next generation is at the core of this research program.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
RGPIN-2018-04211
Name nom
Sawada, Joe
Department département
Computer Science, School of - Computer Science, School of
Organization id
24
Institution établissement
University of Guelph
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2022
Competition year année de concours
2018
Award amount
34000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
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
2700
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Information technology
Research subject fr
Technologie de l'information
Installment
inst:5
Partie
1
Nb partie
6
Application title
Practical combinatorial algorithms
Application summary
Combinatorial objects such as strings, permutations, trees and graphs are often used as the fundamental building blocks to model real world problems. For instance, DNA sequences can be though of as strings over a four character alphabet C,G,A,T. Routing your mobile calls in wireless networks can be modelled by paths in simple undirected graphs. Other applications that apply algorithms on combinatorial objects include: musical composition, bell-ringing, theatrics, and quantum error correcting codes. Yes, combinatorial algorithms are used in all areas of the arts and sciences! By modelling these real world problems with fundamental combinatorial objects we gain access to a wealth of mathematical knowledge that can be applied to solve the problem. A primary objective of this research program is to expand the simplicity and efficiency of algorithms for these core combinatorial objects AND to make them more accessible to other researchers. The very nature of these problems helps to achieve another objective which is to engage students at the undergraduate level and get them excited about computational problems related to fundamental mathematical objects. Mentoring and training the next generation is at the core of this research program.