Let Perm ( X ) be the group of permutations on a set X . Let d ∈ Z and d ≥ 2 . The group W = { g ∈ Perm ( [ − d , d ] ∩ Z ) ∣ g ( − i ) = − g ( i ) for all i ∈ [ − d , d ] ∩ Z } is called Weyl group. Any element w ∈ W is uniquely determined by its value on { 1 , 2 , … , d } , and we shall denote w = [ w ( 1 ) , w ( 2 ) , … , w ( d ) ] . It's well known that W is generated by { s 0 , s 1 , … , s d − 1 } , where s 0 = [ − 1 , 2 , … , d − 1 , d ] , s i = [ 1 , … , i − 1 , i + 1 , i , i + 2 , … , d ] , for i = 1 , … , d − 1 . Is the following statement correct?
If w = s i 1 s i 2 … s i k ∈ W with s i k = s 0 and k as small as possible, then w ( 1 ) < 0 .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Problem Loading...
Note Loading...
Set Loading...
See the solution to this problem .