An Algorithm for Computing Ideals and Conjugacy Classes of Subalgebras of Borel Subalgebras

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Asghar, Nimra Sher, Azad, Hassan
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866929738604347392
author Asghar, Nimra Sher
Azad, Hassan
author_facet Asghar, Nimra Sher
Azad, Hassan
contents In this article, we present a constructive procedure for determining all ideals of the Borel subalgebra of a complex semisimple Lie algebra from its root system or, equivalently, its Dynkin diagram. The proposed algorithmic approach has been implemented in Maple. The Maple code has been tested on Borel subalgebras associated with both classical and exceptional Lie algebras. An interactive procedure is also given to determine conjugacy classes of all subalgebras in the derived algebra of the Borel subalgebra.
format Preprint
id arxiv_https___arxiv_org_abs_2503_00879
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle An Algorithm for Computing Ideals and Conjugacy Classes of Subalgebras of Borel Subalgebras
Asghar, Nimra Sher
Azad, Hassan
Representation Theory
In this article, we present a constructive procedure for determining all ideals of the Borel subalgebra of a complex semisimple Lie algebra from its root system or, equivalently, its Dynkin diagram. The proposed algorithmic approach has been implemented in Maple. The Maple code has been tested on Borel subalgebras associated with both classical and exceptional Lie algebras. An interactive procedure is also given to determine conjugacy classes of all subalgebras in the derived algebra of the Borel subalgebra.
title An Algorithm for Computing Ideals and Conjugacy Classes of Subalgebras of Borel Subalgebras
topic Representation Theory
url https://arxiv.org/abs/2503.00879