Hardness conjecture for immanants of large-depth Young diagrams
Statement
Let be any family of Young diagrams, where the depth of is the number of rows in the diagram. Assume that, for some constant , the depth is . Immanant hardness conjecture. Then is -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.