Description of B-orbit closures of order 2 in upper-triangular matrices

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

37 pages -- the extended final version, to appear in Transformation Groups

Scientific paper

Let n_n(C) be the algebra of strictly upper-triangular n x n matrices over the field of complex numbers and X_2 the subset of matrices of nilpotent order 2. Let B_n(C) be the group of invertible upper-triangular matrices acting on n_n(C) by conjugation. Let B(u) be the orbit of u in X_2 with respect to this action. Let S_n^2 be the subset of involutions in the symmetric group S_n. We define a new partial order on S_n^2 which gives the combinatorial description of the closure of B(u). We also construct an ideal I(B(u)) in symmetric algebra S(n_n(C)^* whose variety V(I(B(u))) equals the closure of B(u) (in Zariski topology). We apply these results to orbital varieties of nilpotent order 2 in sl_n(C) in order to give a complete combinatorial description of the closure of such an orbital variety in terms of Young tableaux. We also construct the ideal of definition of such an orbital variety up to taking the radical.

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

Description of B-orbit closures of order 2 in upper-triangular matrices 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 Description of B-orbit closures of order 2 in upper-triangular matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Description of B-orbit closures of order 2 in upper-triangular matrices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-102580

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