Pith. sign in

REVIEW

A computational approach to the Kostant-Sekiguchi correspondence

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1209.5600 v1 pith:7MLSTMF4 submitted 2012-09-25 math.RA

A computational approach to the Kostant-Sekiguchi correspondence

classification math.RA
keywords algebracomplexnilpotentorbitsrealsimplecartancorrespondence
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Let g be a real form of a simple complex Lie algebra. Based on ideas of Djokovic and Vinberg, we describe an algorithm to compute representatives of the nilpotent orbits of g using the Kostant-Sekiguchi correspondence. Our algorithms are implemented for the computer algebra system GAP and, as an application, we have built a database of nilpotent orbits of all real forms of simple complex Lie algebras of rank at most 8. In addition, we consider two real forms g and g' of a complex simple Lie algebra g^c with Cartan decompositions g= k+p and g'=k'+p'. We describe an explicit construction of an isomorphism g -> g', respecting the given Cartan decompositions, which fails if and only if g and g' are not isomorphic. This isomorphism can be used to map the representatives of the nilpotent orbits of g to other realisations of the same algebra.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.