Naive dominance conjecture for polynomial modules of quantum affine superalgebras
Statement
Let be a monomial in for and , so that is a polynomial module. Assume that every -weight of other than the highest one is not a monomial in , and with and . Naive dominance conjecture. Under this assumption, the algorithm is well-defined. This conjecture concerns a naive definition of dominance for polynomial modules and their duals; it is supported by a number of examples, while the supplied text 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.