Grant: Discovery Grants Program - Individual
Redeemer University
$15,000.00
Combinatorial matrix analysis and algebra
EF 2021-22
Résumé
algebraic graph theory; combinatorial commutative algebra; combinatorial matrix theory; inertially arbitrary pattern; inverse eigenvalue problem; matrix sign patterns; potentially nilpotent patterns; spectrally arbitrary patterns; vertex decomposable graphs; well-covered graphs
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
RGPIN-2016-03867
Name nom
Vander Meulen, Kevin
Department département
Mathematics
Organization id
101165
Institution établissement
Redeemer University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2021
Competition year année de concours
2016
Award amount
15000
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
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
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
Installment
inst:6
Partie
1
Nb partie
6
Application title
Combinatorial matrix analysis and algebra
Keyword
NSERC
Application summary
algebraic graph theory; combinatorial commutative algebra; combinatorial matrix theory; inertially arbitrary pattern; inverse eigenvalue problem; matrix sign patterns; potentially nilpotent patterns; spectrally arbitrary patterns; vertex decomposable graphs; well-covered graphs
