Department of

October 2020 November 2020 December 2020 Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa 1 2 3 1 2 3 4 5 6 7 1 2 3 4 5 4 5 6 7 8 9 10 8 9 10 11 12 13 14 6 7 8 9 10 11 12 11 12 13 14 15 16 17 15 16 17 18 19 20 21 13 14 15 16 17 18 19 18 19 20 21 22 23 24 22 23 24 25 26 27 28 20 21 22 23 24 25 26 25 26 27 28 29 30 31 29 30 27 28 29 30 31

Thursday, November 5, 2020

**Abstract:** How hard is a problem? How nice is a solution? Such questions can actually be formalized using the theory of Computational Complexity. Yet, distinguishing the different computational complexity classes, like P vs NP, are major problems. Algebraic Combinatorics studies discrete structures originating in Algebra/Representation Theory via combinatorial methods and vice versa. Some of the main longstanding open problems concern the “combinatorial interpretation” of structure constants and multiplicities originally defined via representation theory like Kronecker and plethysm coefficients. In this talk we will discuss the two-way interaction between the fields via such structure constants. First, how Kronecker coefficients appear in the distinction of algebraic complexity classes via the Geometric Complexity Theory. Second, how computational complexity explains why the problem of finding a combinatorial interpretation is hard.

Meeting Info: please email ayong@illinois.edu