ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let dc(perm)\mathrm{dc}(\mathrm{per}_m) be the determinantal complexity of the m×mm\times m permanent. For integers d,n,md,n,m, let γλ,d,n,m\gamma_{\lambda,d,n,m} and δλ,d,n\delta_{\lambda,d,n} denote the multiplicities of the irreducible representation indexed by λ\lambda in the coordinate rings of the padded-permanent and determinant orbit closures, respectively. GCT multiplicity-obstruction conjecture. There exist multiplicity obstructions showing that

dc(perm)>mc\mathrm{dc}(\mathrm{per}_m)>m^c

for every constant cc; namely, for every n=O(mc)n=O(m^c) there exists an integer dd and a partition λ⊢dn\lambda\vdash dn such that

γλ,d,n,m>δλ,d,n.\gamma_{\lambda,d,n,m}>\delta_{\lambda,d,n}.

Such an obstruction would rule out containment of the padded-permanent orbit closure in the determinant orbit closure and yield lower bounds for the permanent. The source gives no resolution.

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.