The Kronecker-coefficient obstruction conjecture in geometric complexity theory

Let g(λ,nd,nd)g(\lambda,n^d,n^d) be a rectangular Kronecker coefficient, and let γλ,d,n,m\gamma_{\lambda,d,n,m} be the multiplicity of the irreducible representation indexed by λ\lambda in the coordinate ring of the padded-permanent orbit closure. GCT obstruction conjecture. There exist λ\lambda such that

g(λ,nd,nd)=0g(\lambda,n^d,n^d)=0

and

γλ,d,n,m>0\gamma_{\lambda,d,n,m}>0

for some n>poly(m)n>\operatorname{poly}(m).

The proposed obstruction would exploit vanishing rectangular Kronecker coefficients to separate the padded permanent from the determinant. The source gives no resolution.

Sources & referencesView supporting material

Primary source

Greta Panova, “Computational Complexity in Algebraic Combinatorics”, arXiv:2306.17511 (2023).

Additional references

2 papers in this index state this conjecture (2022–2023). The statement above is taken from the most recent of them; the others are arXiv:2205.05408.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.