Grant: Discovery Grants Program - Individual
McMaster University
$12,000.00
Steiner systems
EF 2010-11
Résumé
My research falls within the area of combinatorial design theory. This is a subject in pure mathematics which can be tracked back to Euler in the late 18th century, to Kirkman in mid-19th century, and in its modern incarnation to Bose in 1939 and Wilson in 1969. It is being currently developed as a subject in both pure mathematics and applied mathematics, with emphasis on applicable mathematics. Within this framework, the objectives of my research program are:
1) To continue the systematic study of properties of Steiner triple systems, Steiner systems S(2,4,v) and related designs, with particular attention paid to colouring problems and configurations. Concerning colourings, the emphasis will be on new types of colourings with prescribed vertex- and/or block-colour patterns
as well as on the 'classical' chromatic index of Steiner triple systems and strongly regular graphs. For configurations, I will investigate problems on consecutive block orderings which have important applications in computer science.
2) To initiate the systematic study of the properties of 2-factorizations of complete graphs and other types of regular graphs, including strongly regular graphs. The problems studied will include the Oberwolfach problem, the Hamilton-Waterloo problem, and, more generally, the existence problem for 2-factorizations with prescribed types of 2-factors. Open questions concerning the computational complexity of problems on 2-factorizations, such as the isomorphism problem for Kirkman triple systems, will also be addressed.
3) To continue computer-assisted investigation of small Steiner systems, including small cyclic 3-designs, 1-factorizations and related designs, with attention being paid to questions concerning computational complexity of corresponding problems. Long-term objectives here are a) expanding the universe of perfect 1-factorizations and b) an ongoing improvement of tables of balanced incomplete block designs.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
7268-2010
Name nom
Rosa, Alexander
Department département
Mathematics and Statistics
Organization id
27
Institution établissement
McMaster University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2010
Competition year année de concours
2010
Award amount
12000
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
1
Nb partie
5
Application title
Steiner systems
Keyword
NSERC
Application summary
My research falls within the area of combinatorial design theory. This is a subject in pure mathematics which can be tracked back to Euler in the late 18th century, to Kirkman in mid-19th century, and in its modern incarnation to Bose in 1939 and Wilson in 1969. It is being currently developed as a subject in both pure mathematics and applied mathematics, with emphasis on applicable mathematics. Within this framework, the objectives of my research program are:
1) To continue the systematic study of properties of Steiner triple systems, Steiner systems S(2,4,v) and related designs, with particular attention paid to colouring problems and configurations. Concerning colourings, the emphasis will be on new types of colourings with prescribed vertex- and/or block-colour patterns
as well as on the 'classical' chromatic index of Steiner triple systems and strongly regular graphs. For configurations, I will investigate problems on consecutive block orderings which have important applications in computer science.
2) To initiate the systematic study of the properties of 2-factorizations of complete graphs and other types of regular graphs, including strongly regular graphs. The problems studied will include the Oberwolfach problem, the Hamilton-Waterloo problem, and, more generally, the existence problem for 2-factorizations with prescribed types of 2-factors. Open questions concerning the computational complexity of problems on 2-factorizations, such as the isomorphism problem for Kirkman triple systems, will also be addressed.
3) To continue computer-assisted investigation of small Steiner systems, including small cyclic 3-designs, 1-factorizations and related designs, with attention being paid to questions concerning computational complexity of corresponding problems. Long-term objectives here are a) expanding the universe of perfect 1-factorizations and b) an ongoing improvement of tables of balanced incomplete block designs.