Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Dalhousie University

$24,000.00

Graphs and digraphs

EF 2008-09

Résumé
The first part of the proposed research centers on combinatorial polynomials, from graph colourings to network reliability and independence polynomials. Algebraic and analytic techniques will be used to not only bound network reliability, both in the undirected and directed cases, but also to examine the underlying combinatorial structures. Locating the roots of the polynomials will shed more light on the outstanding unimodality problems of the underlying coefficients, as well as provide more insight into a newly defined class of fractals associated with independence in both graphs and simplicial complexes. I plan to continue to investigate strongly connected reliability, a useful measure of the robustness of a directed graph. In particular, there is an associated new simplicial complex that has not been previously studied, and its properties may help to efficiently bound this reliability measure. A new approach will involve compressing the directed and undirected graphs first with appropriate wavelets. Associated with every abstract simplicial complex are homology groups, and algebraic and topological properties of these combinatorial structures sometimes have import on unsolved discrete problems. The project will look at developing more of the broad connections between these, with applications to network reliability and graph colourings. I also plan to investigate applications of mathematics to music. Independence polynomials of highly structured graphs are related to counting consonant chords in equally tempered scales with n tones, and there are still open problems concerning this enumeration problem. A characterization of tilings of finite cyclic groups will be useful in generating rhythmic canons. More importantly, I plan to construct markov-like models for both melodic and harmonic aspects of songs. The models will take into account not only song structure but key modulation as well. The models will be of use not only for algorithmic composition, but also for authorship identification.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Nova Scotia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
170450-2008
Name nom
Brown, Jason
Department département
Mathematics and Statistics
Organization id
79
Institution établissement
Dalhousie University
Province en
Nova Scotia
Province fr
Nouvelle-Écosse
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2008
Award amount
24000
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
803
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
Computer communications
Area of application fr
Téléinformatique
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
Graphs and digraphs
Keyword
NA
Application summary
The first part of the proposed research centers on combinatorial polynomials, from graph colourings to network reliability and independence polynomials. Algebraic and analytic techniques will be used to not only bound network reliability, both in the undirected and directed cases, but also to examine the underlying combinatorial structures. Locating the roots of the polynomials will shed more light on the outstanding unimodality problems of the underlying coefficients, as well as provide more insight into a newly defined class of fractals associated with independence in both graphs and simplicial complexes. I plan to continue to investigate strongly connected reliability, a useful measure of the robustness of a directed graph. In particular, there is an associated new simplicial complex that has not been previously studied, and its properties may help to efficiently bound this reliability measure. A new approach will involve compressing the directed and undirected graphs first with appropriate wavelets. Associated with every abstract simplicial complex are homology groups, and algebraic and topological properties of these combinatorial structures sometimes have import on unsolved discrete problems. The project will look at developing more of the broad connections between these, with applications to network reliability and graph colourings. I also plan to investigate applications of mathematics to music. Independence polynomials of highly structured graphs are related to counting consonant chords in equally tempered scales with n tones, and there are still open problems concerning this enumeration problem. A characterization of tilings of finite cyclic groups will be useful in generating rhythmic canons. More importantly, I plan to construct markov-like models for both melodic and harmonic aspects of songs. The models will take into account not only song structure but key modulation as well. The models will be of use not only for algorithmic composition, but also for authorship identification.