Algorithmic conjecture for isotypic multiplicities of symmetric semi-algebraic sets
Statement
Fix . Let be a symmetric semi-algebraic set defined by a -closed formula, where is a set of symmetric polynomials of degrees bounded by . For each partition , write for the multiplicity of the irreducible representation indexed by in the th cohomology module, and write for the corresponding Betti numbers.
Algorithmic conjecture. There is an algorithm which computes for every with , as well as all the Betti numbers , with complexity polynomial in and .
The preceding polynomial bounds on the number of representations and on their multiplicities motivate this conjecture, while the hook-length formula makes the dimensions of the relevant Specht modules polynomially computable.
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.