ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Uq(g^)U_q(\hat{\mathfrak{g}}) be a quantum affine algebra, let m+m_+ be a dominant monomial in Z[Yi,a±1]i∈I; a∈C×\mathbb{Z}[Y_{i,a}^{\pm1}]_{i\in I;\,a\in\mathbb{C}^{\times}}, and let V(m+)V(m_+) be the irreducible representation with highest weight monomial m+m_+. The Frenkel–Mukhin algorithm produces a polynomial χ(m+)\chi(m_+).

Frenkel–Mukhin conjecture. For any dominant monomial m+m_+, the algorithm never fails and stops after finitely many steps. Moreover,

χ(m+)=χq(V(m+)).\chi(m_+)=\chi_q(V(m_+)).

This conjecture asserts that the algorithm gives an effective formula for the qq-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.