Algorithmic modality analysis for parabolic groups (Q1281802)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Algorithmic modality analysis for parabolic groups
scientific article

    Statements

    Algorithmic modality analysis for parabolic groups (English)
    0 references
    0 references
    0 references
    18 June 2000
    0 references
    The authors discuss an algorithm which is used to compute upper bounds for the modality of parabolic subgroups \(P\) of reductive algebraic groups \(G\) over an algebraically closed field (i.e., the maximal number of parameters upon which a family of orbits of the adjoint action of \(P\) on the Lie algebra of its unipotent radical \(P_u\) depends). Using this algorithm, the authors give a classification of \(P\) in simple \(G\) such that the semisimple rank of \(P\) is \(2\) and the modality is \(0\). Some partial results are obtained for parabolic subgroups of semisimple rank \(3\). For exceptional simple \(G\), the authors show that \(P\) has modality \(0\) provided the class of nilpotency of \(P_u\) is at most \(2\). In some small rank cases the value of the modality of Borel subgroups is determined.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithmic modality
    0 references
    linear algebraic groups
    0 references
    Lie algebras
    0 references
    algorithms
    0 references
    parabolic subgroups
    0 references
    adjoint actions
    0 references
    0 references