An effective method to compute closure ordering for nilpotent orbits of θ-representations

Abstract

We develop an algorithm for computing the closure of a given nilpotent G0-orbit in 1, where 1 and G0 are coming from a or a /m-grading = i of a simple complex Lie algebra .

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…