Mulmuley–Sohoni's orbit-closure conjecture for permanent versus determinant

Let \ell be a linear coordinate on C1\mathbb C^1, and define the projective orbit closures

Detn:=GLn2[detn],\mathcal{Det}_n:=\overline{GL_{n^2}\cdot[\operatorname{det}_n]}, Permnm:=GLn2[nmpermm].\mathcal{Perm}^m_n:=\overline{GL_{n^2}\cdot[\ell^{n-m}\operatorname{perm}_m]}.

Let n(m)n(m) be a polynomial. Mulmuley–Sohoni's orbit-closure conjecture. For all sufficiently large mm,

Permn(m)m⊄Detn(m).\mathcal{Perm}^m_{n(m)}\not\subset\mathcal{Det}_{n(m)}.

This stronger geometric formulation asks for separation of orbit closures rather than only separation from the determinant orbit. It remains open and is central to geometric complexity theory.

Sources & referencesView supporting material

Primary source

J. M. Landsberg, “Algebraic Geometry and Representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science”, arXiv:2108.06263 (2021).

Additional references

3 papers in this index state this conjecture (2009–2021). The statement above is taken from the most recent of them; the others are arXiv:1509.02503, arXiv:0907.2850.

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.