[Paper Review] On the primality of totally ordered $q$-factorization graphs

Adriano Moura, Clayton Silva|arXiv (Cornell University)|Apr 22, 2022

Algebraic structures and combinatorial models27 references4 citations

TL;DR

This paper introduces $q$-factorization graphs—directed, acyclic graphs with vertex colorings, vertex weights, and arrow exponents—as a combinatorial tool to study prime simple modules in quantum affine algebras. For type $A$, it proves that if the vertex set of a $q$-factorization graph is totally ordered, then the corresponding simple module is prime, establishing a key criterion for primality in this context.

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.

Motivation & Objective

• To develop a combinatorial framework for analyzing prime simple modules in quantum affine algebras.
• To define and formalize the concept of $q$-factorization graphs with vertex colorings, vertex weights, and arrow exponent maps.
• To establish criteria for determining when a tensor product of two simple modules is a highest-$\ell$-weight module.
• To prove that in type $A$, a simple module with a totally ordered $q$-factorization graph is prime.
• To lay the theoretical foundation for future classification of prime modules using graph-theoretic methods.

Proposed method

• The paper defines $q$-factorization graphs as directed graphs with three decorations: vertex coloring, vertex weight map, and arrow exponent map.
• It establishes that such graphs are acyclic, thereby inducing a partial order on vertices via the arrow relation.
• It introduces a criterion for when a tensor product of two simple modules is a highest-$\ell$-weight module using the structure of $q$-factorization graphs.
• It applies the theory to type $A$ quantum affine algebras, leveraging known representation-theoretic results.
• It uses the total order on vertices of the $q$-factorization graph to deduce structural properties of the corresponding module.
• It proves that under total order, the module is prime by analyzing the absence of nontrivial factorizations in the tensor category.

Experimental results

Research questions

• RQ1 Under what conditions is a tensor product of two simple modules a highest-$\ell$-weight module?
• RQ2 How can $q$-factorization graphs be used to characterize prime simple modules in quantum affine algebras?
• RQ3 What structural properties of $q$-factorization graphs imply primality of the associated module?
• RQ4 In type $A$, does a totally ordered vertex set in a $q$-factorization graph guarantee that the corresponding module is prime?
• RQ5 Can the combinatorics of $q$-factorization graphs provide a complete classification criterion for primality?

Key findings

• For type $A$ quantum affine algebras, any simple module whose $q$-factorization graph has a totally ordered vertex set is prime.
• The $q$-factorization graph construction provides a combinatorial framework to analyze highest-$\ell$-weight modules and their tensor products.
• The absence of oriented cycles in $q$-factorization graphs ensures a well-defined partial order on vertices, enabling structural analysis.
• The paper establishes a criterion for when a tensor product of two simple modules is a highest-$\ell$-weight module using the graph structure.
• The theory provides a new method to determine primality by examining the order type of the vertex set in the $q$-factorization graph.
• The results are formally published in the Canadian Journal of Mathematics, volume 76, pages 594–637.