Mulmuley–Sohoni's orbit-closure conjecture for permanent versus determinant
Mulmuley–Sohoni's orbit-closure conjecture for permanent versus determinant
Let be a linear coordinate on , and define the projective orbit closures
Let be a polynomial. Mulmuley–Sohoni's orbit-closure conjecture. For all sufficiently large ,
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.