An effective method to compute closure ordering for nilpotent orbits of \(\theta\)-representations

We develop an algorithm for computing the closure of a given nilpotent \(G_0\)-orbit in \(\g_1\), where \(\g_1\) and \(G_0\) are coming from a \(\Z\) or a \(\Z/m\Z\)-grading \(\g= \bigoplus \g_i\) of a simple complex Lie algebra \(\g\).

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors de Graaf, W A, Vinberg, E B, Yakimova, O S
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 10.07.2011
Subjects
Algorithms
Lie groups
Online AccessGet full text

Cover

More Information
Summary:We develop an algorithm for computing the closure of a given nilpotent \(G_0\)-orbit in \(\g_1\), where \(\g_1\) and \(G_0\) are coming from a \(\Z\) or a \(\Z/m\Z\)-grading \(\g= \bigoplus \g_i\) of a simple complex Lie algebra \(\g\).
ISSN:2331-8422