YoVDO

The Mysterious Kronecker Coefficients in Algebraic Combinatorics

Offered By: Institute for Advanced Study via YouTube

Tags

Representation Theory Courses Computational Complexity Courses Asymptotics Courses Tensor Products Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the enigmatic world of Kronecker coefficients in this comprehensive lecture by Greta Panova at the Institute for Advanced Study. Delve into the multiplicities of irreducible Sn representations in tensor products of other irreducibles, introduced by Murnaghan in 1938. Discover how these coefficients generalize the Littlewood-Richardson coefficients of the General Linear group and their significance in Algebraic Combinatorics. Examine their role in Geometric Complexity theory and the quest for multiplicity obstructions in computational lower bounds for VP versus VNP. Gain insights into recent developments regarding positivity, asymptotics, and computational complexity of both Kronecker and reduced Kronecker coefficients. Learn about collaborative research findings with Christian Ikenmeyer, Igor Pak, and Damir Yeliussizov in this hour-long Special Year Seminar.

Syllabus

am|Rubenstein Commons | Meeting Room 5


Taught by

Institute for Advanced Study

Related Courses

Automata Theory
Stanford University via edX
Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX
算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera
How to Win Coding Competitions: Secrets of Champions
ITMO University via edX
Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera