86
Views
1
CrossRef citations to date
0
Altmetric
Research Articles

Three-vertex prime graphs and reality of trees

ORCID Icon &
Pages 4054-4090 | Received 09 May 2022, Accepted 22 Mar 2023, Published online: 07 Apr 2023
 

Abstract

We continue the study of prime simple modules for quantum affine algebras from the perspective of q-fatorization graphs. In this paper we establish several properties related to simple modules whose q-factorization graphs are afforded by trees. The two most important of them are proved for type A. The first completes the classification of the prime simple modules with three q-factors by giving a precise criterion for the primality of a 3-vertex line which is not totally ordered. Using a very special case of this criterion, we then show that a simple module whose q-factorization graph is afforded by an arbitrary tree is real. Indeed, the proof of the latter works for all types, provided the aforementioned special case is settled in general.

2020 MATHEMATICS SUBJECT CLASSIFICATION:

Notes

1 Here we are using p to shorten notation without making any assumption on the sign of mm.

Additional information

Funding

This work was developed as part of the Ph.D. project of the second author, which was supported by a PICME grant. The work of the first author was partially supported by CNPq grants 304261/2017-3 and 402449/2021-5, and Fapesp grant 2018/23690-6. We thank the anonymous referee for useful suggestions.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.