Grant: Discovery Grants Program - Individual
Carleton University
$21,000.00
Combinatorial Structures and Applications
FY 2016-17
Summary
I am interested in the mathematics of finite systems: geometries, networks, computer data structures, software and communications. I am proposing research in three main areas: combinatorial design theory, polynomials over finite fields and combinatorial Gray codes. All of these are interesting in their own right, are connected to each other, and all also have interesting applications to computers and communications.Designs are collections of sets that have nice intersection properties; for example, every pair of elements appears in at least one set. My research in this area focuses on covering arrays and covering designs. These have applications to software testing and network communication. 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 application.Finite fields are beautiful objects which have addition, multiplication and division but behave differently than familiar numbers. Polynomials of these ""numbers"" behave very familiarly and we are interested in their roots and factors. My work is on factoring polynomials with few terms and recognizing highly non-linear behaviour. These have applications in cryptography and constructing designs and codesI am also interested in Gary codes, sequences where consecutive objects differ in a small way. These have applications in digital sensors and efficient generation. 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 two areas to look at orderings of combinatorial designs. I have developed a system for discussing these and solved several open problems. This synthesis has applications for error correction, scheduling and group testing.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
249777-2012
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
2016
Competition year année de concours
2012
Award amount
21000
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
5
Nb partie
5
Application title
Combinatorial Structures and Applications
Keyword
NSERC
Application summary
I am interested in the mathematics of finite systems: geometries, networks, computer data structures, software and communications. I am proposing research in three main areas: combinatorial design theory, polynomials over finite fields and combinatorial Gray codes. All of these are interesting in their own right, are connected to each other, and all also have interesting applications to computers and communications.Designs are collections of sets that have nice intersection properties; for example, every pair of elements appears in at least one set. My research in this area focuses on covering arrays and covering designs. These have applications to software testing and network communication. 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 application.Finite fields are beautiful objects which have addition, multiplication and division but behave differently than familiar numbers. Polynomials of these ""numbers"" behave very familiarly and we are interested in their roots and factors. My work is on factoring polynomials with few terms and recognizing highly non-linear behaviour. These have applications in cryptography and constructing designs and codesI am also interested in Gary codes, sequences where consecutive objects differ in a small way. These have applications in digital sensors and efficient generation. 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 two areas to look at orderings of combinatorial designs. I have developed a system for discussing these and solved several open problems. This synthesis has applications for error correction, scheduling and group testing.