On divisible weighted Dynkin diagrams and reachable elements

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages; v2 minor corrrections; final version, to appear in Transformation Groups (2010)

Scientific paper

Let D(e) denote the weighted Dynkin diagram of a nilpotent element $e$ in complex simple Lie algebra $\g$. We say that D(e) is divisible if D(e)/2 is again a weighted Dynkin diagram. (That is, a necessary condition for divisibility is that $e$ is even.) The corresponding pair of nilpotent orbits is said to be friendly. In this note, we classify the friendly pairs and describe some of their properties. We also observe that any subalgebra sl(3) in $\g$ determines a friendly pair. Such pairs are called A2-pairs. It turns out that the centraliser of the lower orbit in an A2-pair has some remarkable properties. Let $Gx$ be such an orbit and $h$ a characteristic of $x$. Then $h$ determines the Z-grading of the centraliser $z=z(x)$. We prove that $z$ is generated by the Levi subalgebra $z(0)$ and two elements in $z(1)$. In particular, (1) the nilpotent radical of $z$ is generated by $z(1)$ and (2) $x\in [z,z]$. The nilpotent elements having the last property are called reachable.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On divisible weighted Dynkin diagrams and reachable elements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On divisible weighted Dynkin diagrams and reachable elements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On divisible weighted Dynkin diagrams and reachable elements will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-380559

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.