Grant: Discovery Grants Program - Individual
Redeemer University College
$10,000.00
Combinatorial and spectral analysis of matrix patterns
EF 2013-14
Résumé
The proposed research explores the interplay between two different areas of mathematics, namely linear algebra and graph theory. One particular type of problem being explored is how mathematics on arrays of numbers is affected by qualitative information, such as the pattern of positive, negative and zero entries in the array. Sometimes this information alone is sufficient to observe significant restrictions on results, independent of the magnitude of the individual numbers in the array. These sign patterns can be modeled using graph theory and this theory can provide insights into the restrictions for given patterns. Part of this research entails determining what restrictions can be discovered with these models, and likewise, how these models can help demonstrate lack of restrictions. The study of sign patterns was sparked by Nobel Laureate P. Samuelson in economics. Various problems in economics involve modeling situations when it is impossible to get exact numbers, but the more qualitative information is available. Such problems occur also in ecology, population biology, modeling epidemics, chemistry and sociology. Pattern analysis can also be helpful in inverse problems. These problems can arise in engineering problems, such as in structural analysis. An inverse problem generally involves trying to physically reconstruct a system with some prescribed behaviours. Usually there are constraints on the system. Pattern analysis could be useful in determining if, given the constraints, the inverse problem is feasible. I will focus on the mathematics of patterns in order to develop theory that may be useful in future development of modeling applications. As such this project is pure mathematics. I will be studying various abstract patterns to determine ways in which the graph theoretical information provides indicators as to restrictions inherent in the way the pattern can be used. I will be developing the methods used to determine what can be known about restrictions based on patterns.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Other
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
203336-2011
Name nom
VanderMeulen, Kevin
Department département
Mathematics
Organization id
1697
Institution établissement
Redeemer University College
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2011
Award amount
10000
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
2908
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Algebra
Research subject fr
algèbre
Partie
3
Nb partie
5
Application title
Combinatorial and spectral analysis of matrix patterns
Keyword
NSERC
Application summary
The proposed research explores the interplay between two different areas of mathematics, namely linear algebra and graph theory. One particular type of problem being explored is how mathematics on arrays of numbers is affected by qualitative information, such as the pattern of positive, negative and zero entries in the array. Sometimes this information alone is sufficient to observe significant restrictions on results, independent of the magnitude of the individual numbers in the array. These sign patterns can be modeled using graph theory and this theory can provide insights into the restrictions for given patterns. Part of this research entails determining what restrictions can be discovered with these models, and likewise, how these models can help demonstrate lack of restrictions. The study of sign patterns was sparked by Nobel Laureate P. Samuelson in economics. Various problems in economics involve modeling situations when it is impossible to get exact numbers, but the more qualitative information is available. Such problems occur also in ecology, population biology, modeling epidemics, chemistry and sociology. Pattern analysis can also be helpful in inverse problems. These problems can arise in engineering problems, such as in structural analysis. An inverse problem generally involves trying to physically reconstruct a system with some prescribed behaviours. Usually there are constraints on the system. Pattern analysis could be useful in determining if, given the constraints, the inverse problem is feasible. I will focus on the mathematics of patterns in order to develop theory that may be useful in future development of modeling applications. As such this project is pure mathematics. I will be studying various abstract patterns to determine ways in which the graph theoretical information provides indicators as to restrictions inherent in the way the pattern can be used. I will be developing the methods used to determine what can be known about restrictions based on patterns.