Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Ottawa

$13,000.00

Symmetry in graphs and hypergraphs

EF 2014-15

Résumé
The four main research directions of this proposal pertain to the study of symmetry in graphs and related structures (digraphs and hypergraphs). Graphs are mathematical objects consisting of points (called vertices) and links (called edges) that join pairs of vertices. Graphs are used in computer science and many other disciplines to model such objects as data structures, communication networks, computational flows, traffic networks, chemical molecules, social networks, ecosystems etc. I am particularly interested in graphs with a lot of symmetry. Symmetry of a graph can be measured in many different ways: via transformations (called automorphisms) that preserve the graph; by the existence of certain substructures, for example, cycles that traverse every vertex (called Hamilton cycles); by the substructures into which the graph can be decomposed, and so on. Graphs with high symmetry (and their generalizations) play an important role in designing reliable networks, as well as in scheduling problems. Apart from applications, such graphs are interesting and beautiful from a purely theoretical point of view. Some of the problems I am interested in (for example, the problems on digraph decompositions and Hamilton cycles) are basic unsolved problems about graphs: beautiful in the simplicity of their statement and yet very difficult to solve; some have been open for decades. Solutions to these problems would improve our understanding of some important algebraic and combinatorial aspects of graph theory. The fifth research direction included in this proposal is a student project in applications of discrete mathematics. Its main objective is development of algorithms and software that would efficiently solve the problem of outcome prediction for three specific real-life applications, and thus may assist in: (a) the design of proteomic experiments and development of targeted gene therapies for a number of diseases (e.g. coronary heart disease, diabetes, and cancer); (b) predicting new drug-target associations for previously approved drugs; (c) predictive environmental and health risk assessment of chemical mixtures.
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
251352-2011
Name nom
Sajna, Mateja
Department département
Mathematics and Statistics
Organization id
28
Institution établissement
University of Ottawa
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2011
Award amount
13000
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
9999
Area of application group en
Not available
Area of application group fr
Non disponible
Area of application en
Not available
Area of application fr
Non disponible
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
4
Nb partie
5
Application title
Symmetry in graphs and hypergraphs
Keyword
NSERC
Application summary
The four main research directions of this proposal pertain to the study of symmetry in graphs and related structures (digraphs and hypergraphs). Graphs are mathematical objects consisting of points (called vertices) and links (called edges) that join pairs of vertices. Graphs are used in computer science and many other disciplines to model such objects as data structures, communication networks, computational flows, traffic networks, chemical molecules, social networks, ecosystems etc. I am particularly interested in graphs with a lot of symmetry. Symmetry of a graph can be measured in many different ways: via transformations (called automorphisms) that preserve the graph; by the existence of certain substructures, for example, cycles that traverse every vertex (called Hamilton cycles); by the substructures into which the graph can be decomposed, and so on. Graphs with high symmetry (and their generalizations) play an important role in designing reliable networks, as well as in scheduling problems. Apart from applications, such graphs are interesting and beautiful from a purely theoretical point of view. Some of the problems I am interested in (for example, the problems on digraph decompositions and Hamilton cycles) are basic unsolved problems about graphs: beautiful in the simplicity of their statement and yet very difficult to solve; some have been open for decades. Solutions to these problems would improve our understanding of some important algebraic and combinatorial aspects of graph theory. The fifth research direction included in this proposal is a student project in applications of discrete mathematics. Its main objective is development of algorithms and software that would efficiently solve the problem of outcome prediction for three specific real-life applications, and thus may assist in: (a) the design of proteomic experiments and development of targeted gene therapies for a number of diseases (e.g. coronary heart disease, diabetes, and cancer); (b) predicting new drug-target associations for previously approved drugs; (c) predictive environmental and health risk assessment of chemical mixtures.