Inequalities and Reductions for Nonzero Kronecker Coefficients
summary
Provides explicit linear inequalities and elementary reduction algorithm rules that decide when a Kronecker coefficient can be nonzero, built from geometric invariant theory and moment polytope geometry plus symmetric group representation combinatorics. Gives a concrete criterion that covers many rectangular-partition cases, reduces large instances to smaller ones, and applies the tests to the determinant orbit examples from Geometric Complexity Theory, producing new vanishing and nonvanishing cases rather than only asymptotic statements.
AI-written summary · about
chapters (5)
- 0:00Start
- 1:02Orbit closure problem and obstructions
- 5:18Main example
- 9:39A Murnaghan's result
- 19:33Weyl's inequalities
related talks
22mMaximal Simplification of Polyhedral Reductions
55mNon-commutative Computation
37mPolynomial Identity Testing via Evaluation of Rational Functions
11mThe full-reducing Krivine abstract machine KN simulates pure normal-order reduction i...
01h 01mTrue Complexity of Multilinear Systems
22mStrong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants f...
24mSimplifying Multiple-Statement Reductions with the Polyhedral Model
47mHardness Amplification and the Approximate Degree of Constant-Depth Circuits