GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n

Size: px
Start display at page:

Download "GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n"

Transcription

1 GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n KANG LU FINITE DIMENSIONAL REPRESENTATIONS OF gl n Let e j,, j =,, n denote the standard bass of the general lnear Le algebra gl n over the feld of complex numbers The subalgebra gl n s spanned by the bass elements e j wth, j =,, n Denote by h = h n the dagonal Cartan subalgebra n gl n The elements e,, e nn form a bass of h Fnte-dmensonal rreducble representatons of gl n are n a one-to-one correspondence wth n-tuples of complex numbers λ = (λ,, λ n ) such that () λ λ + Z + for =,, n Such an n-tuple λ s called the hghest weght of the correspondng representaton whch we shall denote by L(λ) It contans unque, up to a multple, nonzero vector v + (the hghest vector) such that e v + = λ v + for =,, n and e j v + = 0 for < j n BGG RESOLUTION Last semnar, we talked about the BGG resoluton Now let us recall the BGG resoluton and deduce the Weyl character formula from t Denote by M λ the Verma module wth hghest weght λ Let W be the Weyl group and s be the smple refectons, =,, rank g and ρ s the Weyl vector Defne the shfted acton of the Weyl group on h by w λ = w(λ + ρ) ρ Denote P + and Φ + the set of all domnant ntegral weghts and the set of all postve roots of g Theorem ([BGG]) Let λ P + Then there exsts a lon exact sequence () 0 M w0 λ M s λ M λ L(λ) 0 w W,l(w)=k M w λ where l(w) s the length of an element w W, and w 0 s the longest element of the Weyl group Now we are gong to deduce the Weyl character formula from Theorem Note that the character of M λ s ch(m λ ) = q λ α Φ + q α = qλ ( + q α + q α + ) α Φ + Snce character s addtve, we can take the alternatng sum wth respect to character n () It follows that () ch(l(λ)) = ( ) w ch(m w λ ) = w W( ) w q w λ w W α Φ +( q α ) Let λ = 0, we have ( q α ) = α Φ + w W ( ) w q wρ ρ

2 KANG LU It follows that (3) ch(l(λ)) = w W( ) w q w(λ+ρ) w W ( ) w q wρ, whch s the celebrated Weyl character formula Snce we are nterested n the case g = gl n We know that W s the symmetrc group S n Also, we have ρ = (n,,, 0) If we wrte x for q (0,,,,0), where (0,,,, 0) has all components zero except for the -th component Then we can rewrte (3) as ch(l(λ)) = det ( x λ ) +n j,j n det ( x n j ) = S λ (x,, x n ),,j n where S λ s exactly the Schur polynomal Our next goal s to deduce the Branchng rule for the reducton gl n gl n from Schur polynomal Frst we need the followng proposton Proposton We have where µ runs over all parttons such that S λ (x,, x n, x n = ) = S µ (x,, x n ), µ λ µ λ µ λ n µ n λ n Proof We prove t only for the case n = 3 And from ths we can defntely get the dea to prove t for general n Let λ = (λ, λ, λ 3 ), λ Z + We have x λ + x λ + x λ 3 S λ (x, x, x 3 ) = x λ + (x x )(x x 3 )(x x 3 ) x λ + x λ 3 x λ + 3 x λ + 3 x λ 3 3 Settng x 3 =, we have x λ + x λ + x λ 3 S λ (x, x, ) = (x x )(x )(x ) x λ + x λ + x λ 3 Subtractng the nd column from the st, and then 3rd column from the nd, we get x λ + S λ (x, x, ) = x λ + x λ + x λ 3+ (x x )(x )(x ) x λ + x λ + x λ + x λ 3+ We see that the st row can be dvded by x, and the second one by x Note that for a, b Z + such that a > b: x a x b x = x a c:b c<a We see that by dvdng by x n the frst row n the frst place we get a sum whch can be wrtten as x µ+ = x µ+ λ + µ +<λ + λ µ λ

3 GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n 3 We choose to call the summaton ndex µ + so that we wll have the desred result Consderng three other matrx elements n a smlar way, we conclude the proof Corollary 3 We have where µ runs over all parttons such that S λ (x,, x n, x n ) = S µ (x,, x n )x λ µ n, µ λ µ λ µ λ n µ n λ n From Proposton, one can easly get the branchng rule for the reducton gl n gl n Theorem 4 The restrcton of L(λ) to the subalgebra gl n s somorphc to the drect sum of parwse nequvalent rreducble representatons L(λ) gln = summed over the hghest weghts µ satsfyng the betweenness condtons (4) λ µ Z + and µ λ + Z + for =,, n µ L µ 3 GELFAND-TSETLIN BASIS The next two sectons are coped from [M] The subsequent applcatons of the branchng rule to the subalgebras of the chan gl gl gl n gl n yeld a parameterzaton of bass vectors n L(λ) by the combnatoral objects called the Gelfand-Tsetln patterns Such a pattern Λ (assocate wth λ) s an array of row vectors λ n λ n λ n,n λ nn λ n, λ n,n λ λ λ where the upper row concdes wth λ and the followng condtons hold λ k λ k, Z +, λ k, λ k,+ Z +, =,, k for each k =,, n The Gelfand-Tsetln bass of L(λ) s provded by the followng theorem Let us set l k = λ k + Theorem 3 ([GT]) There exsts a bass {v Λ } n L(λ) parametrzed by all patterns Λ such that the acton of generators of gl n s gven by the formulas ( k k (3) e kk v Λ = λ k λ k, )v Λ, = = (3) e k,k+ v Λ = k = (l k l k+, ) (l k l k+,k+ ) (l k l k ) (l k l kk ) v Λ+δ k,

4 4 KANG LU (33) e k+,k v Λ = k (l k l k, ) (l k l k,k ) (l = k l k ) (l k l kk ) v Λ δ k The arrays Λ ± δ k are obtaned from Λ by replacng λ k by λ k ± It s supposed that v Λ = 0 f the array Λ s not a pattern; the symbol ndcates that the zero factor n the denomnator s skpped The Gelfand-Tsetln subalgebra of U(gl n ) s the subalgebra H n generated by the centers Z(gl ),, Z(gl n ) of the subalgebra chan U(gl ) U(gl ) U(gl n ) nduced by gl gl gl n Theorem 3 ([V]) The Gelfand-Tsetln subalgebra H n of U(gl n ) s maxmal commutatve 4 CONSTRUCTION OF THE BASIS: LOWERING AND RAISING OPERATORS For each =,, n ntroduce the followng elements of the unversal envelopng algebra U(gl n ) (4) z n = e e e s s e s n(h h j ) (h h jr ), > > > s (4) z n = e e e s s e ns (h h j ) (h h jr ), < < < s n where s runs over nonnegatve ntegers, h = e + and {j,, j r } s the complementary subset to {,, s } n the set {,, } or { +,, n }, respectvely For nstance, z 3 = e 3, z 3 = e 3 (e e ) + e e 3, z 3 = e 3, z 3 = e 3 (e e + ) + e e 3 Consder now the rreducble fnte-dmensonal representaton L(λ) of gl n wth the hghest weght λ = (λ,, λ n ) and the hghest vector v + Denote by L(λ) + the subspace of gl n -sngular vectors n L(λ): L(λ) + = {v L(λ) e j v = 0, < j n} Gven a gl n -weght µ = (µ,, µ n ) we denote by L(λ) + µ the correspondng weght subspace n L(λ) + : L(λ) + µ = {v L(λ) + e v = µ v, =,, n } The man property of the elements z n and z n s descrbed by the followng lemma Lemma 4 Let v L(λ) + µ Then for any =,, n we have z n v L(λ) + µ+δ and z n v L(λ) + µ δ, where the weght µ ± δ s obtaned from µ by replacng µ wth µ ± Ths result allows us to regard the elements z n and z n as operators n the space L(λ) + They are called the rasng and lowerng operators, respectvely By the branchng rule (Theorem 4) the space L(λ) + µ s one-dmensonal f the condtons (4) hold and t s zero otherwse

5 GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n 5 Lemma 4 Suppose that µ satsfes the betweenness condtons (4) Then the vector v µ = z λ µ n z λ n µ n n,n v + s nonzero Moreover, the space L(λ) + µ s spanned by v µ The U(gl n )-span of each nonzero vector v µ s a gl n -module somorphc to L (µ) Iteratng the constructon of the vectors v µ for each par of Le algebras gl k gl k we shall be able to get a bass n the entre space Λ(λ) Theorem 43 The bass vector v Λ of Theorem 3 can be gven by the formula (43) v Λ = ( λ z k, λ k, k k=,,n z λ k,k λ k,k ) k,k v +, where the factors n the product are ordered n accordance wth ncrease of the ndces Instead of gvng a proof frst, I wll check n Secton 5 that the constructon n Theorem 43 does satsfy the formulas n Theorem 3 for some smple cases The proof wll be gven n Secton 6 5 EXAMPLES In ths secton, we are gong to check that the vectors constructed from Theorem 43 does satsfy the formulas n Theorem 3 for n =, 3 The case for gl 3 s not complete 5 The case of gl Let us fx the hghest weght λ = (λ, λ ), then λ = λ, λ = λ Denote by µ = λ, then each pattern s determned by k = λ µ for k = 0,, λ λ By (43), the vector corresponds to k s gven by v k = e λ µ v + = e k v+ Now t s trval that e v k = v k+, whch s exactly (33)(note that µ corresponds to k + ) Snce for any vector v of weght (µ, µ ), the vector e v has weght (µ, µ + ) Hence v k = e k v+ has weght (λ k, λ + k) Therefore, we have e v k = (λ k)v k = µv k = λ v k, e v k = (λ + k)v k = (λ + λ λ )v k Formula (3) s checked Fnally, to check (3), we need the followng useful formula n U(gl ) (5) [e, e k ] = kek (k e + e ) Now (3) holds because of e v k =e e k v+ = e k e v + + [e, e k ]v+ = ke k (k e + e )v + = (λ µ)(λ µ λ + λ )v k = (λ λ )(λ λ + )v k = (l l )(l l )v k

6 6 KANG LU 5 The case of gl 3 Ths case s more nvolved Frst we fx the hghest weght λ = (λ, λ, λ 3 ) = (λ 3, λ 3, λ 33 ) Then each pattern s unque determned by λ, λ and λ We denote the vector constructed n Theorem 43 correspondng to ths patter by (λ, λ ; λ ), then It s easy to see (λ, λ ; λ ) = e λ λ (e 3 (e e + ) + e e 3 ) λ 3 λ e λ 3 λ 3 v + e (λ, λ ; λ ) =e λ λ + (e 3 (e e + ) + e e 3 ) λ 3 λ e λ 3 λ 3 v + =(λ, λ ; λ ) Snce for any vector v of weght (µ, µ, µ 3 ), the vectors e v, e 3 v and e 3 v have weght (µ, µ +, µ 3 ), (µ, µ, µ 3 + ) and (µ, µ, µ 3 + ) respectvely Moreover, e e + acts on v by scalar product One has that the weght of (λ, λ ; λ ) s Hence we get formulas (3) (λ, λ + λ λ, λ 3 + λ 3 + λ 33 λ λ ) e (λ, λ ; λ ) = λ (λ, λ ; λ ), e (λ, λ ; λ ) = (λ + λ λ )(λ, λ ; λ ), e 33 (λ, λ ; λ ) = (λ 3 + λ 3 + λ 33 λ λ )(λ, λ ; λ ) Now let us consder e (λ, λ ; λ ) By (5), we have e (λ, λ ; λ ) =e e λ λ (e 3 (e e + ) + e e 3 ) λ 3 λ e λ 3 λ 3 v + =e λ λ e (e 3 (e e + ) + e e 3 ) λ 3 λ e λ 3 λ 3 v + (λ λ )e λ λ (λ λ e + e )(e 3 (e e + ) + e e 3 ) λ 3 λ e λ 3 λ 3 v + =e λ λ e (e 3 (e e + ) + e e 3 ) λ 3 λ e λ 3 λ 3 v + (λ λ )(λ λ )(λ, λ ; λ + ) For the last equalty, we use the fact that (e 3 (e e + ) + e e 3 ) λ 3 λ e λ 3 λ 3 v + has weght (λ, λ, λ 3 + λ 3 + λ 33 λ λ ) Now t s enough to check that (5) e λ λ e (e 3 (e e + ) + e e 3 ) λ 3 λ e λ 3 λ 3 v + = 0 We compute e (e 3 (e e + ) + e e 3 ) frst We have e (e 3 (e e + ) + e e 3 ) =(e 3 e e 3 )(e e + ) + e e e 3 + (e e )e 3 =e 3 e (e e ) + e 3 e e 3 (e e ) e 3 + e e 3 e + (e e )e 3 =e 3 (e e )e e 3 e + e 3 e + e 3 e 3 + e e 3 e =(e 3 (e e ) + e e 3 )e Now one has (5) snce v + s a sngular vector and [e, e 3 ] = 0

7 GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n 7 6 PROOF OF THEOREM 3 It suffces to show that wth the formulas gven by (3), (3) and (33) the vector space Λ v Λ dose gve us a smple representaton of gl n wth hghest weght λ Frst we need to check t gves us a representaton Let A be the Cartan matrx of sl n, and set e = e,+, f = e +, and h = e e +,+ for every =,, n Then the Serre relatons for sl n are [h, e j ] = a j e j, [h, f j ] = a j f j, [e, f j ] = δ j h, [h, h j ] = 0, Ad a j e e j = Ad a j f f j = 0, for every, j =,, n Hence t s enough to check that [h, e j ]v Λ = a j e j v Λ, [h, f j ]v Λ = a j f j v Λ, [e, f j ]v Λ = δ j h v Λ, [h, h j ]v Λ = 0, Ad a j e e j v Λ = Ad a j f f j v Λ = 0, for every, j =,, n and Gelfand-Tsetln pattern Λ To our convenence, for each gven pattern Λ assocated to λ, we wrte Λ (k) := = k λ k, and (6) E Λ k := (l k l k+, ) (l k l k+,k+ ) (l k l k ) (l k l kk ), FΛ k := (l k l k, ) (l k l k,k ) (l k l k ) (l k l kk ) for every k =,, n and =,, k Because h and h j dagonally act on Λ v Λ, hence [h, h j ]v Λ = 0 To prove [h, e j ]v Λ = a j e j v Λ, t suffces to show (6) [e, e j,j+ ]v Λ = δ,k e,j+ v Λ δ j+, e j v Λ Snce the patterns nvolved n e j,j+ v Λ are gven by ncreasng one of the entres n the j-th row of Λ by and the acton of e on v Λ only nvolves the sum of -th and ( )- th row of Λ, one can easly check (6) Hence we have [h, e j ]v Λ = a j e j v Λ and smlarly [h, f j ]v Λ = a j f j v Λ Now let us prove [e, f j ]v Λ = δ j h v Λ Wth the notaton n (6), we have e,+ e j+,j v Λ = e,+ e j+,j e,+ v Λ = e j,j+ j k= s= F Λ jk v Λ δ jk = E Λ s v Λ+δ s = j k= j k= s= s= F Λ jk EΛ δ jk s v Λ δjk +δ s, F Λ+δ s jk E Λ s v Λ δ jk +δ s Snce Fjk Λ only nvolves the j-th and (j )-th rows of Λ whle EΛ s only nvolves the -th and ( + )-th rows, we have (63) F Λ jk EΛ δ jk s for = j and = j If = j, then we have = F Λ+δ s jk Es Λ F Λ jk F Λ+δ s jk = l jk l j,s l jk l j,s, E Λ s E Λ δ jk s = l s l +,k l s l +,k + = l jk l j,s l jk l j,s,

8 8 KANG LU e (63) holds If = j and s = k, one can check (63) drectly Therefore [e, f j ]v Λ = δ j h v Λ s equvalent to ( (lk + l, ) (l k + l, ) (l k l +, ) (l k l +,+ ) (64) (l k + l ) (l k + l ) (l k l ) (l k l ) k= (l k l, ) (l k l, ) (l ) k l +, ) (l k l +,+ ) (l k l ) (l k l ) (l k l ) (l k l ) =(l + + l ) (l, + + l, ) (l +, + + l +,+ ) Denote the rght hand sde of (64) by M, then M s a symmetrc ratonal functon wth respect to l,, l Moreover, t has at most smple poles Note that a symmetrc functon cannot have smple poles, t follows that M s a polynomal n l,, l By consderng the asymptotc behavor, we know that M l as l tends to nfnty By symmetry, t follows that M (l + + l ) s ndependent of l,, l It s easy to see l +, s a lnear term n M Let us consder the coeffcent of l +, Ths coeffcent s k= ( (lk + l, ) (l k + l, ) (l k + l ) (l k + l ) (l k l, ) (l k l, ) (l k l ) (l k l ) (l k l +, ) (l k l +,+ ) (l k l ) (l k l ) (l k l +, ) (l k l +,+ ) (l k l ) (l k l ) Let ϕ(x) = (x + l, ) (x + l, )(x l +, ) (x l +,+ ), then deg ϕ = Set a k = l k and a k+ = l k for every k =,,, we have ϕ(a k ) (a j =k k a j ) =(l k + l, ) (l k + l, ) (l k + l ) (l k + l ) (l k l +, ) (l k l +,+ ) (l k l ) (l k l ), ϕ(a k+ ) (a j =k+ k a j ) = (l k l, ) (l k l, ) (l k l ) (l k l ) By Lagrange Interpolatng Polynomal, we have ϕ(a k ) k= j =k Consder the leadng coeffcent, t follows that ϕ(a k ) k= j =k (l k l +, ) (l k l +,+ ) (l k l ) (l k l ) (x a j ) (a k a j ) = ϕ(x) (a k a j ) = Hence the coeffcent of l +, s equal to By symmetry all the coeffcent of l +,k are equal to for every k =,, + Smlarly, all the coeffcent of l,k are equal to )

9 GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n 9 for every k =,, Now t s easy to see M ( (l + + l ) (l, + + l, ) (l +, + + l +,+ ) ) s a constant Let l sk = k for every s =,, + and k =,, s, we can get ths constant, whch s exactly Hence we proved [e, f j ]v Λ = δ j h v Λ Remark 6 A smple proof of (64), as gven by Prof Tarasov, s the followng Let p j (u) = (u l j ) (u l jj ), then the left hand sde of (64) s equal to k= Res u=lk p (u)p + (u ) p (u)p (u ) and the rght hand sde of (64) s equal to Hence they must equal p Res (u)p + (u ) u= p (u)p (u ) p Res (u)p + (u ) u=lk + p k= (u)p (u ) Smlar to the frst half of the proof of [e, f j ]v Λ = δ j h v Λ, we can prove [e,+, e j,j+ ]v Λ = 0 f j = 0 ( = j s trval) Let us consder [e,+, [e,+, e +,+ ]]v Λ Frst, we have [x, [x, y]] = x y + yx xyx and e,+ e +,+v Λ = + k= s= e,+ e +,+ e,+ v Λ = e +,+ e,+ v Λ = + k= t= + k= s= E+,k Λ EΛ+δ +,k s E Λ+δ +,k+δ s t v Λ+δ+,k +δ s +δ t, s= t= t= E Λ+δ s +,k EΛ s EΛ+δ +,k+δ s t v Λ+δ+,k +δ s +δ t, E Λ+δ s+δ t +,k Es Λ EΛ+δ s t v Λ+δ+,k +δ s +δ t To prove [e,+, [e,+, e +,+ ]]v Λ = 0, t suffces to show the coeffcent of v Λ+δ+,k +δ s +δ t s zero If s = t, after takng the common factors, the coeffcent s a multple of (l s l +,k )(l t l +,k ) (l s l t )(l t l s ) + (l t l +,k )(l s l +,k ) (l t l s )(l s l t ) (l s l +,k )(l t l+,k ) (l s l t )(l t l s ) (l t l +,k )(l s l+,k ) (l t l s )(l s l t ) + (l s l +,k )(l t l +,k ) (l s l t )(l t l s ) + (l t l +,k )(l s l +,k ) (l t l s )(l s l t ) It s easy to see the frst lne of ths expresson s equal to and the second l s l t Hence the coeffcent s zero Smlarly, f s = t, then t suffces to check l t l s (l s l +,k )(l s l +,k ) (l s l +,k )(l s l +,k ) + (l s l +,k )(l s + l +,k ) = 0, whch s obvous Smlarly, we can prove Ad a j e e j v Λ = Ad a j f f j v Λ = 0 Let Λ 0 be the Gelfand-Testln pattern assocated to λ defned by λ k = λ for every k =,, n and =,, k Now by the formulas (3) and (3), we have e v L0 = λ v Λ0, e,+ v Λ0 = 0

10 0 KANG LU Hence v Λ0 s a sngular vector wth weght λ Note that by defnton, Λ v Λ s fntedmensonal Moreover, by Branchng rule (Theorem 4), the dmenson of L(λ) s equal to the number of Gelfand-Testln patterns assocated to λ It follows that L(λ) = Λ v Λ, and the proof of Theorem 3 s complete 7 FURTHER TOPICS We mght consder how the Gelfand-Tsetln algebra acts on ths bass To be contnued REFERENCES [BGG] [GT] [M] [V] IN Bernsten, I M Gelfand, S I Gelfand, Structure of representatons generated by vectors of hghest weght, Functonal Analyss and Its Applcatons 5 (97), no, pp -9 I M Gelfand and M L Tsetln, Fnte-dmensonal representatons of the group of unmodular matrces (n Russan), Doklady Akad Nauk SSSR (NS) 7 (950), Englsh translaton n: I M Gelfand Collected papers, vol II Sprnger-Verlag, Berln, 987, pp A Molev, Gelfand-Tsetln bases for classcal Le algebras, -65, mathrt/089v È B Vnberg, On certan commutatve subalgebras of a unversal envelopng algebra, Mathematcs of the USSR-Izvestya 36 (99), no, pp -3 KL: DEPARTMENT OF MATHEMATICS, INDIANA UNIVERSITY-PURDUE UNIVERSITY-INDIANAPOLIS, 40 NBLACKFORD ST, LD 70, INDIANAPOLIS, IN 460, USA E-mal address: lukang@upuedu

NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules

NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules EVAN WILSON Quantum groups Consder the Le algebra sl(n), whch s the Le algebra over C of n n trace matrces together wth the commutator

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

DIFFERENTIAL FORMS BRIAN OSSERMAN

DIFFERENTIAL FORMS BRIAN OSSERMAN DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

Lie Algebra Cohomology and the Borel-Weil-Bott Theorem. 1 Lie algebra cohomology and cohomology of G/T with coefficients in a line bundle

Lie Algebra Cohomology and the Borel-Weil-Bott Theorem. 1 Lie algebra cohomology and cohomology of G/T with coefficients in a line bundle Le Algebra Cohomology and the Borel-Wel-Bott Theorem Math G4344, Sprng 2012 We have seen that rreducble fnte dmensonal representatons of a complex smple Le algebra g or correspondng compact Le group are

More information

FINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN

FINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

Lecture 14 - Isomorphism Theorem of Harish-Chandra

Lecture 14 - Isomorphism Theorem of Harish-Chandra Lecture 14 - Isomorphsm Theorem of Harsh-Chandra March 11, 2013 Ths lectures shall be focused on central characters and what they can tell us about the unversal envelopng algebra of a semsmple Le algebra.

More information

Errata to Invariant Theory with Applications January 28, 2017

Errata to Invariant Theory with Applications January 28, 2017 Invarant Theory wth Applcatons Jan Drasma and Don Gjswjt http: //www.wn.tue.nl/~jdrasma/teachng/nvtheory0910/lecturenotes12.pdf verson of 7 December 2009 Errata and addenda by Darj Grnberg The followng

More information

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space. Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class

More information

5 The Rational Canonical Form

5 The Rational Canonical Form 5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces

More information

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac

More information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013 ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run

More information

COMBINATORIAL CONSTRUCTIONS OF WEIGHT BASES: THE GELFAND-TSETLIN BASIS. 1. Introduction

COMBINATORIAL CONSTRUCTIONS OF WEIGHT BASES: THE GELFAND-TSETLIN BASIS. 1. Introduction COMBINATORIAL CONSTRUCTIONS OF WEIGHT BASES: THE GELFAND-TSETLIN BASIS PATRICIA HERSH AND CRISTIAN LENART Abstract. Ths work s part of a project on weght bases for the rreducble representatons of semsmple

More information

Fixed points of IA-endomorphisms of a free metabelian Lie algebra

Fixed points of IA-endomorphisms of a free metabelian Lie algebra Proc. Indan Acad. Sc. (Math. Sc.) Vol. 121, No. 4, November 2011, pp. 405 416. c Indan Academy of Scences Fxed ponts of IA-endomorphsms of a free metabelan Le algebra NAIME EKICI 1 and DEMET PARLAK SÖNMEZ

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

A combinatorial problem associated with nonograms

A combinatorial problem associated with nonograms A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author

More information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

More information

SL n (F ) Equals its Own Derived Group

SL n (F ) Equals its Own Derived Group Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu

More information

Lecture Notes Introduction to Cluster Algebra

Lecture Notes Introduction to Cluster Algebra Lecture Notes Introducton to Cluster Algebra Ivan C.H. Ip Updated: Ma 7, 2017 3 Defnton and Examples of Cluster algebra 3.1 Quvers We frst revst the noton of a quver. Defnton 3.1. A quver s a fnte orented

More information

HOPF ALGEBRAS WITH TRACE AND CLEBSCH-GORDAN COEFFICIENTS. 1. Recollections and the problem

HOPF ALGEBRAS WITH TRACE AND CLEBSCH-GORDAN COEFFICIENTS. 1. Recollections and the problem HOPF ALGEBRAS WITH TRACE AND CLEBSCH-GORDAN COEFFICIENTS CORRADO DE CONCINI Abstract. In ths lecture I shall report on some jont work wth Proces, Reshetkhn and Rosso [1]. 1. Recollectons and the problem

More information

REGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction

REGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997

More information

9 Characteristic classes

9 Characteristic classes THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct

More information

Restricted divisor sums

Restricted divisor sums ACTA ARITHMETICA 02 2002) Restrcted dvsor sums by Kevn A Broughan Hamlton) Introducton There s a body of work n the lterature on varous restrcted sums of the number of dvsors of an nteger functon ncludng

More information

On Finite Rank Perturbation of Diagonalizable Operators

On Finite Rank Perturbation of Diagonalizable Operators Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable

More information

DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization

DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.

More information

A summation on Bernoulli numbers

A summation on Bernoulli numbers Journal of Number Theory 111 (005 37 391 www.elsever.com/locate/jnt A summaton on Bernoull numbers Kwang-Wu Chen Department of Mathematcs and Computer Scence Educaton, Tape Muncpal Teachers College, No.

More information

An Introduction to Morita Theory

An Introduction to Morita Theory An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory

More information

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems

More information

First day August 1, Problems and Solutions

First day August 1, Problems and Solutions FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve

More information

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

More information

Google PageRank with Stochastic Matrix

Google PageRank with Stochastic Matrix Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d

More information

A First Order q-difference System for the BC 1 -Type Jackson Integral and Its Applications

A First Order q-difference System for the BC 1 -Type Jackson Integral and Its Applications Symmetry Integrablty and Geometry: Methods and Applcatons SIGMA 5 2009 041 14 pages A Frst Order -Dfference System for the BC 1 -Type Jackson Integral and Its Applcatons Masahko ITO Department of Physcs

More information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX NUMBERS AND QUADRATIC EQUATIONS COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

where a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets

where a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets 5. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of

More information

SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)

SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N) SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) S.BOUCKSOM Abstract. The goal of ths note s to present a remarably smple proof, due to Hen, of a result prevously obtaned by Gllet-Soulé,

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction

ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES TAKASHI ITOH AND MASARU NAGISA Abstract We descrbe the Haagerup tensor product l h l and the extended Haagerup tensor product l eh l n terms of

More information

Ali Omer Alattass Department of Mathematics, Faculty of Science, Hadramout University of science and Technology, P. O. Box 50663, Mukalla, Yemen

Ali Omer Alattass Department of Mathematics, Faculty of Science, Hadramout University of science and Technology, P. O. Box 50663, Mukalla, Yemen Journal of athematcs and Statstcs 7 (): 4448, 0 ISSN 5493644 00 Scence Publcatons odules n σ[] wth Chan Condtons on Small Submodules Al Omer Alattass Department of athematcs, Faculty of Scence, Hadramout

More information

7. Products and matrix elements

7. Products and matrix elements 7. Products and matrx elements 1 7. Products and matrx elements Based on the propertes of group representatons, a number of useful results can be derved. Consder a vector space V wth an nner product ψ

More information

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product 12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

Math 217 Fall 2013 Homework 2 Solutions

Math 217 Fall 2013 Homework 2 Solutions Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has

More information

Restricted Lie Algebras. Jared Warner

Restricted Lie Algebras. Jared Warner Restrcted Le Algebras Jared Warner 1. Defntons and Examples Defnton 1.1. Let k be a feld of characterstc p. A restrcted Le algebra (g, ( ) [p] ) s a Le algebra g over k and a map ( ) [p] : g g called

More information

The lower and upper bounds on Perron root of nonnegative irreducible matrices

The lower and upper bounds on Perron root of nonnegative irreducible matrices Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

Determinants Containing Powers of Generalized Fibonacci Numbers

Determinants Containing Powers of Generalized Fibonacci Numbers 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 19 (2016), Artcle 1671 Determnants Contanng Powers of Generalzed Fbonacc Numbers Aram Tangboonduangjt and Thotsaporn Thanatpanonda Mahdol Unversty Internatonal

More information

Short running title: A generating function approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI

Short running title: A generating function approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI Short runnng ttle: A generatng functon approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI JASON FULMAN Abstract. A recent paper of Church, Ellenberg,

More information

Appendix B. Criterion of Riemann-Stieltjes Integrability

Appendix B. Criterion of Riemann-Stieltjes Integrability Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

MEM633 Lectures 7&8. Chapter 4. Descriptions of MIMO Systems 4-1 Direct Realizations. (i) x u. y x

MEM633 Lectures 7&8. Chapter 4. Descriptions of MIMO Systems 4-1 Direct Realizations. (i) x u. y x MEM633 Lectures 7&8 Chapter 4 Descrptons of MIMO Systems 4- Drect ealzatons y() s s su() s y () s u () s ( s)( s) s y() s u (), s y() s u() s s s y() s u(), s y() s u() s ( s)( s) s () ( s ) y ( s) u (

More information

CSCE 790S Background Results

CSCE 790S Background Results CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each

More information

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16 STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus

More information

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system. Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and

More information

ALGEBRA MID-TERM. 1 Suppose I is a principal ideal of the integral domain R. Prove that the R-module I R I has no non-zero torsion elements.

ALGEBRA MID-TERM. 1 Suppose I is a principal ideal of the integral domain R. Prove that the R-module I R I has no non-zero torsion elements. ALGEBRA MID-TERM CLAY SHONKWILER 1 Suppose I s a prncpal deal of the ntegral doman R. Prove that the R-module I R I has no non-zero torson elements. Proof. Note, frst, that f I R I has no non-zero torson

More information

PHYS 215C: Quantum Mechanics (Spring 2017) Problem Set 3 Solutions

PHYS 215C: Quantum Mechanics (Spring 2017) Problem Set 3 Solutions PHYS 5C: Quantum Mechancs Sprng 07 Problem Set 3 Solutons Prof. Matthew Fsher Solutons prepared by: Chatanya Murthy and James Sully June 4, 07 Please let me know f you encounter any typos n the solutons.

More information

Complete subgraphs in multipartite graphs

Complete subgraphs in multipartite graphs Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G

More information

On the partial orthogonality of faithful characters. Gregory M. Constantine 1,2

On the partial orthogonality of faithful characters. Gregory M. Constantine 1,2 On the partal orthogonalty of fathful characters by Gregory M. Constantne 1,2 ABSTRACT For conjugacy classes C and D we obtan an expresson for χ(c) χ(d), where the sum extends only over the fathful rreducble

More information

Srednicki Chapter 34

Srednicki Chapter 34 Srednck Chapter 3 QFT Problems & Solutons A. George January 0, 203 Srednck 3.. Verfy that equaton 3.6 follows from equaton 3.. We take Λ = + δω: U + δω ψu + δω = + δωψ[ + δω] x Next we use equaton 3.3,

More information

Polynomials. 1 More properties of polynomials

Polynomials. 1 More properties of polynomials Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a

More information

Cohen-Lenstra heuristics and random matrix theory over finite fields

Cohen-Lenstra heuristics and random matrix theory over finite fields Cohen-Lenstra heurstcs and random matrx theory over fnte felds Jason Fulman Department of Mathematcs, Unversty of Southern Calforna, Los Angeles, CA, 90089 E-mal address: fulman@usc.edu Abstract. Let g

More information

Distribution det x s on p-adic matrices

Distribution det x s on p-adic matrices January 30, 207 Dstruton det x s on p-adc matrces aul arrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ Let e a p-adc feld wth ntegers o, local parameter, and resdue feld cardnalty q. Let A

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs

More information

An application of non-associative Composition-Diamond lemma

An application of non-associative Composition-Diamond lemma An applcaton of non-assocatve Composton-Damond lemma arxv:0804.0915v1 [math.ra] 6 Apr 2008 Yuqun Chen and Yu L School of Mathematcal Scences, South Chna Normal Unversty Guangzhou 510631, P. R. Chna Emal:

More information

Prof. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model

Prof. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model EXACT OE-DIMESIOAL ISIG MODEL The one-dmensonal Isng model conssts of a chan of spns, each spn nteractng only wth ts two nearest neghbors. The smple Isng problem n one dmenson can be solved drectly n several

More information

Lecture 7: Gluing prevarieties; products

Lecture 7: Gluing prevarieties; products Lecture 7: Glung prevaretes; products 1 The category of algebrac prevaretes Proposton 1. Let (f,ϕ) : (X,O X ) (Y,O Y ) be a morphsm of algebrac prevaretes. If U X and V Y are affne open subvaretes wth

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Symmetry, Integrability and Geometry: Methods and Applications

Symmetry, Integrability and Geometry: Methods and Applications Symmetry, Integrablty and Geometry: Methods and Applcatons Zero Acton on Perfect Crystals for U q G 1) 2 Kalash C. MISRA, Mahathr MOHAMAD and Masato OKADO Department of Mathematcs, North Carolna State

More information

Layer Potentials. Chapter Fundamental and Singular Solutions

Layer Potentials. Chapter Fundamental and Singular Solutions Chapter Layer Potentals We solve boundary value problems assocated wth system (1.1) (or, rather, ts homogeneous verson) by means of potental-type functons wth a sutably chosen kernel. In ths chapter we

More information

Lecture 5 Decoding Binary BCH Codes

Lecture 5 Decoding Binary BCH Codes Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture

More information

form, and they present results of tests comparng the new algorthms wth other methods. Recently, Olschowka & Neumaer [7] ntroduced another dea for choo

form, and they present results of tests comparng the new algorthms wth other methods. Recently, Olschowka & Neumaer [7] ntroduced another dea for choo Scalng and structural condton numbers Arnold Neumaer Insttut fur Mathematk, Unverstat Wen Strudlhofgasse 4, A-1090 Wen, Austra emal: neum@cma.unve.ac.at revsed, August 1996 Abstract. We ntroduce structural

More information

REAL ANALYSIS I HOMEWORK 1

REAL ANALYSIS I HOMEWORK 1 REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α

More information

where a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets

where a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets 11. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of

More information

Affine and Riemannian Connections

Affine and Riemannian Connections Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons

More information

1 Matrix representations of canonical matrices

1 Matrix representations of canonical matrices 1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:

More information

PRIMES 2015 reading project: Problem set #3

PRIMES 2015 reading project: Problem set #3 PRIMES 2015 readng project: Problem set #3 page 1 PRIMES 2015 readng project: Problem set #3 posted 31 May 2015, to be submtted around 15 June 2015 Darj Grnberg The purpose of ths problem set s to replace

More information

An (almost) unbiased estimator for the S-Gini index

An (almost) unbiased estimator for the S-Gini index An (almost unbased estmator for the S-Gn ndex Thomas Demuynck February 25, 2009 Abstract Ths note provdes an unbased estmator for the absolute S-Gn and an almost unbased estmator for the relatve S-Gn for

More information

DIFFERENTIAL SCHEMES

DIFFERENTIAL SCHEMES DIFFERENTIAL SCHEMES RAYMOND T. HOOBLER Dedcated to the memory o Jerry Kovacc 1. schemes All rngs contan Q and are commutatve. We x a d erental rng A throughout ths secton. 1.1. The topologcal space. Let

More information

NP-Completeness : Proofs

NP-Completeness : Proofs NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

COMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A 2 2 MATRIX

COMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A 2 2 MATRIX COMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A MATRIX J Mc Laughln 1 Mathematcs Department Trnty College 300 Summt Street, Hartford, CT 06106-3100 amesmclaughln@trncolledu Receved:, Accepted:,

More information

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017

More information

Weyl group. Chapter locally finite and nilpotent elements

Weyl group. Chapter locally finite and nilpotent elements Chapter 4 Weyl group In ths chapter, we defne and study the Weyl group of a Kac-Moody Le algebra and descrbe the smlartes and dfferences wth the classcal stuaton Here because the Le algebra g(a) s not

More information

Bernoulli Numbers and Polynomials

Bernoulli Numbers and Polynomials Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that

More information

Random Walks on Digraphs

Random Walks on Digraphs Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

More information

h-analogue of Fibonacci Numbers

h-analogue of Fibonacci Numbers h-analogue of Fbonacc Numbers arxv:090.0038v [math-ph 30 Sep 009 H.B. Benaoum Prnce Mohammad Unversty, Al-Khobar 395, Saud Araba Abstract In ths paper, we ntroduce the h-analogue of Fbonacc numbers for

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

The Pseudoblocks of Endomorphism Algebras

The Pseudoblocks of Endomorphism Algebras Internatonal Mathematcal Forum, 4, 009, no. 48, 363-368 The Pseudoblocks of Endomorphsm Algebras Ahmed A. Khammash Department of Mathematcal Scences, Umm Al-Qura Unversty P.O.Box 796, Makkah, Saud Araba

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of

More information