Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-28T03:52:50.503Z Has data issue: false hasContentIssue false

A CLASSIFICATION OF THE PRINCIPAL NILPOTENT PAIRS IN SIMPLE LIE ALGEBRAS AND RELATED PROBLEMS

Published online by Cambridge University Press:  23 May 2001

ALEXANDER G. ELASHVILI
Affiliation:
Razmadze Mathematics Institute, M. Aleksidze Str. 1, 380093 Tbilisi, Georgia; [email protected]
DMITRI I. PANYUSHEV
Affiliation:
Mathematics Department, MIREA, Prosp. Vernadskogo 78, Moscow 117454, Russia; [email protected]; [email protected]
Get access

Abstract

Let [gfr ] be a semisimple Lie algebra over an algebraically closed field [ ] of characteristic zero and G be its adjoint group. The notion of a principal nilpotent pair is a double counterpart of the notion of a regular (= principal) nilpotent element in [gfr ]. Roughly speaking, a principal nilpotent pair e = (e1, e2) consists of two commuting elements in [gfr ] that can independently be contracted to the origin and such that their simultaneous centralizer has the minimal possible dimension, that is, rk[gfr ]. The definition and the basic results are due to V. Ginzburg [3]. He showed that the theory of principal nilpotent pairs yields a refinement of well-known results by B. Kostant on regular nilpotent elements in [gfr ] and has interesting applications to representation theory. In particular, he proved that the number of G-orbits of principal nilpotent pairs is finite and gave a classification for [gfr ] = [sfr ][lfr ]([ ]). Trying to achieve a greater generality, Ginzburg also introduced a wider class of distinguished nilpotent pairs and, again, classified them for [sfr ][lfr ]([ ]). (The precise definitions for all notions related to nilpotent pairs are found in §1.)

Type
Notes and Papers
Copyright
© The London Mathematical Society 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)