ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For n>mn>m, let X11n−mpermX_{11}^{n-m}\mathrm{per}_m be the padded permanent, viewed as an element of SymnCn2\mathsf{Sym}^n\mathbb{C}^{n^2}, and let Detn{{\mathcal{D}}et}_n be the Euclidean (equivalently, Zariski) closure of the GLn2\mathrm{GL}_{n^2}-orbit of detn\mathrm{det}_n. Mulmuley–Sohoni's border determinantal complexity conjecture. For every c∈N≥1c\in\mathbb{N}_{\ge 1}, one has

X11mc−mperm∉DetmcX_{11}^{m^c-m}\mathrm{per}_m\notin{{\mathcal{D}}et}_{m^c}

for infinitely many mm. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.