Mulmuley–Sohoni padded-permanent border determinantal complexity conjecture
Statement
For , let be the padded permanent, viewed as an element of , and let be the Euclidean (equivalently, Zariski) closure of the -orbit of . Mulmuley–Sohoni's border determinantal complexity conjecture. For every , one has
for infinitely many . Membership of the padded permanent in this orbit closure would imply an upper bound on its determinantal complexity, so this conjecture would imply Valiant's determinantal complexity conjecture. It was proposed as a geometric-complexity-theory approach and remains open in the stated source context.
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.