Abstract
We describe an algorithm for decomposing certain modules attached to real nilpotent orbits into their irreducible components. These modules are prehomogeneous spaces in the sense of Sato and Kimura and arise in the study of nilpotent orbits and the representation theory of Lie groups. The output is a set of LATEX statements that can be compiled in a LATEX environment in order to produce tables. Although the algorithm is used to solve the problem in the case of exceptional real reductive Lie groups of inner type it does describe these spaces for the classical cases of inner type also. Complete tables for the exceptional groups can be found at http://www.math.umb.edu/~anoel/publications/tables/.
| Original language | English |
|---|---|
| Pages (from-to) | 512-521 |
| Number of pages | 10 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 3482 |
| Issue number | III |
| DOIs | |
| State | Published - 2005 |
| Event | International Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore Duration: May 9 2005 → May 12 2005 |
ASJC Scopus Subject Areas
- Theoretical Computer Science
- General Computer Science
Fingerprint
Dive into the research topics of 'A LiE subroutine for computing prehomogeneous spaces associated with real nilpotent orbits'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS