Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

McMaster University

$31,000.00

Exploring combinatorial commutative algebra

EF 2024-25

Résumé
This research program lies in the intersection of algebra, geometry, and combinatorics. The mathematician Descartes first illustrated the power of associating geometric objects with algebraic equations; expressing a parabola with an equation is a classic example taught in high school. Similarly, algebra can be linked with combinatorics, allowing one to study a problem through multiple lenses. While new methods have been developed since Descartes' work, the theme of using different mathematical perspectives to study algebraic problems has remained constant. The long term goal of my research is to build new connections between algebra, geometry and combinatorics. In particular, I want to apply the tools of commutative algebra, a branch of abstract algebra that studies commutative rings, to relate properties of graph theory to algebra, and vice-versa. My proposed research focuses on several facets of this theme. One facet of my research is concerned with algebraic objects known as toric ideals of graphs. A graph is a set of nodes with lines connecting some of them. Graphs can be used to model real world phenomenon, e.g., denoting airports by nodes and connecting two nodes if there is a flight between the associated airports. From a graph we can make a toric ideal, an algebraic object that can be studied geometrically, algebraically, or combinatorially. I intend to determine how the graph structure gets encoded into an algebraic object called a minimal free resolution. Closed even walks in a graph, for example, correspond to the generators of the toric ideal. In our airport example, such a walk corresponds to a trip to an even number of airports before returning to the original airport. I want to know what other information about the resolution of the toric ideal can be extracted from the graph; our current understanding of this connection is opaque, highlighting the need for more research. Graphs can also be associated with algebraic objects called edge ideals. Both graphs and edge ideals have `invariants', descriptive information that allows us to (partially) determine if two objects are the same. For example, the number of edges of a graph is an invariant. I am interested in what pairs of invariants can occur together, thus giving us a new tool to distinguish edge ideals. Because many algebraic invariants of edge ideals are related to invariants of the graph, I intend to leverage graph theory information to gain new insights into the behaviour of invariants of algebraic objects. This proposal builds upon my past research to understand algebraic invariants from a combinatorial point-of-view. My research provides a theoretical basis for future applications (e.g. linear programming), and it will uncover new connections between algebra and combinatorics. Components of my proposal are devoted to the training of a diverse group of highly qualified personnel (HQP) in order to prepare them for careers in academia, government, or industry.
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-2024-05299
Name nom
Van Tuyl, Adam
Department département
Mathematics and Statistics - Mathematics and Statistics
Organization id
27
Institution établissement
McMaster University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2024
Award amount
31000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR 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
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Exploring combinatorial commutative algebra
Keywords
combinatorial commutative algebra; binomial and monomial ideals; toric ideals of graphs; binomial edge ideals; edge ideals; homological invariants (e.g. graded betti numbers); splittings of ideals; comparing invariants; knutson ideals; geometrically vertex decomposable ideals
Application summary
This research program lies in the intersection of algebra, geometry, and combinatorics. The mathematician Descartes first illustrated the power of associating geometric objects with algebraic equations; expressing a parabola with an equation is a classic example taught in high school. Similarly, algebra can be linked with combinatorics, allowing one to study a problem through multiple lenses. While new methods have been developed since Descartes' work, the theme of using different mathematical perspectives to study algebraic problems has remained constant. The long term goal of my research is to build new connections between algebra, geometry and combinatorics. In particular, I want to apply the tools of commutative algebra, a branch of abstract algebra that studies commutative rings, to relate properties of graph theory to algebra, and vice-versa. My proposed research focuses on several facets of this theme. One facet of my research is concerned with algebraic objects known as toric ideals of graphs. A graph is a set of nodes with lines connecting some of them. Graphs can be used to model real world phenomenon, e.g., denoting airports by nodes and connecting two nodes if there is a flight between the associated airports. From a graph we can make a toric ideal, an algebraic object that can be studied geometrically, algebraically, or combinatorially. I intend to determine how the graph structure gets encoded into an algebraic object called a minimal free resolution. Closed even walks in a graph, for example, correspond to the generators of the toric ideal. In our airport example, such a walk corresponds to a trip to an even number of airports before returning to the original airport. I want to know what other information about the resolution of the toric ideal can be extracted from the graph; our current understanding of this connection is opaque, highlighting the need for more research. Graphs can also be associated with algebraic objects called edge ideals. Both graphs and edge ideals have `invariants', descriptive information that allows us to (partially) determine if two objects are the same. For example, the number of edges of a graph is an invariant. I am interested in what pairs of invariants can occur together, thus giving us a new tool to distinguish edge ideals. Because many algebraic invariants of edge ideals are related to invariants of the graph, I intend to leverage graph theory information to gain new insights into the behaviour of invariants of algebraic objects. This proposal builds upon my past research to understand algebraic invariants from a combinatorial point-of-view. My research provides a theoretical basis for future applications (e.g. linear programming), and it will uncover new connections between algebra and combinatorics. Components of my proposal are devoted to the training of a diverse group of highly qualified personnel (HQP) in order to prepare them for careers in academia, government, or industry.