Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Memorial University of Newfoundland

$22,000.00

Combinatorial Designs and Graph Theory

FY 2017-18

Summary
Graphs, combinatorial block designs, and their properties are the central research areas of this research proposal. Graphs can often be viewed as networks with nodes and linkages between nodes. Designs are combinatorial structures that show how to form several subsets from a larger set so that certain properties are exhibited. Designs often have application in situations in which interactions need to take place. As an analogy, a teacher might encounter the scenario of having a class of students, each of whom must be assigned to several team projects so that each pair of students is on a team together the same number of times as every other pair of students. Different team assignments lead to designs with differing attributes, some of which are desirable but may be difficult to achieve. Moreover, how to go about scheduling the teams of a given design so that they satisfy certain constraints (especially so that consecutively scheduled teams have a specific number of people in common) is one of several questions that will be studied, often by investigating mathematical properties of graphs that are associated with designs. In addition to discovering new knowledge at the abstract level, the research will contribute to work being done in areas such as algorithms, scheduling, digital communications and others. The research will also provide advanced training opportunities for students, who will acquire experience in mathematical problem solving, technical writing, and programming with parallel computing.
Program
Discovery Grants Program - Individual
Location
Newfoundland and Labrador, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
RGPIN-2016-04456
Name nom
Pike, David
Department département
Mathematics and Statistics - Mathematics and Statistics
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
2017
Competition year année de concours
2016
Award amount
22000
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
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
2
Nb partie
5
Application title
Combinatorial Designs and Graph Theory
Keyword
NSERC
Application summary
Graphs, combinatorial block designs, and their properties are the central research areas of this research proposal. Graphs can often be viewed as networks with nodes and linkages between nodes. Designs are combinatorial structures that show how to form several subsets from a larger set so that certain properties are exhibited. Designs often have application in situations in which interactions need to take place. As an analogy, a teacher might encounter the scenario of having a class of students, each of whom must be assigned to several team projects so that each pair of students is on a team together the same number of times as every other pair of students. Different team assignments lead to designs with differing attributes, some of which are desirable but may be difficult to achieve. Moreover, how to go about scheduling the teams of a given design so that they satisfy certain constraints (especially so that consecutively scheduled teams have a specific number of people in common) is one of several questions that will be studied, often by investigating mathematical properties of graphs that are associated with designs. In addition to discovering new knowledge at the abstract level, the research will contribute to work being done in areas such as algorithms, scheduling, digital communications and others. The research will also provide advanced training opportunities for students, who will acquire experience in mathematical problem solving, technical writing, and programming with parallel computing.