The Kronecker Coefficients Of The Symmetric Group In Complexity And Combinatorics

APA

(2021). The Kronecker Coefficients Of The Symmetric Group In Complexity And Combinatorics. The Simons Institute for the Theory of Computing. https://simons.berkeley.edu/talks/kronecker-coefficients-symmetric-group-complexity-and-combinatorics

MLA

The Kronecker Coefficients Of The Symmetric Group In Complexity And Combinatorics. The Simons Institute for the Theory of Computing, Dec. 01, 2021, https://simons.berkeley.edu/talks/kronecker-coefficients-symmetric-group-complexity-and-combinatorics

BibTex

          @misc{ scivideos_18802,
            doi = {},
            url = {https://simons.berkeley.edu/talks/kronecker-coefficients-symmetric-group-complexity-and-combinatorics},
            author = {},
            keywords = {},
            language = {en},
            title = {The Kronecker Coefficients Of The Symmetric Group In Complexity And Combinatorics},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2021},
            month = {dec},
            note = {18802 see, \url{https://scivideos.org/Simons-Institute/18802}}
          }
          
Greta Panova (University of Southern California)
Source Repository Simons Institute

Abstract

The Kronecker coefficients of the symmetric group are the multiplicities of irreducible representations in the decomposition of the tensor product of two other irreducible representations. Ever since their definition by Murnaghan more than 80 years ago they've presented a major mystery and open problem in Algebraic Combinatorics. Recently they have come to play a crucial role in Geometric Complexity Theory in the quest for separation of VP and VNP. In this talk I'll give a broad overview of this topic with respect to combinatorics, asymptotics and computational complexity.