Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Memorial University of Newfoundland

$18,000.00

Graphs, Designs, Codes and Groups: Topics in Algebraic Combinatorics

EF 2021-22

Résumé
Algebraic graph theory; Combinatorial design theory; Distance-regular graphs; Error-correcting codes; Finite permutation groups; Metric dimension; Packing and covering designs; Resolvable designs; Strongly regular graphs
Programme
Discovery Grants Program - Individual
Emplacement
Newfoundland and Labrador, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2016-05397
Name nom
Bailey, Robert
Department département
School of Science & Environment, Grenfell Campus
Organization id
89
Institution établissement
Memorial University of Newfoundland
Province en
Newfoundland and Labrador
Province fr
Terre-Neuve-et-Labrador
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2021
Competition year année de concours
2016
Award amount
18000
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
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
Installment
inst:6
Partie
1
Nb partie
7
Application title
Graphs, Designs, Codes and Groups: Topics in Algebraic Combinatorics
Keyword
NSERC
Application summary
Algebraic graph theory; Combinatorial design theory; Distance-regular graphs; Error-correcting codes; Finite permutation groups; Metric dimension; Packing and covering designs; Resolvable designs; Strongly regular graphs