An effective method to compute closure ordering for nilpotent orbits of $\theta$-representations
W.A. de Graaf, E.B. Vinberg, and O.S. Yakimova

TL;DR
This paper introduces an algorithm to compute the closure ordering of nilpotent orbits in $ heta$-representations, aiding the understanding of orbit structures in graded Lie algebras.
Contribution
It presents a novel algorithm specifically designed for calculating the closure of nilpotent orbits in $ heta$-representations derived from graded simple Lie algebras.
Findings
Algorithm effectively computes orbit closures
Applicable to $ heta$-representations from graded Lie algebras
Enhances understanding of nilpotent orbit structures
Abstract
We develop an algorithm for computing the closure of a given nilpotent -orbit in , where and are coming from a or a -grading of a simple complex Lie algebra .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Geometry · Homotopy and Cohomology in Algebraic Topology · Advanced Topics in Algebra
