Grant: Discovery Grants Program - Individual
Dalhousie University
$19,000.00
Graphs and Hypergraphs
FY 2017-18
Summary
The first part of the project concentrates on answering a variety of graph theoretical questions via connections to other branches of mathematics. First, using analytic, algebraic and combinatorial techniques, I will investigate problems related to the roots of such polynomials in terms of the the largest modulus, real and imaginary parts among graphs of order n. As well, new generalizations of colouring polynomials have arisen that take into account forbidden sets of colours at the vertex sets, and some difficult extremal problems require more attention. Connections have suggested that a deeper exploration of the algebras over finite fields as a way to further bound the polynomials and locate their roots. Also, I plan to investigate whether a famous open problem on the colouring number of a certain product of two graphs might yield to a matrix-theoretic approach.In network reliability, I plan to continue to explore analytic properties of these polynomials, ranging from location of the roots and fixed points to new notions of optimality of reliability polynomials, using integrals. Also, I plan to complete development for the theory of a new local (rather then global) measure of robustness, that may be more useful for social networks. I propose to investigate an abstract notion of convexity both graph theoretically and analytically via associated polynomials. I also plan to explore a matrix-theoretic approach to Tutte's 5-flow problem, utilizing counting principles, to bound the number of 5-flows of a graph in terms of the dimensions of certain subspaces. Certain vector spaces associated with hypergraphs have only recently been explored, and there is much work to be done yet on connecting up structural properties of the hypergraphs with the vector space dimension (and bases) of the associated spaces. Results are likely to help provide new insights into the building blocks of families of hypergraphs.
Program
Discovery Grants Program - Individual
Recipient
Location
Nova Scotia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
170450-2013
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
2017
Competition year année de concours
2013
Award amount
19000
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
5
Nb partie
5
Application title
Graphs and Hypergraphs
Keyword
NSERC
Application summary
The first part of the project concentrates on answering a variety of graph theoretical questions via connections to other branches of mathematics. First, using analytic, algebraic and combinatorial techniques, I will investigate problems related to the roots of such polynomials in terms of the the largest modulus, real and imaginary parts among graphs of order n. As well, new generalizations of colouring polynomials have arisen that take into account forbidden sets of colours at the vertex sets, and some difficult extremal problems require more attention. Connections have suggested that a deeper exploration of the algebras over finite fields as a way to further bound the polynomials and locate their roots. Also, I plan to investigate whether a famous open problem on the colouring number of a certain product of two graphs might yield to a matrix-theoretic approach.In network reliability, I plan to continue to explore analytic properties of these polynomials, ranging from location of the roots and fixed points to new notions of optimality of reliability polynomials, using integrals. Also, I plan to complete development for the theory of a new local (rather then global) measure of robustness, that may be more useful for social networks. I propose to investigate an abstract notion of convexity both graph theoretically and analytically via associated polynomials. I also plan to explore a matrix-theoretic approach to Tutte's 5-flow problem, utilizing counting principles, to bound the number of 5-flows of a graph in terms of the dimensions of certain subspaces. Certain vector spaces associated with hypergraphs have only recently been explored, and there is much work to be done yet on connecting up structural properties of the hypergraphs with the vector space dimension (and bases) of the associated spaces. Results are likely to help provide new insights into the building blocks of families of hypergraphs.