Frenkel–Mukhin conjecture for the q-character algorithm
Statement
Let be a quantum affine algebra, let be a dominant monomial in , and let be the irreducible representation with highest weight monomial . The Frenkel–Mukhin algorithm produces a polynomial .
Frenkel–Mukhin conjecture. For any dominant monomial , the algorithm never fails and stops after finitely many steps. Moreover,
This conjecture asserts that the algorithm gives an effective formula for the -character of every irreducible representation. The source provides no resolution status.
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.