ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let λ(n)\lambda(n) be any family of Young diagrams, where the depth of λ(n)\lambda(n) is the number of rows in the diagram. Assume that, for some constant δ>0\delta>0, the depth is n−nδn-n^\delta. Immanant hardness conjecture. Then Immλ(n)\mathrm{Imm}_{\lambda(n)} is #P\#\mathrm{P}-hard. Equivalently, this concerns any family with a polynomial number of boxes to the right of the first column. The conjecture extends the paper's established hardness results for immanants associated with Young diagrams of bounded width, and its status is open.

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.