Báo cáo toán học: "The combinatorics of orbital varieties closures of nilpotent order 2 in sl n" docx

The combinatorics of orbital varieties closures of nilpotent order 2 in sl n Anna Melnikov* Department of Mathematics, University of Haifa, 31905 Haifa, Israel and Department of Mathematics, the Weizmann Institute of Science, 76100 Rehovot, Israel melnikov@math.haifa.ac.il Submitted: Sep 12, 2002; Accepted: Apr 28, 2005; Published: May 6, 2005 Mathematics Subject Classifications: 05E10, 17B10 Abstract. We consider two partial orders on the set of standard Young tableaux. The first one is induced to this set from the weak right order on symmetric group by Robinson-Schensted algorithm. The second one is induced to it from the dominance order on Young diagrams by considering a Young tableau as a chain of Young diagrams. We prove that these two orders of completely different nature coincide on the subset of Young tableaux with 2 columns or with 2 rows. This fact has very interesting geometric implications for orbital varieties of nilpotent order 2 in special linear algebra sl n . 1. Introduction 1.1 Let S n be a symmetric group, that is a group of permutations of {1, 2, ,n}. Respectively, let S n be a group of permutations of n positive integers {m 1 <m 2 < < m n } where m i ≥ i. It is obvious that there is a bijection from S n onto S n obtained by m i → i, so we will use the notation S n in all the cases where the results apply to both S n and S n . In this paper we write a permutation in a word form w =[a 1 ,a 2 , ,a n ] , where a i = w(m i ). (∗). All the words considered in this paper are permutations, i.e. with distinct letters only. Set p w (m i ):=j if a j = m i , in other words, p w (m i ) is the place (index) of m i in the word form of w. (If w ∈ S n then p w (i)=w −1 (i).) * Supported in part by the Minerva Foundation, Germany, Grant No. 8466 the electronic journal of combinatorics 12 (2005) #R21 1 We consider the right weak (Bruhat) order on S n that is we put w D ≤ y if for all i, j :1≤ i<j≤ n the condition p w (m j ) <p w (m i ) implies p y (m j ) <p y (m i ). Note that [m 1 ,m 2 , ,m n ] is the minimal word and [m n ,m n−1 , ,m 1 ] is the maximal word in this order. 1.2 Let λ =(λ 1 ≥ λ 2 ≥···≥λ k > 0) be a partition of n and λ  := (λ  1 ≥ λ  2 ≥···≥ λ  l > 0) the conjugate partition, that is λ  i = {j | λ j ≥ i}. In particular, λ  1 = k. We define the corresponding Young diagram D λ of λ to be an array of k columns of boxes starting from the top with the i-th column containing λ i boxes. Note that it is more customary that λ defines the rows of the diagram and λ  defines the columns, but in the present context we prefer this convention for the simplicity of notation. Let D n denote the set of all Young diagrams with n boxes. We use the dominance order on partitions. It is a partial order defined as follows. Let λ =(λ 1 , ···,λ k )andµ =(µ 1 , ···,µ j ) be partitions of n. Set λ ≥ µ if for each i :1≤ i ≤ min(j, k) one has i  m=1 λ m ≥ i  m=1 µ m . 1.3 Fill the boxes of the Young diagram D λ with n distinct positive integers m 1 < m 2 < <m n . If the entries increase in rows from left to right and in columns from top to bottom, we call such an array a Young tableau or simply a tableau. If the numbers in a tableau form the set of integers from 1 to n, the tableau is called standard. Let T n denote the set of tableaux with n positive entries {m 1 <m 2 < < m n } where m i ≥ i, and respectively let T n denote the set of standard tableaux. Again, the bijection from T n onto T n is obtained by m i → i, and we will use the notation T n in all the cases where the results apply to both T n and T n . The Robinson-Schensted algorithm (cf. [Sa,§3], or [Kn, 5.1.4], or [F, 4.1] ) gives the bijection w → (T (w),Q(w)) from S n onto the set of pairs of tableaux of the same shape. For each T ∈ T n set C T = {w | T (w)=T }. It is called a Young cell. The right weak order on S n induces a natural order relation D ≤ on T n as follows. We say that T D ≤ S if there exists a sequence of tableaux T = P 1 , ,P k = S such that for each j :1≤ j<kthere exists a pair w ∈C P j ,y∈C P j+1 satisfying w D ≤ y. I would like to explain the notation D ≤ . I use it in honor of M. Duflo who was the first to discover the implication of the weak order on Weyl group for the primitive spectrum of the corresponding enveloping algebra (cf. [D]). I would like to use the notation since his result was the source of my personal interest to the different combinatorial orderings of Young tableaux. Consider S n as a Weyl group of sl n (C). By Duflo, there is a surjection from S n onto the set of primitive ideals (with infinitesimal character). Let us define the corresponding primitive ideal by I w . By [D], w D ≤ y implies I w ⊆ I y . As it was shown by A. Joseph [J], I w and I y coincide iff w and y are in the same Young cell. Together these two facts show that the order D ≤ is well defined on T n . the electronic journal of combinatorics 12 (2005) #R21 2 As shown in [M1, 4.3.1], one may have T,S ∈ T n for which T D <S;yetforany w ∈C(T ),y∈C(S) one has w  D <y.Thus, it is essential to define it through the sequence of tableaux. 1.4 Take T ∈ T n and let sh (T) be the underlying diagram of T. We will write it as sh (T )=(λ 1 , ,λ k )whereλ i is the length of the i−th column. Given i, j :1≤ i< j ≤ n we define π i,j (T ) to be the tableau obtained from T by removing m 1 , ,m i−1 and m j+1 , ,m n by “jeu de taquin” (cf. [Sch] or 2.10). Put D i,j (T ):=sh(π i,j (T )). We define the following partial order on T n whichwecallthechainorder. WesetT C ≤ S if for any i, j :1≤ i<j≤ n one has D i,j (T ) ≤ D i,j (S). This order is obviously well defined. 1.5 The above constructions give two purely combinatorial orders on T n which are moreover of an entirely different nature. Given two partial orders a ≤ and b ≤ on the same set S, call b ≤ an extension of a ≤ if s a ≤t implies s b ≤t for any s, t ∈ S. As we explain in 1.11, C ≤ is an extension of D ≤ on T n . Moreover, these two orders coincide for n ≤ 5and C ≤ is a proper extension of D ≤ for n ≥ 6, as shown in [M]. There is a significant simplification when one considers only tableaux with two columns. Let us denote the subset of tableaux with two columns in T n by T 2 n . We show that for S, T ∈ T 2 n one has T C ≤ S if and only if T D ≤ S. Moreover, for any T ∈ T 2 n we construct a canonical representative w T ∈C T such that T C <Sif and only if w T D <w S . 1.6 Given a set S and a partial order a ≤, the cover of t ∈ S in this order is the set of all s ∈ S such that t a <s and there is no p ∈ S such that t a <p a <s. We will denote it by D a (t). As explained in [M1], in general, even an inductive description of D D (T )isavery complex task. Yet, in 3.16 we provide the exact description of D D (T )(whichisacover in C ≤ as well) for any T ∈ T 2 n . 1.7 For each tableau T let T † denote the transposed tableau. Obviously, T C <Siff S † C <T † . By Schensted-Sch¨utzenberger theorem (cf. 2.14), it is obvious that T D <Siff S † D <T † . Consequently, the above results can be translated to tableaux with two rows. 1.8 Let us finish the introduction by explaining why these two orders are of interest and what implication our results have for the theory of orbital varieties. Orbital varieties arose from the works of N. Spaltenstein ([Sp1] and [Sp2]), and R. Steinberg ([St1] and [St2]) during their studies of the unipotent variety of a semisimple group G. Orbital varieties are the translation of these components from the unipotent variety of G to the nilpotent cone of g =Lie(G). They are defined as follows. Let G be a connected semisimple finite dimensional complex algebraic group. Let g be its Lie algebra and U(g) be the enveloping algebra of g. Consider the adjoint action of G on g. Fix some triangular decomposition g = n  h  n − . A G orbit O the electronic journal of combinatorics 12 (2005) #R21 3 in g is called nilpotent if it consists of nilpotent elements, that is if O = G x for some x ∈ n. The intersection O∩n is reducible. Its irreducible components are called orbital varieties associated to O. They are Lagrangian subvarieties of O. Accordingtotheorbit method philosophy, they should play an important role in the representation theory of corresponding Lie algebras. Indeed, they play the key role in the study of primitive ideals in U(g). They also play an important role in Springer’s Weyl group representations described in terms of fixed point sets B u where u is a unipotent element acting on the flag variety B. Orbital varieties are very interesting objects from the point of view of algebraic ge- ometry. Given an orbital variety V, one can easily find the nilradical m V of a standard parabolic subalgebra of the smallest dimension containing V. Consider an orbital vari- ety closure as an algebraic variety in the affine linear space m V . Then the vast majority of orbital varieties are not complete intersections. So, orbital varieties are examples of algebraic varieties which are both Lagrangian subvarieties and not complete intersec- tions. 1.9 There are many hard open questions involving orbital varieties. Their only general description was given by R. Steinberg [St1]. Let us explain it briefly. Let R ⊂ h ∗ denote the set of non-zero roots, R + the set of positive roots corre- sponding to n and Π ⊂ R + the resulting set of simple roots. Let W be the Weyl group for the pair (g, h). For any α ∈ R let X α be the corresponding root space. For S, S  ⊂ R and w ∈ W set S ∩ w S  := {α ∈ S : α ∈ w(S  )}. Then set n ∩ w n :=  α∈R + ∩ w R + X α . This is a subspace of n. For each closed irreducible subgroup H of G let H(n ∩ w n)be the set of H conjugates of n ∩ w n. It is an irreducible locally closed subvariety. Let ∗ denote the (Zariski) closure of a variety ∗. Since there are only finitely many nilpotent orbits in g, it follows that there exists auniquenilpotentorbitwhichwedenotebyO w such that G(n ∩ w n)=O w . Let B be the standard Borel subgroup of G, i.e. such that Lie (B)=b = h  n. A result of Steinberg [St1] asserts that V w := B(n ∩ w n) ∩O w is an orbital variety and that the map ϕ : w → V w is a surjection of W onto the set of orbital varieties. The fibers of this mapping, namely ϕ −1 (V)={w ∈ W : V w = V} are called geometric cells. This description is not very satisfactory from the geometric point of view since a B invariant subvariety generated by a linear space is a very complex object. For example, one can describe the regular functions (differential operators) on V w or on V w only in some special cases. 1.10 On the other hand, there exists a very nice combinatorial characterization of orbital varieties in sl n in terms of Young tableaux. Indeed, in that case V w and V y coincide iff w and y are in the same Young cell. Moreover, let O w = GV w be the corresponding nilpotent orbit, then its Jordan form is defined by µ =(shT w )  . Let us denote such orbit by O µ . Recall the order relation on Young diagrams from 1.2. A result of Gerstenhaber (see [H, §3.10] for example) describes the closure of a nilpotent orbit. the electronic journal of combinatorics 12 (2005) #R21 4 Theorem. Let µ be a partition of n. One has O µ =  λ|λ≥µ O λ 1.11 Define geometric order on T n by T G ≤ S if V S ⊂ V T . In general, the combinatorial description of this order is an open (and very difficult) task. On the other hand, both D ≤ and C ≤ are connected to G ≤ as follows. Let us identify n with the subalgebra of strictly upper-triangular matrices. Any α ∈ R + can be decomposed into the sum of simple roots α =  j−1 k=i α k where i<j. Then the root space X α is identified with X i,j . By [JM, 2.3], X i,j ∈ n∩ w n if and only if p w (i) <p w (j). Thus, w D ≤ y implies n∩ y n ⊂ n ∩ w n, hence, also V y ⊂ V w and O y ⊂ O w . Therefore, G ≤ is an extension of D ≤ on T n . On the other hand, note that T G ≤ S implies, in particular, the inclusion of cor- responding orbit closures so that (via Gerstenhaber’s construction) T G ≤ S implies sh (T ) ≤ sh (S). As shown in [M1, 4.1.1], the projections on the Levi factor of stan- dard parabolic subalgebras of g preserve orbital variety closures. Moreover, in the case of sl n one has π i,j (V T )=V π i,j (T ) for any i, j :1≤ i<j≤ n where π i,j (T ) is obtained from T by jeu de taquin and V π i,j (T ) is an orbital variety in the corresponding Levi factor. Thus, T G ≤ S implies π i,j (T ) G ≤ π i,j (S). Altogether, this provides that C ≤ is an extension of G ≤ . Consequently, C ≤ is an extension of G ≤ and G ≤ is an extension of D ≤ . All three orders coincide for n ≤ 5, and C ≤ is a proper extension of G ≤ which is, in turn, a proper extension of D ≤ for n ≥ 6 as shown in [M]. However, our results show that D ≤ and C ≤ coincide on T 2 n and there they provide a full combinatorial description of G ≤ . Consider V T where T ∈ T 2 n . For any X ∈V T one has X ∈O sh (T ) ,thatisX is an element of nilpotent order 2 or in other words X 2 =0. Thus, we get a complete combinatorial description of inclusion of orbital varieties closures of nilpotent order 2 in sl n . 1.12 The body of the paper consists of two sections. In section 2 we explain all the background in combinatorics of Young tableaux essential in the subsequent analysis and set the notation. In particular, we explain Robinson-Schensted insertion from the left and jeu de taquin. I hope this part makes the paper self-contained. In section 3 we work out the machinery for comparing D ≤ and C ≤ and show that they coincide. The main technical result of the paper is stated in 3.5 and proved in 3.11. Further in 3.12, 3.13 and 3.14 we explain the implications of this result for D ≤, G ≤ the electronic journal of combinatorics 12 (2005) #R21 5 and C ≤ . In 3.16 we give the exact description of D G (T )forT ∈ T 2 n . Finally, in 3.17 we explain the corresponding facts for the tableaux with two rows. 2. Combinatorics of Young tableaux 2.1 Recall from 1.1 (∗) the presentation of w ∈ S n in the word form. Given w ∈ S n , set τ(w):={i : p w (i +1)<p w (i)}, that is τ(w) is the set of left descents of w. Note that if w D ≤ y then τ(w) ⊆ τ (y). 2.2 Given a word or a tableau ∗,wedenoteby∗ the set of its entries. Introduce the following useful notational conventions. (i) For m ∈w set w \{m} to be the word obtained from w by deleting m, that is if m = a i then w \{m} := [a 1 , ,a i−1 ,a i+1 , ,a n ]. (ii) For the words x =[a 1 , ,a n ]andy =[b 1 , ,b m ] such that x∩y = ∅ we define a colligation [x, y]:=[a 1 , ,a n ,b 1 , ,b m ]. (iii) For a word w =[a 1 , ,a n ] set w to be the word with reverse order, that is w := [a n ,a n−1 , ,a 1 ]. Given i, j :1≤ i<j≤ n, set S i,j to be a (symmetric) group of per- mutations of {m k } j k=i . Let us define projection π i,j : S n → S i,j by omitting all the letters m 1 , ,m i−1 and m j+1 , ,m n from word w ∈ S n , i.e. π i,j (w)=w \ {m 1 , ,m i−1 ,m j+1 , ,m n }. For w ∈ S n it is obvious that τ (π i,j (w)) = τ (w)∩{k} j−1 k=i . Lemma. Let w, y be in S n . (i) For any a ∈ {m i } n i=1 one has w D ≤ y iff [a, w] D ≤ [a, y]. (ii) For w, y such that π 1,n−1 (y)=π 1,n−1 (w) and p w (m n )=1,p y (m n ) > 1 one has w D >y. (iii) w D <yiff y D < w. (iv) If w D ≤ y then π i,j (w) D ≤ π i,j (y) for any i, j :1≤ i<j≤ n. All four parts of the lemma are obvious. 2.3 We will use the following notation for tableaux. Let T be a tableau and let T i j for i, j ∈ N denote the entry on the intersection of the i-throwandthej-th column. Given u an entry of T , set r T (u)tobethenumberoftherow,u belongs to and c T (u)tobe the number of the column, u belongs to. Set τ(T ):={i : r T (i +1)>r T (i)}. Let T i denote the i-th column of T. Let ω i (T ) denote the largest entry of T i . We consider a tableau as a matrix T := (T j i ) and write T by columns: T = (T 1 , ···,T l ) For i, j :1≤ i<j≤ l we set T i,j to be a subtableau of T consisting of columns from i to j,thatisT i,j =(T i , ···,T j ). For each tableau T let T † denote the transposed tableau. Note that sh (T † )=sh(T)  . the electronic journal of combinatorics 12 (2005) #R21 6 2.4 Given D λ ∈ D n with λ =(λ 1 , ···,λ j ), we define a corner box (or simply, a corner) of the Young diagram to be a box with no neighbours to right and below. For example, in D below all the corner boxes are labeled by X. D = X X X The entry of a tableau in a corner is called a corner entry. Take D λ with λ =(λ 1 , ···,λ k ). Then there is a corner entry ω i (T ) at the corner c with coordinates (λ i ,i)iffλ i+1 <λ i . 2.5 We now define the insertion algorithm. Consider a column C =   a 1 . . . a r   . Given j ∈ N + \C,leta i be the smallest entry greater then j, if exists. Set j → C :=                                                a 1 . . . a i−1 j a i+1 . . .           ,j C = a i if j<a r      a 1 . . . a r j      ,j C = ∞ if j>a r or C = ∅ Put also ∞→C = C. The inductive extension of this operation to a tableau T with l columns for j ∈ N + \T  given by j ⇒ T =(j → T 1 ,j T 1 ⇒ T 2,l ) is called the insertion algorithm. Note that the shape of j ⇒ T is the shape of T obtained by adding one new corner. The entry of this corner is denoted by j T . This procedure (like many others used here) is described in the wonderful book of B.E. Sagan ([Sa]). 2.6 Let w =[a 1 ,a 2 , ,a n ] be a word. According to Robinson-Schensted algorithm we associate an ordered pair of tableaux (T (w),Q(w)) to w. The procedure is fully explained the electronic journal of combinatorics 12 (2005) #R21 7 in many places, for example, in [Sa, §3], [Kn, 5.1.4] or [F,4.1]. Here we explain only the inductive procedure of constructing the first tableau T (w) by insertions from the left. In what follows we call it RS procedure. (1) Set 1 T (w)=(a n ). (2) Set j+1 T (w)=a n+1−j ⇒ j T (w) . (3) Set T (w)= n T (w) . For example, let w =[2, 5, 1, 4, 3], then 1 T (w)= 3 2 T (w)= 3 4 3 T (w)= 13 4 4 T (w)= 13 4 5 T (w)= 5 T (w)= 13 24 5 The result due to Robinson and Schensted implies the map ϕ : w → T (w)isa surjection from S n onto T n . 2.7 For T ∈ T n one has (cf. for example, [M1, 2.4.14]) τ(T (w)) = τ(w). Thus, by 2.1 one has Lemma. Let S, T ∈ T n . If T D ≤ S then τ(T ) ⊆ τ (S). 2.8 Let us describe a few algorithms connected to RS procedure which we use for proofs and constructions. First let us describe some operations for columns and tableaux. Consider a column C =  a 1 . . .  . (i) For m ∈C set C \{m} to be a column obtained from C by deleting m. (ii) For j ∈ N,j∈ C set C + {j} to be a column obtained from C by adding j at the right place of C,thatisifa i is the greatest element of C smaller than j then C + {j} is obtained from C by adding j between a i and a i+1 . (iii) We define a pushing left operation. Again let j ∈ N,j∈ C and j>a 1 . Let a i be the greatest entry of C smaller than j and set : C ← j :=          a 1 . . . a i−1 j a i+1 . . .          ,j C := a i . the electronic journal of combinatorics 12 (2005) #R21 8 The last operation is extended to a tableau T by induction on the number of columns. Let T m be the last column of T and assume T 1 m <j.Then T ← j = (T 1,m−1 ← j T m ,T m ← j). We denote by j T the element pushed out from the first column of the tableau in the last step. 2.9 The pushing left operation gives us a procedure of deleting a corner inverse to the insertion algorithm. This is also described in many places, in particular, in all three books mentioned above. As a result of insertion, we get a new tableau of a shape obtained from the old one just by adding one corner. As a result of deletion, we get a new tableau of a shape obtained from the old one by removing one corner. Let T =(T 1 , ,T l ). Recall the definition of ω i (T ) from 2.3. Assume λ i >λ i+1 and let c = c(λ i ,i) be a corner of T on the i-th column. To delete the corner c we delete ω i (T ) from the column T i and push it left through the tableau T 1,i−1 . The element pushed out from the tableau is denoted by c T . This is written T ⇐ c := (T 1,i−1 ← ω i (T ),T i \{ω i (T )},T i+1,l ) For example, 13 24 5 ⇐ c(2, 2) = 13 4 5 ,c T =2. Note that insertion and deletion are indeed inverse since for any T ∈ T n c T ⇒ (T ⇐ c)=T and (j ⇒ T ) ⇐ j T = T (for j ∈ T ) Note that sometimes we will write T ⇐ a where a is a corner entry just as we have written above. Let {c i } j i=1 be a set of corners of T. By Robinson-Schensted procedure, one has C T = j  i=1  y  ∈C T ⇐c i [c T i ,y  ]. (∗) 2.10 Let us describe the jeu de taquin procedure (see [Sch]) which removes T i j from T. The resulting tableau is denoted by T \{T i j }. The idea of jeu de taquin is to remove T i j from the tableau and to fill the gape created so that the resulting object is again a tableau. The procedure goes as following. Remove a box from the tableau. Examine the content of the box to the right of the removed box and that of the box below of the removed box. Slide the box containing the smaller of these two numbers to the vacant position. Now repeat this procedure to fill the hole created by the slide. Repeat the process until no holes remain, that is until the hole has worked itself to the corner of the tableau. The result due to M. P. Sch¨utzenberger [Sch] gives the electronic journal of combinatorics 12 (2005) #R21 9 Theorem. If T is a Young tableau then T \{T i j } is a Young tableau and the elimination of different entries from T by jeu de taquin is independent of the order chosen. Therefore, given i 1 , ,i s ∈T ,atableauT \{i 1 , ,i s } is a well defined tableau. For example, let us take T = 125 34 6 Then a few tableaux obtained from T byjeudetaquinare T \{6} = 125 34 ,T\{3} = 125 4 6 ,T\{1, 2} = 345 6 . 2.11 Given s, t :1≤ s<t≤ n, set T s,t to be a set of Young tableaux with the entries {m k } t k=s . Let us define projection π s,t : T n → T s,t by π s,t (T )=T \ {m 1 , ,m s−1 ,m t+1 , ,m n }. As a straightforward corollary of 2.10 (cf. for example, [M1, 4.1.1]), we get Theorem. for any s, t :1≤ s<t≤ n one has π s,t (T (w)) = T (π s,t (w)). 2.12 As a straightforward corollary of lemma 2.2 (iv) and theorem 2.11, we get that D ≤ is preserved under projections and, as a straightforward corollary of lemma 2.2 (i) and RS procedure, we get that D ≤ is preserved under insertions, namely Proposition. Let T,S be in T n . If T D ≤ S then (i) for any s, t :1≤ s<t≤ n one has π s,t (T ) D ≤ π s,t (S). (ii) for any a ∈ {m s } n s=1 one has a ⇒ T D ≤ a ⇒ S. 2.13 Consider T ∈ T n . Note that π i,i+1 (T )=                    i i+1 if i ∈ τ(T ) ii+1 if i ∈ τ(T ) We need the following properties of the chain order. the electronic journal of combinatorics 12 (2005) #R21 10 [...]... [M] A Melnikov, Robinson-Schensted procedure and combinatorial properties of geometric order in sl( n), C.R.A.S I, 315 (19 92) , 709-714 the electronic journal of combinatorics 12 (20 05) #R21 19 [M1] A Melnikov, On orbital variety closures in sln I Induced Duflo order, J of Algebra, 27 1, 20 04, pp 179 -23 3 [Sa] B.E Sagan, The Symmetric Group, Graduate Texts in Mathematics 20 3, Springer 20 00 [Sch] M P Sch¨... from theorem C 3.11 since VS ⊂ V T implies by 1.11 S > T 3.14 Theorem 3.11 and corollary 3. 12 provide us also C D Corollary ≤ and ≤ coincide on orbital varieties of nilpotent order 2 3.15 Note that lemma 3.9 together with theorem 3.11 give the exact description of inclusion of orbital variety closures of nilpotent order 2 in terms of Young tableaux G D C Since ≤, ≤, and ≤ coincide on T2 we will denote... de Robinson, LN in Math 597 u (1976), 59-113 [Sp1] N.Spaltenstein, The fixed point set of a unipotent transformation on the flag manifold, Proc Konin Nederl Akad 79 (1976), 4 52- 456 [Sp2] N Spaltenstein, Classes unipotentes de sous-groupes de Borel, LN in Math 964 (19 82) , Springer-Verlag [St1] R Steinberg, On the desingularization of the unipotent variety, Invent Math 36 (1976), 20 9 -22 4 [St2] R Steinberg,... (S) > 2 (S) Assume cS (n) = 2 Then by lemma 3.1 c 2, n (S) (n) = 2 On the other hand, c 2, n (T ) (n) = 1 by the induction assumption, and this is a contradiction 3.3 As a corollary of lemma 3 .2, we get Corollary For S, T ∈ T2 one has n (i) If T = S and sh T = sh S then T and S are incompatible in the chain order C (ii) If S > T then S1 ⊃ T1 and S2 ⊂ T2 the electronic journal of combinatorics 12 (20 05)... tion is obvious from theorem 3.11 since T < S implies T < S 3.13 As well, we get the following geometric fact from this purely combinatorial theorem Corollary For orbital varieties VT , VS of nilpotent order 2 one has VS ⊂ V T if and only if n ∩wS n ⊂ n ∩wT n that the inclusion of orbital variety closures is determined by inclusion of generating subspaces Proof Again one implication is obvious from... Soc 22 2 (1976), 1- 32 [J] A Joseph, Towards the Jantzen conjecture, Comp Math 40, 1980, pp 35-67 [JM] A Joseph, A Melnikov, Quantization of hypersurface orbital varieties in sln , The orbit method in geometry and physics In honor of A.A Kirillov, series “Progress in Mathematics”, 21 3, Birkhauser, 20 03, 165-196 [Kn] D E Knuth, “The art of computer programming,” Vol.3, Addison-Wesley (1969), 49- 72 [M]... n ∩wT n D C (iv) Orders ≤ and ≤ coincide on (T2 )† n Acknowledgments The problem of combinatorial description of inclusion of orbital variety closures in terms of Young tableaux as well as the idea of the chain order and induced right weak order on Young tableaux were suggested by A Joseph I would like to thank him for this and for the fruitful discussions through various stages of this work I would... proposition 2. 13 (i) n − 1 ∈ τ (T ) so that cT (n − 1) = 1 and ω1 (T ) = ω1 (S) = n − 1 the electronic journal of combinatorics 12 (20 05) #R21 14 3.9 Let S be a tableau with two columns For x ∈ S2 recall notion S{x} from 3.5 Since x is 2 (S{x}) we consider S{x} ⇐ x and get xS{x} (as defined in 2. 9) Obviously, xS{x} is some element of S1 D Lemma Let T, S ∈ T2 wT < wS iff S2 ⊂ T2 and for any x ∈ S2 one has... by induction hypothesis π1,n−3 (T ) < π1,n−3 (S ) To complete the proof we have C to show that 2, n−1 (T ) ≤ 2, n−1 (S ) Indeed, set P C = 2, n (P ) where P is T or S Since S > T one has λ1 (S) > 2 (S) Thus, S satisfies conditions (i) and (ii) of lemma 3.1, so that cS (n) = 2 This implies in turn by lemma 3 .2 that cT (n) = 2 C In particular, this provides 2, n−1 (P ) = P ⇐ n Hence, 2, n−1 (T ) ≤ 2, n−1... ∈ T2 set T {s} := T(i) the electronic journal of combinatorics 12 (20 05) #R21 12 For example, let 1 3 2 5 4 6 T = 7 then 1 T(6) = T(7) ⇐ 7 = 2 5 4 T(7) = T, z7 = 7; 3 6 1 3 T(5) = T(6) ⇐ 6 = 2 5 , a7 = 7, z6 = 6, T {6} = T(6) ; , a6 = 4, z5 = 6; 6 1 3 2 T(4) = T(5) ⇐ 6 = 5 T(3) = T(4) ⇐ 5 = , a5 = 6, z4 = 5, T {5} = T(4) ; 1 3 , a4 = 2, z3 = 5; 5 T (2) = T(3) ⇐ 5 = 1 3 , a3 = 5, z2 = 3, T {3} = T (2) . element of nilpotent order 2 or in other words X 2 =0. Thus, we get a complete combinatorial description of inclusion of orbital varieties closures of nilpotent order 2 in sl n . 1. 12 The body of. The combinatorics of orbital varieties closures of nilpotent order 2 in sl n Anna Melnikov* Department of Mathematics, University of Haifa, 31905 Haifa, Israel and Department of Mathematics, the. Young tableaux with 2 columns or with 2 rows. This fact has very interesting geometric implications for orbital varieties of nilpotent order 2 in special linear algebra sl n . 1. Introduction 1.1