Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Manitoba

$14,000.00

Structure of orthogonal matrices

FY 2009-10

Summary
How is a transmitted message preserved from errors due to noise? One way is to introduce redundancy; a simple kind of redundancy is obtained by sending multiple copies. A more efficient approach uses Error Correcting Codes, the most important of which involve Hadamard matrices -- square array's of 1's and -1's whose rows form the ``words'' of the code. The rows of a Hadamard matrix must be``orthogonal'', which means, roughly, that they are as different as possible. This project studies many questions about Hadamard matrices and related objects lumped together as "orthogonal matrices". Other applications occur in optics, cryptography, spectroscopy, information storage devices (such as CD's), and range-finding equipment such as GPS and radar. Orthogonal matrices are also of great theoretical interest -- first, because they bridge a gap between major fields of mathematics; and, second, because answers to simple questions about them are elusive. The best known of these questions, now considered one of the great unsolved mathematical problems, was posed by J. Hadamard in 1893: What are the possible sizes of Hadamard matrices? Another one, posed by Ryser in about 1960: Can a Hadamard matrix be obtained from a single row by rotating its entries to the right into all possible positions? That such practical considerations coincide with compelling theoretical questions marking crucial gaps in our understanding explains the broad interest in orthogonal matrices. Some consider these problems too intractible to attempt, but our innovative approach emphasizing the deeper structure of these matrices is yielding promising new insights. The algebraical tools we have introduced have already been used to make significant progress on questions like the Hadamard matrix problem.
Program
Discovery Grants Program - Individual
Location
Manitoba, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
155855-2009
Name nom
Craigen, Robert
Department département
Mathematics
Organization id
19
Institution établissement
University of Manitoba
Province en
Manitoba
Province fr
Manitoba
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2009
Competition year année de concours
2009
Award amount
14000
Program id
RGPIN
Program nane 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
337
Committee name en
Pure & Applied Maths - B
Committee name fr
Maths pures et appliquées - B
Area of application code
805
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Communications technologies (satellites, radar, etc.)
Area of application fr
Technologie des télécommunications (satellites, radar,etc.)
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
Structure of orthogonal matrices
Keyword
NA
Application summary
How is a transmitted message preserved from errors due to noise? One way is to introduce redundancy; a simple kind of redundancy is obtained by sending multiple copies. A more efficient approach uses Error Correcting Codes, the most important of which involve Hadamard matrices -- square array's of 1's and -1's whose rows form the ``words'' of the code. The rows of a Hadamard matrix must be``orthogonal'', which means, roughly, that they are as different as possible. This project studies many questions about Hadamard matrices and related objects lumped together as "orthogonal matrices". Other applications occur in optics, cryptography, spectroscopy, information storage devices (such as CD's), and range-finding equipment such as GPS and radar. Orthogonal matrices are also of great theoretical interest -- first, because they bridge a gap between major fields of mathematics; and, second, because answers to simple questions about them are elusive. The best known of these questions, now considered one of the great unsolved mathematical problems, was posed by J. Hadamard in 1893: What are the possible sizes of Hadamard matrices? Another one, posed by Ryser in about 1960: Can a Hadamard matrix be obtained from a single row by rotating its entries to the right into all possible positions? That such practical considerations coincide with compelling theoretical questions marking crucial gaps in our understanding explains the broad interest in orthogonal matrices. Some consider these problems too intractible to attempt, but our innovative approach emphasizing the deeper structure of these matrices is yielding promising new insights. The algebraical tools we have introduced have already been used to make significant progress on questions like the Hadamard matrix problem.
University of Manitoba - $14,000 Grant (2009-10) | Canada Spends