Combinatorial Representation Theory

About This Grant

Algebraic objects such as groups are used to measure symmetry in both mathematics and the natural world. In combinatorial representation theory, one aims to make algebraic structures more accessible by translating them into concrete combinatorial objects such as graphs, tableaux, and partitions. These combinatorial models not only provide intuitive insight but also lead to more efficient computations. A central focus of this project is to study how representations can be combined, especially through operations like the tensor product and composition of group representations. Our goal is to build algorithms that use combinatorial tools to break down the combined representations into basic building blocks, called irreducible representations. This decomposition problem has broad significance across fields like algebraic combinatorics, complexity theory, and statistics, and it finds practical applications in computer vision, quantum physics, chemistry, and even fast matrix multiplication. At its core, it addresses the fundamental challenge of disentangling individual signals from a composite one. In parallel, the PI will continue collaborative work with students on the chromatic symmetric function, a rich yet accessible topic that provides an ideal entry point for introducing students to mathematical research. Three of the most important open problems in combinatorial representation theory are the Kronecker, plethysm, and restriction problems. Each focuses on understanding how representations decompose into irreducibles, and all three are closely connected. The PI and her collaborators have identified the plethysm problem as the key to solving the others. In joint work with Saliola, Schilling, and Zabrocki, the PI developed a new approach to plethysm using the representation theory of diagram algebras. These efforts led to a new algorithm for computing plethysm based on the uniform block permutation algebra. Together with Zabrocki, she also introduced new bases of symmetric functions that have led to progress on the restriction and Kronecker problems. Building on this foundation, the proposed projects will further develop the combinatorial and algebraic frameworks aimed at deeper understanding of the plethysm and related decomposition problems. This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.