Algorithms compute nilpotent orbits in highest weight modules of classical Lie algebras, highlighting computational efficiency.
Let be a classical complex simple Lie algebra, and let be the irreducible highest weight module of with the highest weight , where is half the sum of positive roots. The associated variety of the annihilator ideal of is known as the annihilator variety of . It is established by Joseph that the annihilator variety of a highest weight module is the Zariski closure of a nilpotent orbit in . However, describing this nilpotent orbit for a given highest weight module can be quite challenging. In this paper, we present some efficient algorithms based on the Robinson–Schensted insertion algorithm to compute these orbits for classical Lie algebras. Our formulae are given by introducing two algorithms, that is, bipartition algorithm and partition algorithm. To get a special or metaplectic special partition from a domino type partition, we define the H‐algorithm based on the Robinson–Schensted insertion algorithm. By using this H‐algorithm, we can easily determine this nilpotent orbit from the information of .
No takes yet. Share an insight, caveat, or question.
Bai et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: