Restricted limits of minimal affinizations (Q848757)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Restricted limits of minimal affinizations
    scientific article

      Statements

      Restricted limits of minimal affinizations (English)
      0 references
      23 February 2010
      0 references
      In this paper the author studies finite-dimensional representations of a quantum loop algebra \(U_q(\tilde{\mathfrak{g}})\) called minimal affinizations, which were introduced in [\textit{V. Chari}, Publ. Res. Inst. Math. Sci. 31, No. 5, 873--911 (1995; Zbl 0855.17010)] and [\textit{V. Chari} and \textit{A. Pressley}, Lett. Math. Phys. 35, No.\ 2, 99--114 (1995; Zbl 0855.17011)]. By taking the classical limit and pull-back, one obtains from a minimal affinization a representation of a current algebra \(\mathfrak{g} \otimes \mathbb{C}[t]\) called the restricted limit. The author conjectures that the restricted limit of a minimal affinization is isomorphic to two other modules, one is defined in terms of generators and relations, and the other is a submodule of a tensor product generated by the top weight space, and proves this when \(\mathfrak{g}\) is orthogonal and the support of the highest weight is contained in the first three nodes of the Dynkin diagram, which gives character formulas for the corresponding minimal affinizations. He also proves a conjecture of [\textit{V. Chari} and \textit{A. Pressley}, Lett. Math. Phys. 36, No. 3, 247--266 (1996; Zbl 0857.17011)] regarding the equivalence of certain minimal affinizations in type \(D_4\).
      0 references
      minimal affinizations
      0 references
      Kirillov-Reshetikhin modules
      0 references
      quantum affine algebras
      0 references
      representation theory
      0 references
      characters
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references