The strong-obstruction conjecture for the permanent versus determinant

About 20 years old · traced to

Let g=det⁡(Y)g=\operatorname{det}(Y), h=perm⁡(X)h=\operatorname{perm}(X), and f=ϕ(h)f=\phi(h). A strong obstruction is a representation-theoretic obstruction of the type defined in the paper for the pair (f,g)(f,g). Strong-obstruction conjecture. There exist infinitely many strong obstructions for (f,g)(f,g) if

m=2log⁡cn,m=2^{\log^c n},

where cc is a constant and n→∞n\to\infty. The conjecture would imply f∉ΔV[g]f\notin\Delta_V[g], hence the arithmetic implication of the P#P≠NCP^{\#P}\ne NC conjecture; it depends on the proposed equations for the determinant orbit closure.

References

Primary source

Ketan D Mulmuley and Milind Sohoni, “Geometric Complexity Theory II: Towards explicit obstructions for embeddings among class varieties”, arXiv:cs/0612134 (2006).

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.