Grant: Discovery Grants Program - Accelerator Supplements
Carleton University
$35,200.00
Designs, orderings and their applications
EF 2008-09
Résumé
I am interested in the mathematics of finite and discrete systems: graphs, geometries, networks, computer data structures, efficient software and communications. I am proposing research in two main areas of discrete mathematics: design theory and combinatorial Gray codes. Both of these are interesting in their own right and both also have many interesting applications to computers and communications including reliability testing, error recovery, automatic scheduling, and efficient algorithms.
Designs are collections of sets that have nice intersection properties; for example, no two sets share more than one common element; or every triple of elements appears in exactly two of the sets. My research in this area focuses on covering arrays, resolvable designs and 2-factorizations. These have applications to software testing, scheduling and distributed computing. Many of the mathematical objects that I investigate have properties explicitly defined by a requirement arising from their application. These often result in beautiful mathematics as well as enhance the efficiency of the application.
I am also interested in finding special orderings of families of objects. Orderings where consecutive objects differ in a small way are called Gray codes and have many applications in digital sensors, efficient storage and generation of data and efficient distribution of resources. I have found new Gray codes, shown that some do not exist and worked on codes that permit fast computations.
Recently I have become interested in combining the two previous areas to look at orderings of the blocks of designs. I have developed a general framework for discussing these codes and solved several open problems in the area. This synthesis has applications for error correction of digital data, robust distributed computing and conflict avoiding scheduling.
Programme
Discovery Grants Program - Accelerator Supplements
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
349695-2007
Name nom
Stevens, Brett
Department département
Mathematics and Statistics, School of
Organization id
23
Institution établissement
Carleton University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2007
Award amount
35200
Program id
RGPAS
Program nane en
Discovery Grants Program - Accelerator Supplements
Program name fr
Programme de subventions à la découverte - supplément d'accélération
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1058
Committee name en
Discovery Accelerator Supplements - Natural Sciences
Committee name fr
Suppléments d'accélération à la découverte - Sciences naturelles
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
2
Nb partie
3
Application title
Designs, orderings and their applications
Keyword
NA
Application summary
I am interested in the mathematics of finite and discrete systems: graphs, geometries, networks, computer data structures, efficient software and communications. I am proposing research in two main areas of discrete mathematics: design theory and combinatorial Gray codes. Both of these are interesting in their own right and both also have many interesting applications to computers and communications including reliability testing, error recovery, automatic scheduling, and efficient algorithms.
Designs are collections of sets that have nice intersection properties; for example, no two sets share more than one common element; or every triple of elements appears in exactly two of the sets. My research in this area focuses on covering arrays, resolvable designs and 2-factorizations. These have applications to software testing, scheduling and distributed computing. Many of the mathematical objects that I investigate have properties explicitly defined by a requirement arising from their application. These often result in beautiful mathematics as well as enhance the efficiency of the application.
I am also interested in finding special orderings of families of objects. Orderings where consecutive objects differ in a small way are called Gray codes and have many applications in digital sensors, efficient storage and generation of data and efficient distribution of resources. I have found new Gray codes, shown that some do not exist and worked on codes that permit fast computations.
Recently I have become interested in combining the two previous areas to look at orderings of the blocks of designs. I have developed a general framework for discussing these codes and solved several open problems in the area. This synthesis has applications for error correction of digital data, robust distributed computing and conflict avoiding scheduling.