Totally ordered pseudo q-factorization graphs and prime factorization
Abstract
In an earlier publication, the last two authors showed that a finite-dimensional module for a quantum affine algebra of type whose -factorization graph is totally ordered is prime. In this paper, we continue the investigation of the role of totally ordered pseudo -factorization graphs in the study of the monoidal structure of the underlying abelian category. We introduce the notions of modules with (prime) snake support and of maximal totally ordered subgraphs decompositions. Our main result shows that modules with snake support have unique such decomposition and that it determines the corresponding prime factorization. Along the way, we also prove that prime snake modules (for type ) can be characterized as the modules for which every pseudo -factorization graph is totally ordered.
Keywords
Cite
@article{arxiv.2410.01519,
title = {Totally ordered pseudo q-factorization graphs and prime factorization},
author = {Matheus Brito and Adriano Moura and Clayton Silva},
journal= {arXiv preprint arXiv:2410.01519},
year = {2025}
}