ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let g{\mathfrak g} be a simple Lie algebra with Cartan matrix CC, let R={apωip:1≤p≤N}{\mathbf R}=\{a_p\omega_{i_p}:1\leq p\leq N\} be a collection of dominant integral weights, and let ζp\zeta_p be distinct nonzero complex numbers. Write Mλ,RM_{\lambda,{\mathbf R}} for the multiplicity of the irreducible g{\mathfrak g}-module VλV_\lambda in the tensor product of the corresponding localized Kirillov–Reshetikhin modules. Let na(i)n_a^{(i)} count the elements of R{\mathbf R} equal to aωia\omega_i, and write λ=∑il(i)ωi\lambda=\sum_i l^{(i)}\omega_i. The Kirillov–Reshetikhin conjecture. The multiplicity is

Mλ,R=∑{ma(i)∈Z+:Pa(i)≥0}∏a,i(Pa(i)+ma(i)ma(i))M_{\lambda,{\mathbf R}} = \sum_{\{m_a^{(i)}\in {\mathbb Z}_+: P_a^{(i)}\geq 0\}} \prod_{a,i} \binom{P_a^{(i)}+m_a^{(i)}}{m_a^{(i)}}

where the sum is over ma(i)m_a^{(i)} satisfying

∑aama(i)=∑j,aCi,j−1ana(j)−∑jCi,j−1l(j),\sum_a a m_a^{(i)}=\sum_{j,a}C^{-1}_{i,j}a n_a^{(j)}-\sum_j C^{-1}_{i,j}l^{(j)},

and

Pa(i)=∑bmin⁡(a,b)nb(i)+∑b,j≠imin⁡(∣Ci,j∣b,∣Cj,i∣a)mb(j)−2∑bmin⁡(a,b)mb(i).P_a^{(i)}=\sum_b\min(a,b)n_b^{(i)}+\sum_{b,j\neq i}\min(|C_{i,j}|b,|C_{j,i}|a)m_b^{(j)}-2\sum_b\min(a,b)m_b^{(i)}.

Here Ci,jC_{i,j} is the Cartan matrix. The formula is the fermionic multiplicity formula for the tensor product of KR-modules; it is known in several special cases, including arbitrary KR-modules for type ArA_r, fundamental weights for type DrD_r, and multiples of ω1\omega_1 for nonexceptional types, while the general case remains open.

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.