Conjecture on nonnegative coefficients in the highest-weight inner-product recursion
Statement
Let be a state in a finite-dimensional irreducible representation, and let and denote the coefficients and highest-weight data appearing on the right-hand side of the recursion identity for its inner product. Nonnegativity conjecture. The coefficients satisfy
This conjecture concerns the positivity of the terms governing norms in the proposed recursion algorithm and is intended to support the study of unitarity in finite-dimensional irreducible representations. The supplied text does not state whether the conjecture has been resolved.
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.