Complexity and asymptotics in Algebraic Combinatorics

Job Candidate Talk
Thursday, January 19, 2023 - 11:00am for 1 hour (actually 50 minutes)
Skiles 006 and Zoom
Greta Panova – University of Southern California –
Christine Heitsch

Please Note: Refreshments available from 10:30 in Skiles Atrium. Talk will be streamed via but not recorded.

Algebraic Combinatorics originated in Algebra and Representation Theory, yet its objects and methods turned out applicable to other fields from Probability to Computer Science. Its flagship hook-length formula for the number of Standard Young Tableaux, or the beautiful Littlewood-Richardson rule have inspired large areas of study and development. We will see what lies beyond the reach of such nice product formulas and combinatorial interpretations and enter the realm of Computational Complexity and Asymptotics. We will also show how an 80 year old open problem on Kronecker coefficients of the Symmetric group lead to the disprove of the wishful approach towards the resolution of the algebraic P vs NP Millennium problem.