Grant: Discovery Grants Program - Individual
University of Victoria
$23,300.00
Algebraic and analytical methods in design theroy
EF 2012-13
Résumé
Combinatorial designs are mathematical structures (normally involving finite sets or sequences) which enjoy abundant applications in modern industry. The disciplines which most frequently use combinatorial designs are: (1) statistics, for the design of experiments; (2) electrical engineering, for the scheduling and error-correction in communication networks; (3) computer science, for hardware design and software testing; and (4) bioinformatics, for efficiency in searching and sequencing genes.
A typical mathematical constraint in most combinatorial designs is that of balanced pair coverage. For instance, consider seven objects. Can we create seven groups of three things each so that each pair appears in one of these? The answer turns out to be yes, via an object known as the Fano plane. It is fairly intuitive that the balanced pair property yields some desirable effects. In the above example, one viewpoint is of condensed storage for all possible pairs. In another sense, the design approximates the (much larger) set of all triples.
The questions considered by researchers in combinatorics broadly fall into three categories: existence/construction, enumeration/generation, and non-existence/structure. For design-theorists, the first two categories amount to: ""does a certain combinatorial design exist, and if so, how many are there?""
While satisfactory progress has been made on these questions, it can be said that non-existence or structural results perhaps lag slightly behind in design theory.
One of the themes of my research program (and a central component of this proposal) is a careful study of when certain designs cannot exist. Along the same lines, knowing that a design does exist, then my interest is in determining additional structure that must be present. Although these kind of investigations seem at first glance to be hoping for ""negative"" answers, they are actually very valuable. For, given the vast search space for combinatorial structures, knowing where not to look is immensely useful. Hence, algorithms for constructing designs are improved, and ideas for modifying the design conditions are born.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
312595-2010
Name nom
Dukes, Peter
Department département
Mathematics and Statistics
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
2012
Competition year année de concours
2010
Award amount
23300
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
3
Nb partie
5
Application title
Algebraic and analytical methods in design theroy
Keyword
NSERC
Application summary
Combinatorial designs are mathematical structures (normally involving finite sets or sequences) which enjoy abundant applications in modern industry. The disciplines which most frequently use combinatorial designs are: (1) statistics, for the design of experiments; (2) electrical engineering, for the scheduling and error-correction in communication networks; (3) computer science, for hardware design and software testing; and (4) bioinformatics, for efficiency in searching and sequencing genes.
A typical mathematical constraint in most combinatorial designs is that of balanced pair coverage. For instance, consider seven objects. Can we create seven groups of three things each so that each pair appears in one of these? The answer turns out to be yes, via an object known as the Fano plane. It is fairly intuitive that the balanced pair property yields some desirable effects. In the above example, one viewpoint is of condensed storage for all possible pairs. In another sense, the design approximates the (much larger) set of all triples.
The questions considered by researchers in combinatorics broadly fall into three categories: existence/construction, enumeration/generation, and non-existence/structure. For design-theorists, the first two categories amount to: ""does a certain combinatorial design exist, and if so, how many are there?""
While satisfactory progress has been made on these questions, it can be said that non-existence or structural results perhaps lag slightly behind in design theory.
One of the themes of my research program (and a central component of this proposal) is a careful study of when certain designs cannot exist. Along the same lines, knowing that a design does exist, then my interest is in determining additional structure that must be present. Although these kind of investigations seem at first glance to be hoping for ""negative"" answers, they are actually very valuable. For, given the vast search space for combinatorial structures, knowing where not to look is immensely useful. Hence, algorithms for constructing designs are improved, and ideas for modifying the design conditions are born.