On the primality of totally ordered q-factorization graphs

DOI10.4153/S0008414X23000160arXiv2204.10439OpenAlexW4327967130MaRDI QIDQ6397149FDOQ6397149

Authors: Adriano Moura 

Publication date: 21 April 2022

Abstract: We introduce the combinatorial notion of a $q$-fatorization graph intended as a tool to study and express results related to the classification of prime simple modules for quantum affine algebras. These are directed graphs equipped with three decorations: a coloring and a weight map on vertices, and an exponent map on arrows (the exponent map can be seen as a weight map on arrows). Such graphs do not contain oriented cycles and, hence, the set of arrows induces a partial order on the set of vertices. In this first paper on the topic, beside setting the theoretical base of the concept, we establish several criteria for deciding whether or not a tensor product of two simple modules is a highest-$ell$-weight module and use such criteria to prove, for type $A$, that a simple module whose $q$-factorization graph has a totally ordered vertex set is prime.

Full work available at URL: https://doi.org/10.4153/s0008414x23000160

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Representations of Lie algebras and Lie superalgebras, algebraic theory (weights) (17B10) Quantum groups (quantized enveloping algebras) and related deformations (17B37) Infinite-dimensional groups and algebras motivated by physics, including Virasoro, Kac-Moody, (W)-algebras and other current algebras and their representations (81R10) Quantum groups (quantized function algebras) and their representations (20G42)

This page was built for publication: On the primality of totally ordered $q$-factorization graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6397149)