Grant: Discovery Grants Program - Individual
University of Waterloo
$19,000.00
Chromatic Symmetric Functions: Solving Algebraic Conjectures Using Graph Theory
EF 2023-24
Résumé
Many processes depend largely on the innate symmetries of natural objects, and how the movement of these objects in space affects them; for example, determining the energy states of a subatomic particle and predicting transitions between them, or distinguishing communication signals from random noise. One way to study such objects is to perturb them by rotations and analyze the resulting interactions. Because of symmetry, some rotations will produce an identical result to others. These symmetries may be encoded by symmetric functions, multivariate polynomials that are fixed under any permutation of the variables. The study of different objects can then be represented by considering symmetric functions within the context of a given algebraic structure or theory. As examples, for subatomic particles and quantum physics we consider the Fock space, and for signal identification we consider random matrix theory. The long-term goal of this research is to study symmetric functions through the theory of graphs. Graphs arise frequently in research to model discrete systems and their relationships. Graph theory is one of the most studied areas of discrete mathematics, and the main approach to this research will be to interpret symmetric functions in terms of graphs and their structure to apply a much broader range of knowledge. A starting point will be the chromatic symmetric function X_G, currently the only major connection between graphs and symmetric functions. This program will expand our knowledge helping us to understand the information X_G encodes about graphs, and to generalize X_G to a stronger form based on K-theory and other ideas from modern algebra. Additionally, this program will create graph-based constructions to represent algebraic objects such as LLT polynomials and plethysms of Schur functions, thus providing new avenues of attack for notoriously difficult problems in algebraic combinatorics such as interpreting Macdonald polynomials, and determining branching rules for representations of symmetric groups. The long-term vision of this research anticipates that these two paths will converge and build upon each other: chromatic symmetric functions are already related in special cases to LLT polynomials, which in turn are used in general symmetric function theory to study the movement of particles between quantum states in quantum mechanics. Thus, this research aims to form a bridge connecting two well-studied areas of mathematics by building from both sides. Such a bridge will greatly advance results and approaches in both fields, as techniques from one may be easily applied to the other. Students taking part in this program will learn valuable skills at the forefront of two major areas of discrete mathematics with immediate applications to positions in academia or the computer science 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-2022-03093
Name nom
Crew, Logan
Department département
Department of Combinatorics & Optimization
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2023
Competition year année de concours
2022
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 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
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
9999
Research subject group en
Not available
Research subject group fr
Not available
Research subject en
Non disponible
Research subject fr
Non disponible
Application title
Chromatic Symmetric Functions: Solving Algebraic Conjectures Using Graph Theory
Keyword
algebraic combinatorics; chromatic symmetric function; deletion-contraction; graph coloring; graph polynomials; graphs; K-theory; LLT polynomials; symmetric functions; unit interval graphs
Application summary
Many processes depend largely on the innate symmetries of natural objects, and how the movement of these objects in space affects them; for example, determining the energy states of a subatomic particle and predicting transitions between them, or distinguishing communication signals from random noise. One way to study such objects is to perturb them by rotations and analyze the resulting interactions. Because of symmetry, some rotations will produce an identical result to others. These symmetries may be encoded by symmetric functions, multivariate polynomials that are fixed under any permutation of the variables. The study of different objects can then be represented by considering symmetric functions within the context of a given algebraic structure or theory. As examples, for subatomic particles and quantum physics we consider the Fock space, and for signal identification we consider random matrix theory. The long-term goal of this research is to study symmetric functions through the theory of graphs. Graphs arise frequently in research to model discrete systems and their relationships. Graph theory is one of the most studied areas of discrete mathematics, and the main approach to this research will be to interpret symmetric functions in terms of graphs and their structure to apply a much broader range of knowledge. A starting point will be the chromatic symmetric function X_G, currently the only major connection between graphs and symmetric functions. This program will expand our knowledge helping us to understand the information X_G encodes about graphs, and to generalize X_G to a stronger form based on K-theory and other ideas from modern algebra. Additionally, this program will create graph-based constructions to represent algebraic objects such as LLT polynomials and plethysms of Schur functions, thus providing new avenues of attack for notoriously difficult problems in algebraic combinatorics such as interpreting Macdonald polynomials, and determining branching rules for representations of symmetric groups. The long-term vision of this research anticipates that these two paths will converge and build upon each other: chromatic symmetric functions are already related in special cases to LLT polynomials, which in turn are used in general symmetric function theory to study the movement of particles between quantum states in quantum mechanics. Thus, this research aims to form a bridge connecting two well-studied areas of mathematics by building from both sides. Such a bridge will greatly advance results and approaches in both fields, as techniques from one may be easily applied to the other. Students taking part in this program will learn valuable skills at the forefront of two major areas of discrete mathematics with immediate applications to positions in academia or the computer science industry.