Rectangular Kronecker coefficients and plethysms in geometric complexity theory
Preprint
Abstract
We prove that in the geometric complexity theory program the vanishing of rectangular Kronecker coefficients cannot be used to prove superpolynomial determinantal complexity lower bounds for the permanent polynomial. Moreover, we prove the positivity of rectangular Kronecker coefficients for a large class of partitions where the side lengths of the rectangle are at least quadratic in the length of the partition. We also compare rectangular Kronecker coefficients with their corresponding plethysm coefficients, which leads to a new lower bound for rectangular Kronecker coefficients. Moreover, we prove that the saturation of the rectangular Kronecker semigroup is trivial, we show that the rectangular Kronecker positivity stretching factor is 2 for a long first row, and we completely classify the positivity of rectangular limit Kronecker coefficients that were introduced by Manivel in 2011.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- On vanishing of Kronecker coefficientscomputational complexity, 2017
- The Saxl conjecture for fourth powers via the semigroup propertyJournal of Algebraic Combinatorics, 2016
- A Lower Bound for the Determinantal Complexity of a HypersurfaceFoundations of Computational Mathematics, 2015
- Unimodality via Kronecker productsJournal of Algebraic Combinatorics, 2014
- Geometric complexity theory: an introduction for geometersANNALI DELL'UNIVERSITA' DI FERRARA, 2014
- On rectangular Kronecker coefficientsJournal of Algebraic Combinatorics, 2010
- Quadratic Lower Bound for Permanent Vs. Determinant in any Characteristiccomputational complexity, 2010
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficientsJournal of Algebraic Combinatorics, 2006
- A formula for the Kronecker products of Schur functions of hook shapesJournal of Algebra, 1989
- Partitions into odd, enequal partsJournal of Pure and Applied Algebra, 1985