Mulmuley–Sohoni occurrence-obstruction conjecture
Statement
For , let be the orbit closure of the padded permanent in , and let be the orbit closure of the determinant. A partition occurs in a coordinate ring when the corresponding irreducible polynomial representation occurs in that coordinate ring. Mulmuley–Sohoni's occurrence-obstruction conjecture. For every , for infinitely many , there exists a partition occurring in but not in \mathbb{C}[{{\mathcal{D}}et_{m^c}]. The existence of such a partition would obstruct the containment and hence yield a lower bound for the determinantal complexity of the permanent. The conjecture was proposed as a strategy for proving the border determinantal complexity conjecture, but the source explicitly states that it is false.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.