Group Codes Define Over Dihedral Groups of Small Order

Size: px
Start display at page:

Download "Group Codes Define Over Dihedral Groups of Small Order"

Transcription

1 Malaysan Journal of Mathmatcal Scncs 7(S): 0- (0) Spcal Issu: Th rd Intrnatonal Confrnc on Cryptology & Computr Scurty 0 (CRYPTOLOGY0) MALAYSIA JOURAL OF MATHEMATICAL SCIECES Journal hompag: Group Cods Dfn Ovr Dhdral Groups of Small Ordr * Dns C.K. Wong and Ang M.H Dpartmnt of Appld Mathmatcs and Actuaral Scnc, Faculty of Engnrng and Scnc, Unvrst Tunku Abdul Rahman Stapak, Off Jalan Gntng Klang, 500, Kuala Lumpur School of Mathmatcal Scncs, Unvrst Sans Malaysa, 00 Pulau Pnang, Malaysa Emal: dnswong@utar.du.my and mathamh@cs.usm.my *Corrspondng author ABSTRACT Th study of group cods as an dal n a group algbra has bn dvlopd long tm ago. If char(f) dos not dvds G, thn FG s smsmpl, and hnc dcomposs nto a drct sum FG = FG whr FG ar mnmal dals gnratd by th dmpotnt. Th dmpotnt provds som usful nformaton on dtrmnng th mnmum dstanc of group cods. In ths papr, w study dhdral group cods gnratd by lnar dmpotnts and nonlnar dmpotnts for dhdral groups of ordr,, 0 and. Our prmary task s to dtrmn th paramtrs of ths famls of group cods n ordr to obtan cods whch nar to attan th Snglton bound. Kywords: Group algbra, group cods, Snglton bound, lnar dmpotnts, nonlnar dmpotnts.. ITRODUCTIO Error corrcton or dtcton has bcom an mportant ssu wth th problm of rlabl communcaton ovr nosy channls. Snc thn group algbra cods hav bn a focus of ntrst n th mathmatcal communty n rlatng cods structurs by usng algbrac structurs. Group algbra cods gand ntrst aftr Brman showd n 97 that cyclc cods and

2 Dns C. K. Wong & Ang M. H Rd Mullr cods can b studd as dals n a group algbra FG, whr F s a fnt fld and G s consdrd, n ach cas, a fnt cyclc group and a -group rspctvly. On th othr hands, th frst nvstgatons of non- Ablan group algbra cod was don by F. J. Macwllams. Rcntly, P. Hurly and T. Hurly (Hurly (007)) construct group rng cods from zro dvsors and unt n group rngs n whch cas th cods dfnd may not b dal. In ths papr, w study cods dfnd ovr group algbra, whch s an dal. A group algbra cod n FG s dfnd as a on-sdd (lft or rght) dal n FG. If G s cyclc or Ablan, thn vry dal n FG s th cyclc or Ablan cod, rspctvly. Rfr (Brman (97) and (Brman (99)) for mor dtals on cyclc and ablan group cods, and (How and Dns (00)) for a class of nonablan group algbra cods. Th studs of group algbra cod n FG dpndd soldly on th chocs of F and G. In gnral, w can study group algbra cod n FG from th followng pont of vws: If gcd ( char( F ), G ) =, thn FG s smsmpl (rfr Thorm 5. (Isaacs, 997)), that s, FG s a drct sum of som mnmal dals, say s FG = I. Each I s gnratd by an dmpotnt =,.., I FG =. Lt E = { } s. Any dal I of FG s a drct sum of som of th I, = t say I = I k, t s. W say that I s gnratd by { } t. Lt = E \{ } t k k= k. k k = Thn I { u FG u 0 r r } = =. = For tchncal rason, w dnot I by I. ot that plays th rol of party chck matrx dfnng a lnar cod, and so w xpct to drv som nformaton about th mnmum dstanc of I from. Rcall som notaton and dfntons: Th lngth n of a group cod I b G. Th wght of any lmnt u FG s dfnd to = λ g s qual to g { λ λ 0 g g } and s dnotd by wt ( u ). If I has dmnson k (as a vctor spac ovr F ) and mnmum dstanc d = d ( I ) = mn{ wt ( u) 0 u I u}, thn I s calld an ( ),, n k d group cod. For mor nformaton on codng thory, plas rfr (Sloan and Macwllam, 97). 0 Malaysan Journal of Mathmatcal Scncs

3 Group Cods Dfn Ovr Dhdral Groups of Small Ordr In ths papr, w consdr group algbra cods dfnd ovr dhdral groups of ordr,, 0 and. Som bascs proprts of nonablan group cods wll b drvd n Scton, thn som proprts n dhdral group wll b drvd. Fnally, th mnmum dstanc of dhdral groups of ordr,, 0 and wll b studs n Scton and hnc som group algbra cods whch nar to attan th Snglton bound wll b obtand.. PRELIMIARY Most obcts n ths papr ar rprsntd n trm of group algbra FG. Th group algbra FG { a g a F g g } = s th fr F modul ovr a fnt group G whr G can b rgardd as an F bass for FG. Th addton and scalar multplcaton ar dfnd as follows. For any u = λ g, v = β g FG and F u + v = λ β g g + and g g g λ, ( ) λu = ( λλ ) g. Morovr, multplcaton n G nducs multplcaton n g FG as u. v = γ k whr γ = k k λ β. By ths opratons, FG s an g h k G gh= k G assocatv F algbra wth dntty = F G whr G and F ar th dntty lmnts of G and F, rspctvly. G can b vwd as contand n FG, and hnc th lmnts of G consttut th codng bass for cods vwd as subspacs of FG. W vw G as g n FG. Morovr, for ( ) A = a g FG, dfn A = a g. For mor nformaton on group g algbra, plas rfr (Passman (977)). g From now onward, w us th followng dfnton. Dfnton.. Lt G b a group and F b a fld such that gcd char F, G =. If E s th st of all dmpotnts of FG and E, ( ( ) ) thn th group cod gnratd by s I { u FG u 0 } = =. Proposton.. Th group algbra cods I dfnd n Dfnton. s a lnar cod ovr F. For any postv ntgr n, th dhdral group of ordr n can b n D = r s 0 n,0, r = s =, rs = sr. From rprsntd as { } now onward, all groups G ar D and all group algbra cods I ar n Malaysan Journal of Mathmatcal Scncs 0

4 Dns C. K. Wong & Ang M. H dfnd ovr D. Frst, to obtan th dmnson of I n, w nd th followng rsults. Thorm.. (Thorm.7, Jams and Lbck (99)). Lt K b a fnt group of ordr n, and F b an algbracally closd fld wth gcd char F, G =. Thn FK Mat ( F )... Mat ( F ), whr ( ( ) ) n n s = + +. FK has xactly s nonsomorphc rrducbl moduls, of n n... n s dmnsons n,..., n, and s s th numbr of conugacy classs of K. s = whr E s th st L Rmark.. Snc FG ( FG ) ( FG E ) E L conssts of all lnar dmpotnts n FG and E s th st conssts of all nonlnar dmpotnts n FG ; and furthrmor E = E E. ot that f L E, thn dm L ( FG ) = ; and f E, thn dm ( FG ) =. (Scton., Jams and Lbck (99)). Thrfor, f = whr E and E, thn L L L ( I ) ( FG) L dm = dm. As dm( FG) = G = n, thn dm( I ) n =. Th nxt thorm on th numbr of conugacy classs of found n (Scton.; Jams and Lbck (99)). L D can b Thorm.5. Th conugacy classs of D ar as follows: () If n s odd, thn D has ( n + ) conugacy classs: ( n ) / ( n ) / {},{ r, r },...,{ r, r },{ s, rs,..., r s}. () If n s vn and n = m, thn D has m + conugacy classs: m m ( m ) + {},{ r },{ r, r },...,{ r, r },{ r s :0 m },{ r s :0 m }. By usng Thorm.5 and rsults from (Chaptr, and 5; Jams and Lbck (99)), w obtan th followng proposton. ot that D ' dnot th commutator subgroup of D. 0 Malaysan Journal of Mathmatcal Scncs

5 Proposton.. Lt ntgr, thn (a) Irr ( D n ) Group Cods Dfn Ovr Dhdral Groups of Small Ordr D b th dhdral group of ordr n, whr n s any ( n + ), f n s prm, = ( n + ), f n = p, whr p s any prm. r, f n s prm, (b) D ' n = r, f n = p, whr p s a prm. (c) (d) D n D has n D ' lnar charactrs, whr D, f n s prm, n D ' = n, f n = p, whr p s a prm. D has ϖ non-lnar charactrs, whr n n, f n s prm, ϖ = n, f n = p, whr p s a prm. Proof. Part (a) s ust a drct consqunc from th fact that th numbr of rrducbl charactrs s qual to th numbr of conugacy classs. For part D (b), snc n Dn = and so r r s ablan, thn D ' r, rfr Thorm.0 n (Isaacs, 99). If n s prm, thn D ' = or D ' = r. If D ' =, thn D s ablan whch s mpossbl. Thrfor, w conclud n that D ' = r. xt, assum n = p, whr p s a prm. ot that D D r n n Snc r r D n = r r = and so = p, thn thr D ' = or n D ' r s ablan, thn D ' r. = r, and hnc th rsult wll follow drctly. Part (c) follows from part (b). Part (d) follows drctly from part (a) and (c). Q.E.D. Th followng lmma s usd to obtan th mnmum dstanc of I. Malaysan Journal of Mathmatcal Scncs 05

6 Lmma.7. If, thn I Proof. If all and so u I Dns C. K. Wong & Ang M. H I and so d ( I ) d ( I ). u I, thn u = 0 for all. Snc, thn u = 0 for. For th scond assrton, assum d ( I ) t wt u wt v, v I, thn d ( I ) t u I = t. If wth wt ( u) = and ( ) ( ) u I wth wt ( u) = t and wt ( u) wt ( v), for som v I othr hand, f thn d ( I ) Q.E.D. =. On th >, < t. Thus, th rsult follows drctly.. MIIMUM DISTACE OF DIHEDRAL GROUP CODES. Cods dfnd ovr FD Lt H = r r = and so D = H sh. From Proposton., D conssts of thr rrducbl charactrs (two ar lnar and on s nonlnar) χ, χ and χ, and ach of ths charactrs wll corrspond to a unqu dmpotnt (rfr Proposton.0; Jams and Lbck, 99) as follows: χ = ( H + sh ), ( H sh ) χ = and 0 Malaysan Journal of Mathmatcal Scncs χ = H. Lt u = λ + λ r + λ r + λ s + λ rs + λ r s b any lmnts n FD, λ F for 5 =,,,, 5,, thn u = λ () u ( ) = ( λ λ ) = = = u = + + r + + r + () ( ) ( ) ( ) λ λ λ λ λ λ λ λ λ ( λ λ λ ) s ( λ λ λ ) rs ( λ λ λ ) r s Lmma.. Lt, and b thos dmpotnts n FD as constructd abov, thn: d I = for =,. () ( ) () ( { } ) { } d I =. ()

7 Group Cods Dfn Ovr Dhdral Groups of Small Ordr Proof. W prov part () for th cas =. Th cas = can b provd n a smlar mannr. Assum u = λg I{ } for any g D and 0 λ F such that ( ) wt u =. By quaton (), u = λ 0. Hnc, w conclud that u = λg I and so d I. Clarly, u = g h I { } { } for any dstnct { } ( ) g, h D bcaus by quaton (), u = ( ) = 0 and so d I =. { } For part (): f u λg I{ } = wth ( ) ( ) wt u =, thn 0 λ F. Howvr, by usng quaton (), u = λg 0 and so u = λg I whch { } mpls ( { } ) d I >. xt, w chck whthr I consst of codwords of { } wght. Assum u = λ g + λ g I such that wt { } ( u ) =, thn w hav thr g, g H, g, g sh or g H and g sh. For ach of ths possblts, by usng quaton (), w wll obtan a st of quatons n trms λ and λ, and upon solvng wll gv th soluton λ = λ = 0 whch s of mpossbl. Thus, ( { } ) u = H H H H 0 = = Q.E.D. d I >. Fnally, consdr u = H, thn and so u H I{ } = and hnc ( { } ) d I =. From Lmma. and Rmark., w s that I { s a } (,5,) group cod for =, whch attan th snglton bound and so ar I s a (,,) group cod whch s not an MDS MDS cods. Howvr, { } cod. Thorm.. Lt, and b thos dmpotnts n FD, thn: d I = () ( {, } ) () ( {, } ) d I = for =,. Proof. By Lmma.7 and Lmma., w notc that ( ) d I for all {, }, =, and =,. For part (), f u = λ s + λ rs + λ 0 and λ 0, 5 5 thn by usng quaton () and (), u = ( λ + λ ) and u = ( λ λ ) 5 5 Malaysan Journal of Mathmatcal Scncs 07

8 Dns C. K. Wong & Ang M. H thn u = u = 0 f and only f λ = λ. Hnc, u = λ s + λ rs I. 5 5 {, } Thrfor, ( {, } ) d I =. For part (), th proof wll b smlar. W nd to fnd an lmnt wth wght qual to. It can b chckd that thr ar no codwords wth wght lss than n I. {, } W now chck that u = λ + λ r + λ r + λ s + λ rs + λ r s s a word of I. 5 {, } By usng quaton () and (), w obtan u ( λ λ λ λ λ λ ) = + + and 5 u = ( λ λ λ ) + ( λ + λ λ ) r + ( λ λ + λ ) r + λ λ λ s + λ + λ λ rs + λ λ + λ r s. ( 5 ) ( 5 ) ( 5 ) ] Thus, u = u = 0 f and only f ( λ λ λ λ λ λ ) + + = () 5 0 λ λ λ = 0 λ + λ λ = 0 λ λ + λ = 0 λ λ λ = 0 5 λ + λ λ = 0 5 λ λ + λ = 0 5 Th unqu soluton for () s λ = λ = λ 0 and for () s λ = λ = λ 0. Hnc, from (), λ + λ + λ λ λ λ = 0 whch mpls 5 that λ = λ 0. Thrfor, w obtan a nonzro soluton and so ( {, } ) d I =. Q.E.D. {, } () () In Thorm., w hav constructd two famls of group cods,,, MDS group cod and,, group cod for {, } I s a ( ) =,.. Cods dfnd ovr FD Lt H r r = = and so I s a ( ) D = H sh. ot that 0 Malaysan Journal of Mathmatcal Scncs K r r H = =. From Lmma., w s that D conssts of 5 rrducbl charactrs, n

9 Group Cods Dfn Ovr Dhdral Groups of Small Ordr whch cas, four of thm ar lnar charactrs and on s nonlnar charactr. Each of ths charactr wll corrspond to a unqu dmpotnt as follows: (a) Idmpotnts corrspond to lnar charactrs: χ = ( H + sh ), χ = ( H sh ), χ = ( r)( + s) K, and χ = ( r)( s) K. (b) Idmpotnts corrspond to th nonlnar charactr χ of dgr : 5 χ = 5 5 ( r ) = ( r ). Lt u = λ + λ r + λ r + λ r + λ s + λ rs + λ r s + λ r s b any 5 7 lmnt n FD such that λ F for =,,,, 5,, 7 and, thn u = λ () u u u ( ) = ( λ λ ) = = = 5 ( λ λ ) =,,5,7 =,,, ( λ λ ) =,,, =,,5,7 = = u = + r + + r + + r ( λ λ ) ( λ λ ) ( λ λ ) ( λ λ ) ( λ λ 5 7 ) s ( λ λ ) rs ( λ λ 5 7 ) r s ( λ λ ) r s] Lmma.. Lt {,,, } =, whr dmpotnts n FD f β, thn d ( I β ) =. (5) () (7) (),, and ar th lnar Proof. If β, thn thr ar four cass to b consdrd, whch ar β =,,, or. From Lmma.7, w only nd to show that d ( I β ) = for β =. If β =, thn,,, ar all n β. If u = λ g, λ 0 and wt ( u ) =, thn λ ( λ χ ( )) ( λ χ ( )) and u = ( λ χ ( g )) 0. Hnc, u λ g I β u = 0, u = g 0, u = g 0 d I β. = ndcats that ( ) Malaysan Journal of Mathmatcal Scncs 09

10 Dns C. K. Wong & Ang M. H xt, consdr u = λ + λ r, by usng quaton () to (7): = ( λ + λ ), = ( λ + λ ), = ( λ + λ ) and u ( λ λ ) u u u 0 λ λ = +. u = u = u = u = f and only f = 0. Clarly, u I β and so d ( I β ) =. Q.E.D. a (, β,) From ths lmma, w mmdatly conclud that β, thn I β s group cod. Furthrmor, I β s a MDS cod f and only f β =. Th nxt rsult can b provd by usng smlar mthod as Lmma.. Lmma.. Lt = { 5 } whr s th nonlnar dmpotnt n FD, thn 5 ( { } ) ( ) d I 5 = and { 5} dm I =. Furthrmor, lt u = λ g + λ g, λ 0 and λ 0 wth g g D, thn u I f and only f g, g { } Thorm.5. Lt {, } 5 5 H. = whr s any on of th lnar dmpotnts and s th nonlnar dmpotnt n FD, thn d 5 ( I ) = and so I s a (,, ) group cod. Proof. Wthout loss of gnralty, w only prov for th cas {, } =. By Lmma.7 and Lmma., w know that d ( I ). By th scond statmnt n Lmma., f u = λ g + λ g, λ 0 and λ 0, thn thr g, g n H or g, g n sh or on n H and th othr n sh wll not produc a codword n I. Ths follows from quatons () and () n whch always gvs th soluton λ = λ = 0. xt, for u = λ g + λ g + λ g, λ 0 and k k λ 0 and λ 0, w hav thr g, g, g all ls n H (rsp. sh ) or k k k g, g ls n H (rsp. sh ) but g ls n sh (rsp. H ). For both cass, by usng quatons () and (), u s not contand n I. Fnally, f u = + r + r + r, 0, 0, 0 and λ 0, thn u λ λ λ λ λ λ λ = ( λ + λ + λ + λ ) and ( λ λ ) ( λ λ ) u = + r Malaysan Journal of Mathmatcal Scncs

11 Group Cods Dfn Ovr Dhdral Groups of Small Ordr Thus, u = u = 0 f and only f λ + λ + λ + λ = 0 and λ λ = 0 and 5 λ λ = 0. Th only soluton for th abov s λ = λ 0 and λ = λ 0, So, λ + λ + λ + λ = 0 mpls that λ + λ = 0 and so λ = λ 0. Thus, w obtan a st of nonzro soluton and so u u I. In othr word, d ( I ) =. Q.E.D. Thorm.. Lt,,,, b th dmpotnts n FD, thn 5 d ( I {,, 5 } ) = and ( ) {,, 5 } dm I =, whr, =,,,,. Proof. By Lmma.7 and Thorm.5, w only nd to show that thr xsts a codword of wght n I, whr, =,,,,. Snc {,, } 5 most calculatons ar routnd, thn w only stat a codword of wght n ach group cod. () u = λ + λ r + λ r + λ r I. {,, } 5 () u = λ + λ r + λ s + λ r s I. 5 7 {,, } 5 () u = λ + λ r + λ rs + λ r s I. {,, } 5 (v) u = λ + λ r + λ rs + λ r s I. {,, } 5 (v) u = λ + λ r + λ rs + λ r s I. 7 {,, } 5 (v) u = λ + λ r + λ r + λ r I. {,, 5} Q.E.D. Corollary.7. d ( I ) {,,, 5 = and k ( ) } {,, k, } { },, k,,,, k. d I =, whr 5 Proof. Th proof s smlar to Thorm., and so wthout loss of gnalty,,, =,,, w consdr only = { }, n th cas of { } ( {,, } ) d I =, thus w may assum that th cod gnratd by {,,, } = has mnmum dstanc gratr than or qual to. 5 By usng quatons (), (5), () and (), t can b shown that no codword of wght, 5,, and 7 n I and so w only xhbt thr s an lmnt of {,, } wght n I. {,, } 5 5 Malaysan Journal of Mathmatcal Scncs

12 If =,,,...,, Dns C. K. Wong & Ang M. H u = λ + λ r + λ r + λ r + λ s + λ rs + λ r s + λ r λ for, thn u u u ( λ λ λ λ λ λ λ λ ) = , 5 7 ( λ λ λ λ λ λ λ λ ) = + + +, 5 7 ( λ λ λ λ λ λ λ λ ) = and 5 7 u r r r = 5 ( ) ( ) ( ) ( ) λ λ + λ λ + λ + λ + λ + λ ( λ λ 5 7 ) s ( λ λ ) rs ( λ λ 5 7 ) r s ( λ λ ) r s] Thus, u = u = u = u = 0 f and only f 5 λ + λ + λ + λ + λ + λ + λ + λ = 0, 5 7 λ + λ + λ + λ λ λ λ λ = 0, 5 7 λ λ + λ λ + λ λ + λ λ = 0, 5 7 λ = λ, λ = λ, λ = λ and λ = λ. 5 7 Hnc, () λ + λ + λ + λ = 0 5 () λ + λ λ λ = 0 5 () λ λ + λ λ = 0 5 Upon solvng () to (), w wll obtan nonzro soluton. Hnc, u I d I =. {,,, } and so ( {,,, } ) 5 5. Cods dfnd ovr FD 0 5 Lt H = r r = and so D = H sh. From Lmma., w s that D 0 0 conssts of rrducbl charactrs, n whch cas, two of thm ar lnar charactrs and th othr two ar nonlnar charactr. Each of ths charactr wll corrspond to a unqu dmpotnt as follows Malaysan Journal of Mathmatcal Scncs

13 Group Cods Dfn Ovr Dhdral Groups of Small Ordr (a) Idmpotnts corrspond to lnar charactrs: ( H sh ) χ = H sh 0 0 χ = + and ( ) (b) Idmpotnts corrspond to th nonlnar charactr χ of dgr : 5 χ = ( ( )( ) ( )( )) r + r + 5 r + r and 0 χ = ( ( )( ) ( )( )) r + r + 5 r + r 0 W sumarz our rsults n th followng thorm. Indd most of thm can b provd by usng smlar argumnt as for group cods n FD and FD. Thorm.. Lt = {, } and {, } whch s dfnd as abov. L = b all dmpotnts n FD 0 () If β such that β =, thn d L ( I β ) = and dm( I β ) = 9. () If β such that β =, thn d ( I β ) = and ( ) dm I β =. Furthrmor, f v I β wth wt( v ) = thn supp( v) D ' or 0 supp( v) sd '. 0 () If β = {, } for =, and =,, thn d ( I β ) = and dm( I β ) = 5. Furthrmor, f v I β wth wt( v ) = thn (v) If supp( v) D ' or supp( v) sd 0 0 '. β =, thn ( ) 0 d I β = and ( ) v wth wt( v ) = 0 thn supp( v)= D ' sd '. 0 0 I β (v) If {,, } β = for, dm I β =. Furthrmor, f =, thn d ( I β ) = and ( ) dm I β =. Furthrmor, f v I β wth wt( v ) = thn supp( v) D ' or 0 supp( v) sd '. (v) If {,, } 0 β = for, =, thn d ( I β ) = 0 and ( ) dm I β =. Furthrmor, f v wth wt( v ) = 0 thn supp( v)= D ' sd '. 0 0 I β Malaysan Journal of Mathmatcal Scncs

14 Dns C. K. Wong & Ang M. H. Cods dfnd ovr FD D conssts of sx rrducbl charactrs, four ar lnar charactrs and two ar nonlnar charactrs. Each of ths charactr wll corrspond to a dstnct dmpotnt n th followng way. (a) Idmpotnts corrspond to lnar charactrs: 5 5 χ = ( r ( + s) ), χ = ( r ( s) ), = 0 = χ ( ( r) ( s) ) χ = ( ) ( ) r s = 0 = 0 = + and ( ) (b) Idmpotnts corrspond to nonlnar charactrs: χ = 5 5 ( r r ) ( + r ) and χ = ( r r )( r ) Lt 7 u = λ r + λ r s b any lmnts n FD such that = = 7 λ F, thn u u u u = ( λ ) = ( λ ( λ )) = = 7 λ ( λ ) = + ( ) =,,5,7,9, =,,,,0, ( λ ( λ )) =,,5,,0, =,,,7,9, = + = + u = = ( λ λ λ λ λ λ ) ( λ λ λ λ λ λ ) r ( λ λ λ λ λ λ 5 ) r ( λ λ λ λ λ λ 5 ) r 5 ( λ λ λ λ λ λ 5 ) r ( λ λ λ λ λ λ 5 ) r ( λ λ λ λ λ λ ) s ( λ λ λ λ λ λ ) r s ( λ λ λ λ λ + λ 7 ) r s + ( λ λ + λ λ λ + λ ) r 5 s ] u = ( λ λ λ λ λ λ ) ( λ λ λ λ λ λ ) r ( λ λ λ λ λ λ 5 ) r ( λ λ λ λ λ λ 5 ) r 5 ( λ λ λ λ λ λ 5 ) r ( λ λ λ λ λ λ 5 ) r ( λ λ λ λ λ λ ) s ( λ λ λ λ λ λ ) r s ( λ λ λ λ λ λ 7 9 ) rs 0 ( λ + λ + λ λ λ λ ) r s ( λ λ λ λ λ λ ) r s ( λ λ λ λ λ λ ) r 5 s ] (9) (0) () () () () Malaysan Journal of Mathmatcal Scncs

15 Group Cods Dfn Ovr Dhdral Groups of Small Ordr Thorm.9. Lt = {,,, } and {, } L FD whch s dfnd as abov. () If β, thn d L ( I β ) = and ( I β ) = b all dmpotnts n 5 dm = β. () If β and β =, thn d ( I β ) = and dm( I β ) =. () If β = {, 5 }, thn d ( I {, } ) = only f = or, and ( ) 5 {, } only f = or. Furthrmor, dm( I β ) = 7. (v) If β = {, }, thn d ( I {, } ) = only f = or, and ( ) {, } only f = or. Furthrmor, dm( I β ) = 7. (v) d ( I ) = and dm( I β ) =. (v) d ( I{,, } ) = d ( I{,, } ) = and dm 5 ( I ) β =. (v) d ( I{,, } ) = d ( I{,, } ) = and dm 5 ( I ) β =. (v) d ( I ) = d ( I {,, } {,, } ) = d ( I{,, } ) = d ( I{,, } ) = and ( ) (x) d ( I {,, } ) = for =,,,, and dm 5 ( I ) β =. (x) d ( I {,,, 5 } ) =, whr,, k =,,,, k, and dm( I ) 7 k β =. (x) d ( I{, } ) = d ( I{, } ) = and dm ( I β ) =. (x) d ( I{, } ) = d ( I{, } ) = and dm ( I β ) =. (x) If β and β =, thn d ( I β ) = and dm( I ) β =. L d I = 5 d I = ) dm I β =. REFERECES Brman, S. D. 97. Smsmpl Cyclc and Ablan Cods, II. Kbrntka. : -0. Brman, S. D. 99. Paramtr of Ablan Cods n th Group Algbra KG of G = <a> <b>, a p = b p =, p s prm, ovr a fnt fld K wth a prmtv p th root of unty and rlatd MDS-Cods. Contmpary Math. 9. Malaysan Journal of Mathmatcal Scncs 5

16 Dns C. K. Wong & Ang M. H How Guan Aun and Dns Wong Ch Kong. 00. Group Cods Dfnd Usng Extra-Spcal p-group of Ordr p. Bull. Malays. Math. Sc. Soc. : 7: Hurly, P. and Hurly, T Modul cods n group rngs. Proc. IEEE Int. Symp. on Informaton Thory (ISIT). Hurly, P. and Hurly, T Cods from Zro-dvsors and unts n group rngs. Int. J. Inform, and Codng Thory. : Isaacs, I. M. 99. Algbra, A Graduat Cours. Calforna: Brooks/Col Publshng. Pacfc Grov. Jams, G. D. and Lbck, M. W. 99. Rprsntatons and Charactrs of groups. Cambrdg Unvrsty Prss. Macwllam, F. J. 99. Cods and dals n group algbras, n Combnatoral Mathmatcs and ts Applcatons, R.C. Bos and T.A. Dowlng, ds., Chapl Hll: Unv. orth Carolna Prss, 7-. Passman, D. S Th Algbrac Structur of Group Rngs. w York: Wly. Sloan,. J. A. and Macwllam, F. J. 97. Th Thory of Error Corrctng Cods. Amstrdam, thrlands: orth-holland. Malaysan Journal of Mathmatcal Scncs

Lucas Test is based on Euler s theorem which states that if n is any integer and a is coprime to n, then a φ(n) 1modn.

Lucas Test is based on Euler s theorem which states that if n is any integer and a is coprime to n, then a φ(n) 1modn. Modul 10 Addtonal Topcs 10.1 Lctur 1 Prambl: Dtrmnng whthr a gvn ntgr s prm or compost s known as prmalty tstng. Thr ar prmalty tsts whch mrly tll us whthr a gvn ntgr s prm or not, wthout gvng us th factors

More information

ON THE COMPLEXITY OF K-STEP AND K-HOP DOMINATING SETS IN GRAPHS

ON THE COMPLEXITY OF K-STEP AND K-HOP DOMINATING SETS IN GRAPHS MATEMATICA MONTISNIRI Vol XL (2017) MATEMATICS ON TE COMPLEXITY OF K-STEP AN K-OP OMINATIN SETS IN RAPS M FARAI JALALVAN AN N JAFARI RA partmnt of Mathmatcs Shahrood Unrsty of Tchnology Shahrood Iran Emals:

More information

A Note on Estimability in Linear Models

A Note on Estimability in Linear Models Intrnatonal Journal of Statstcs and Applcatons 2014, 4(4): 212-216 DOI: 10.5923/j.statstcs.20140404.06 A Not on Estmablty n Lnar Modls S. O. Adymo 1,*, F. N. Nwob 2 1 Dpartmnt of Mathmatcs and Statstcs,

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013 18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:

More information

Folding of Regular CW-Complexes

Folding of Regular CW-Complexes Ald Mathmatcal Scncs, Vol. 6,, no. 83, 437-446 Foldng of Rgular CW-Comlxs E. M. El-Kholy and S N. Daoud,3. Dartmnt of Mathmatcs, Faculty of Scnc Tanta Unvrsty,Tanta,Egyt. Dartmnt of Mathmatcs, Faculty

More information

Section 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation.

Section 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation. MAT 444 H Barclo Spring 004 Homwork 6 Solutions Sction 6 Lt H b a subgroup of a group G Thn H oprats on G by lft multiplication Dscrib th orbits for this opration Th orbits of G ar th right costs of H

More information

CHAPTER 7d. DIFFERENTIATION AND INTEGRATION

CHAPTER 7d. DIFFERENTIATION AND INTEGRATION CHAPTER 7d. DIFFERENTIATION AND INTEGRATION A. J. Clark School o Engnrng Dpartmnt o Cvl and Envronmntal Engnrng by Dr. Ibrahm A. Assakka Sprng ENCE - Computaton Mthods n Cvl Engnrng II Dpartmnt o Cvl and

More information

ON RAMIFICATION POLYGONS AND GALOIS GROUPS OF EISENSTEIN POLYNOMIALS

ON RAMIFICATION POLYGONS AND GALOIS GROUPS OF EISENSTEIN POLYNOMIALS ON RAMIFICATION POLYGONS AND GALOIS GROUPS OF EISENSTEIN POLYNOMIALS CHRISTIAN GREVE AND SEBASTIAN PAULI Abstract Lt ϕx b an Esnstn polynomal of dgr n ovr a local fld and α b a root of ϕx Our man tool

More information

ON EISENSTEIN-DUMAS AND GENERALIZED SCHÖNEMANN POLYNOMIALS

ON EISENSTEIN-DUMAS AND GENERALIZED SCHÖNEMANN POLYNOMIALS ON EISENSTEIN-DUMAS AND GENERALIZED SCHÖNEMANN POLYNOMIALS Anuj Bshno and Sudsh K. Khanduja Dpartmnt of Mathmatcs, Panjab Unvrsty, Chandgarh-160014, Inda. E-mal: anuj.bshn@gmal.com, skhand@pu.ac.n ABSTRACT.

More information

Lifting Constructions of Strongly Regular Cayley Graphs

Lifting Constructions of Strongly Regular Cayley Graphs Lftng Constructons of Strongly Rgular Cayly Graphs Koj Momhara Qng Xang Abstract W gv two lftng constructons of strongly rgular Cayly graphs. In th frst constructon w lft a cyclotomc strongly rgular graph

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!

More information

te Finance (4th Edition), July 2017.

te Finance (4th Edition), July 2017. Appndx Chaptr. Tchncal Background Gnral Mathmatcal and Statstcal Background Fndng a bas: 3 2 = 9 3 = 9 1 /2 x a = b x = b 1/a A powr of 1 / 2 s also quvalnt to th squar root opraton. Fndng an xponnt: 3

More information

The Hyperelastic material is examined in this section.

The Hyperelastic material is examined in this section. 4. Hyprlastcty h Hyprlastc matral s xad n ths scton. 4..1 Consttutv Equatons h rat of chang of ntrnal nrgy W pr unt rfrnc volum s gvn by th strss powr, whch can b xprssd n a numbr of dffrnt ways (s 3.7.6):

More information

8-node quadrilateral element. Numerical integration

8-node quadrilateral element. Numerical integration Fnt Elmnt Mthod lctur nots _nod quadrlatral lmnt Pag of 0 -nod quadrlatral lmnt. Numrcal ntgraton h tchnqu usd for th formulaton of th lnar trangl can b formall tndd to construct quadrlatral lmnts as wll

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!

More information

Construction of asymmetric orthogonal arrays of strength three via a replacement method

Construction of asymmetric orthogonal arrays of strength three via a replacement method isid/ms/26/2 Fbruary, 26 http://www.isid.ac.in/ statmath/indx.php?modul=prprint Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng and Alok Dy

More information

Total Prime Graph. Abstract: We introduce a new type of labeling known as Total Prime Labeling. Graphs which admit a Total Prime labeling are

Total Prime Graph. Abstract: We introduce a new type of labeling known as Total Prime Labeling. Graphs which admit a Total Prime labeling are Itratoal Joural Of Computatoal Egrg Rsarch (crol.com) Vol. Issu. 5 Total Prm Graph M.Rav (a) Ramasubramaa 1, R.Kala 1 Dpt.of Mathmatcs, Sr Shakth Isttut of Egrg & Tchology, Combator 641 06. Dpt. of Mathmatcs,

More information

10/7/14. Mixture Models. Comp 135 Introduction to Machine Learning and Data Mining. Maximum likelihood estimation. Mixture of Normals in 1D

10/7/14. Mixture Models. Comp 135 Introduction to Machine Learning and Data Mining. Maximum likelihood estimation. Mixture of Normals in 1D Comp 35 Introducton to Machn Larnng and Data Mnng Fall 204 rofssor: Ron Khardon Mxtur Modls Motvatd by soft k-mans w dvlopd a gnratv modl for clustrng. Assum thr ar k clustrs Clustrs ar not rqurd to hav

More information

Economics 600: August, 2007 Dynamic Part: Problem Set 5. Problems on Differential Equations and Continuous Time Optimization

Economics 600: August, 2007 Dynamic Part: Problem Set 5. Problems on Differential Equations and Continuous Time Optimization THE UNIVERSITY OF MARYLAND COLLEGE PARK, MARYLAND Economcs 600: August, 007 Dynamc Part: Problm St 5 Problms on Dffrntal Equatons and Contnuous Tm Optmzaton Quston Solv th followng two dffrntal quatons.

More information

Grand Canonical Ensemble

Grand Canonical Ensemble Th nsmbl of systms mmrsd n a partcl-hat rsrvor at constant tmpratur T, prssur P, and chmcal potntal. Consdr an nsmbl of M dntcal systms (M =,, 3,...M).. Thy ar mutually sharng th total numbr of partcls

More information

Heisenberg Model. Sayed Mohammad Mahdi Sadrnezhaad. Supervisor: Prof. Abdollah Langari

Heisenberg Model. Sayed Mohammad Mahdi Sadrnezhaad. Supervisor: Prof. Abdollah Langari snbrg Modl Sad Mohammad Mahd Sadrnhaad Survsor: Prof. bdollah Langar bstract: n ths rsarch w tr to calculat analtcall gnvalus and gnvctors of fnt chan wth ½-sn artcls snbrg modl. W drov gnfuctons for closd

More information

SCHUR S THEOREM REU SUMMER 2005

SCHUR S THEOREM REU SUMMER 2005 SCHUR S THEOREM REU SUMMER 2005 1. Combinatorial aroach Prhas th first rsult in th subjct blongs to I. Schur and dats back to 1916. On of his motivation was to study th local vrsion of th famous quation

More information

Review - Probabilistic Classification

Review - Probabilistic Classification Mmoral Unvrsty of wfoundland Pattrn Rcognton Lctur 8 May 5, 6 http://www.ngr.mun.ca/~charlsr Offc Hours: Tusdays Thursdays 8:3-9:3 PM E- (untl furthr notc) Gvn lablld sampls { ɛc,,,..., } {. Estmat Rvw

More information

Consider a system of 2 simultaneous first order linear equations

Consider a system of 2 simultaneous first order linear equations Soluon of sysms of frs ordr lnar quaons onsdr a sysm of smulanous frs ordr lnar quaons a b c d I has h alrna mar-vcor rprsnaon a b c d Or, n shorhand A, f A s alrady known from con W know ha h abov sysm

More information

Jones vector & matrices

Jones vector & matrices Jons vctor & matrcs PY3 Colást na hollscol Corcagh, Ér Unvrst Collg Cork, Irland Dpartmnt of Phscs Matr tratmnt of polarzaton Consdr a lght ra wth an nstantanous -vctor as shown k, t ˆ k, t ˆ k t, o o

More information

A general N-dimensional vector consists of N values. They can be arranged as a column or a row and can be real or complex.

A general N-dimensional vector consists of N values. They can be arranged as a column or a row and can be real or complex. Lnr lgr Vctors gnrl -dmnsonl ctor conssts of lus h cn rrngd s column or row nd cn rl or compl Rcll -dmnsonl ctor cn rprsnt poston, loct, or cclrton Lt & k,, unt ctors long,, & rspctl nd lt k h th componnts

More information

Aotomorphic Functions And Fermat s Last Theorem(4)

Aotomorphic Functions And Fermat s Last Theorem(4) otomorphc Fuctos d Frmat s Last Thorm(4) Chu-Xua Jag P. O. Box 94 Bg 00854 P. R. Cha agchuxua@sohu.com bsract 67 Frmat wrot: It s mpossbl to sparat a cub to two cubs or a bquadrat to two bquadrats or gral

More information

COMPLEX NUMBER PAIRWISE COMPARISON AND COMPLEX NUMBER AHP

COMPLEX NUMBER PAIRWISE COMPARISON AND COMPLEX NUMBER AHP ISAHP 00, Bal, Indonsa, August -9, 00 COMPLEX NUMBER PAIRWISE COMPARISON AND COMPLEX NUMBER AHP Chkako MIYAKE, Kkch OHSAWA, Masahro KITO, and Masaak SHINOHARA Dpartmnt of Mathmatcal Informaton Engnrng

More information

VISUALIZATION OF DIFFERENTIAL GEOMETRY UDC 514.7(045) : : Eberhard Malkowsky 1, Vesna Veličković 2

VISUALIZATION OF DIFFERENTIAL GEOMETRY UDC 514.7(045) : : Eberhard Malkowsky 1, Vesna Veličković 2 FACTA UNIVERSITATIS Srs: Mchancs, Automatc Control Robotcs Vol.3, N o, 00, pp. 7-33 VISUALIZATION OF DIFFERENTIAL GEOMETRY UDC 54.7(045)54.75.6:59.688:59.673 Ebrhard Malkowsky, Vsna Vlčkovć Dpartmnt of

More information

Lecture 23 APPLICATIONS OF FINITE ELEMENT METHOD TO SCALAR TRANSPORT PROBLEMS

Lecture 23 APPLICATIONS OF FINITE ELEMENT METHOD TO SCALAR TRANSPORT PROBLEMS COMPUTTION FUID DYNMICS: FVM: pplcatons to Scalar Transport Prolms ctur 3 PPICTIONS OF FINITE EEMENT METHOD TO SCR TRNSPORT PROBEMS 3. PPICTION OF FEM TO -D DIFFUSION PROBEM Consdr th stady stat dffuson

More information

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0 unction Spacs Prrquisit: Sction 4.7, Coordinatization n this sction, w apply th tchniqus of Chaptr 4 to vctor spacs whos lmnts ar functions. Th vctor spacs P n and P ar familiar xampls of such spacs. Othr

More information

cycle that does not cross any edges (including its own), then it has at least

cycle that does not cross any edges (including its own), then it has at least W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th

More information

On the irreducibility of some polynomials in two variables

On the irreducibility of some polynomials in two variables ACTA ARITHMETICA LXXXII.3 (1997) On th irrducibility of som polynomials in two variabls by B. Brindza and Á. Pintér (Dbrcn) To th mmory of Paul Erdős Lt f(x) and g(y ) b polynomials with intgral cofficints

More information

Journal of Theoretical and Applied Information Technology 10 th January Vol. 47 No JATIT & LLS. All rights reserved.

Journal of Theoretical and Applied Information Technology 10 th January Vol. 47 No JATIT & LLS. All rights reserved. Journal o Thortcal and Appld Inormaton Tchnology th January 3. Vol. 47 No. 5-3 JATIT & LLS. All rghts rsrvd. ISSN: 99-8645 www.att.org E-ISSN: 87-395 RESEARCH ON PROPERTIES OF E-PARTIAL DERIVATIVE OF LOGIC

More information

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1 Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1

More information

Derangements and Applications

Derangements and Applications 2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir

More information

Einstein Equations for Tetrad Fields

Einstein Equations for Tetrad Fields Apiron, Vol 13, No, Octobr 006 6 Einstin Equations for Ttrad Filds Ali Rıza ŞAHİN, R T L Istanbul (Turky) Evry mtric tnsor can b xprssd by th innr product of ttrad filds W prov that Einstin quations for

More information

ANALYTICITY THEOREM FOR FRACTIONAL LAPLACE TRANSFORM

ANALYTICITY THEOREM FOR FRACTIONAL LAPLACE TRANSFORM Sc. Rs. hm. ommn.: (3, 0, 77-8 ISSN 77-669 ANALYTIITY THEOREM FOR FRATIONAL LAPLAE TRANSFORM P. R. DESHMUH * and A. S. GUDADHE a Prof. Ram Mgh Insttt of Tchnology & Rsarch, Badnra, AMRAVATI (M.S. INDIA

More information

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim (implicit in notation and n a positiv intgr, lt ν(n dnot th xponnt of p in n, and U(n n/p ν(n, th unit

More information

Search sequence databases 3 10/25/2016

Search sequence databases 3 10/25/2016 Sarch squnc databass 3 10/25/2016 Etrm valu distribution Ø Suppos X is a random variabl with probability dnsity function p(, w sampl a larg numbr S of indpndnt valus of X from this distribution for an

More information

COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM

COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM Jim Brown Dpartmnt of Mathmatical Scincs, Clmson Univrsity, Clmson, SC 9634, USA jimlb@g.clmson.du Robrt Cass Dpartmnt of Mathmatics,

More information

(Upside-Down o Direct Rotation) β - Numbers

(Upside-Down o Direct Rotation) β - Numbers Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg

More information

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA NE APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA Mirca I CÎRNU Ph Dp o Mathmatics III Faculty o Applid Scincs Univrsity Polithnica o Bucharst Cirnumirca @yahoocom Abstract In a rcnt papr [] 5 th indinit intgrals

More information

ON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park

ON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park Kangwon-Kyungki Math. Jour. 11 (2003), No. 2, pp. 147 153 ON RIGHT(LEFT) DUO PO-SEMIGROUPS S. K. L and K. Y. Park Abstract. W invstigat som proprtis on right(rsp. lft) duo po-smigroups. 1. Introduction

More information

September 27, Introduction to Ordinary Differential Equations. ME 501A Seminar in Engineering Analysis Page 1. Outline

September 27, Introduction to Ordinary Differential Equations. ME 501A Seminar in Engineering Analysis Page 1. Outline Introucton to Ornar Dffrntal Equatons Sptmbr 7, 7 Introucton to Ornar Dffrntal Equatons Larr artto Mchancal Engnrng AB Smnar n Engnrng Analss Sptmbr 7, 7 Outln Rvw numrcal solutons Bascs of ffrntal quatons

More information

Lecture 3: Phasor notation, Transfer Functions. Context

Lecture 3: Phasor notation, Transfer Functions. Context EECS 5 Fall 4, ctur 3 ctur 3: Phasor notaton, Transfr Functons EECS 5 Fall 3, ctur 3 Contxt In th last lctur, w dscussd: how to convrt a lnar crcut nto a st of dffrntal quatons, How to convrt th st of

More information

On spanning trees and cycles of multicolored point sets with few intersections

On spanning trees and cycles of multicolored point sets with few intersections On spanning trs and cycls of multicolord point sts with fw intrsctions M. Kano, C. Mrino, and J. Urrutia April, 00 Abstract Lt P 1,..., P k b a collction of disjoint point sts in R in gnral position. W

More information

Basic Polyhedral theory

Basic Polyhedral theory Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist

More information

Self-Adjointness and Its Relationship to Quantum Mechanics. Ronald I. Frank 2016

Self-Adjointness and Its Relationship to Quantum Mechanics. Ronald I. Frank 2016 Ronald I. Frank 06 Adjoint https://n.wikipdia.org/wiki/adjoint In gnral thr is an oprator and a procss that dfin its adjoint *. It is thn slf-adjoint if *. Innr product spac https://n.wikipdia.org/wiki/innr_product_spac

More information

The van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012

The van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012 Th van dr Waals intraction D. E. Sopr 2 Univrsity of Orgon 20 pril 202 Th van dr Waals intraction is discussd in Chaptr 5 of J. J. Sakurai, Modrn Quantum Mchanics. Hr I tak a look at it in a littl mor

More information

Hardy-Littlewood Conjecture and Exceptional real Zero. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R.

Hardy-Littlewood Conjecture and Exceptional real Zero. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R. Hardy-Littlwood Conjctur and Excptional ral Zro JinHua Fi ChangLing Company of Elctronic Tchnology Baoji Shannxi P.R.China E-mail: fijinhuayoujian@msn.com Abstract. In this papr, w assum that Hardy-Littlwood

More information

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim and n a positiv intgr, lt ν p (n dnot th xponnt of p in n, and u p (n n/p νp(n th unit part of n. If α

More information

In 1991 Fermat s Last Theorem Has Been Proved

In 1991 Fermat s Last Theorem Has Been Proved I 99 Frmat s Last Thorm Has B Provd Chu-Xua Jag P.O.Box 94Bg 00854Cha Jcxua00@s.com;cxxxx@6.com bstract I 67 Frmat wrot: It s mpossbl to sparat a cub to two cubs or a bquadrat to two bquadrats or gral

More information

ON THE INTEGRAL INVARIANTS OF KINEMATICALLY GENERATED RULED SURFACES *

ON THE INTEGRAL INVARIANTS OF KINEMATICALLY GENERATED RULED SURFACES * Iranan Journal of Scnc & Tchnology Transacton A ol 9 No A Prntd n Th Islamc Rpublc of Iran 5 Shraz Unvrsty ON TH INTGRAL INARIANTS OF KINMATICALLY GNRATD RULD SURFACS H B KARADAG AND S KLS Dpartmnt of

More information

CHAPTER 33: PARTICLE PHYSICS

CHAPTER 33: PARTICLE PHYSICS Collg Physcs Studnt s Manual Chaptr 33 CHAPTER 33: PARTICLE PHYSICS 33. THE FOUR BASIC FORCES 4. (a) Fnd th rato of th strngths of th wak and lctromagntc forcs undr ordnary crcumstancs. (b) What dos that

More information

Thus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases.

Thus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases. Homwork 5 M 373K Solutions Mark Lindbrg and Travis Schdlr 1. Prov that th ring Z/mZ (for m 0) is a fild if and only if m is prim. ( ) Proof by Contrapositiv: Hr, thr ar thr cass for m not prim. m 0: Whn

More information

MP IN BLOCK QUASI-INCOHERENT DICTIONARIES

MP IN BLOCK QUASI-INCOHERENT DICTIONARIES CHOOL O ENGINEERING - TI IGNAL PROCEING INTITUTE Lornzo Potta and Prr Vandrghynst CH-1015 LAUANNE Tlphon: 4121 6932601 Tlfax: 4121 6937600 -mal: lornzo.potta@pfl.ch ÉCOLE POLYTECHNIQUE ÉDÉRALE DE LAUANNE

More information

Decision-making with Distance-based Operators in Fuzzy Logic Control

Decision-making with Distance-based Operators in Fuzzy Logic Control Dcson-makng wth Dstanc-basd Oprators n Fuzzy Logc Control Márta Takács Polytchncal Engnrng Collg, Subotca 24000 Subotca, Marka Orškovća 16., Yugoslava marta@vts.su.ac.yu Abstract: Th norms and conorms

More information

Elements of Statistical Thermodynamics

Elements of Statistical Thermodynamics 24 Elmnts of Statistical Thrmodynamics Statistical thrmodynamics is a branch of knowldg that has its own postulats and tchniqus. W do not attmpt to giv hr vn an introduction to th fild. In this chaptr,

More information

COHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.

COHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim. MTH rviw part b Lucian Mitroiu Th LOG and EXP functions Th ponntial function p : R, dfind as Proprtis: lim > lim p Eponntial function Y 8 6 - -8-6 - - X Th natural logarithm function ln in US- log: function

More information

Quasi-Classical States of the Simple Harmonic Oscillator

Quasi-Classical States of the Simple Harmonic Oscillator Quasi-Classical Stats of th Simpl Harmonic Oscillator (Draft Vrsion) Introduction: Why Look for Eignstats of th Annihilation Oprator? Excpt for th ground stat, th corrspondnc btwn th quantum nrgy ignstats

More information

SIMEON BALL AND AART BLOKHUIS

SIMEON BALL AND AART BLOKHUIS A BOUND FOR THE MAXIMUM WEIGHT OF A LINEAR CODE SIMEON BALL AND AART BLOKHUIS Absrac. I s shown ha h paramrs of a lnar cod ovr F q of lngh n, dmnson k, mnmum wgh d and maxmum wgh m sasfy a cran congrunc

More information

REPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS

REPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS REPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS JIAQI JIANG Abstract. This papr studis th rlationship btwn rprsntations of a Li group and rprsntations of its Li algbra. W will mak th corrspondnc in two

More information

Independent Domination in Line Graphs

Independent Domination in Line Graphs Itratoal Joural of Sctfc & Egrg Rsarch Volum 3 Issu 6 Ju-1 1 ISSN 9-5518 Iddt Domato L Grahs M H Muddbhal ad D Basavarajaa Abstract - For ay grah G th l grah L G H s th trscto grah Thus th vrtcs of LG

More information

Some remarks on Kurepa s left factorial

Some remarks on Kurepa s left factorial Som rmarks on Kurpa s lft factorial arxiv:math/0410477v1 [math.nt] 21 Oct 2004 Brnd C. Kllnr Abstract W stablish a connction btwn th subfactorial function S(n) and th lft factorial function of Kurpa K(n).

More information

An Application of Hardy-Littlewood Conjecture. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R.China

An Application of Hardy-Littlewood Conjecture. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R.China An Application of Hardy-Littlwood Conjctur JinHua Fi ChangLing Company of Elctronic Tchnology Baoji Shannxi P.R.China E-mail: fijinhuayoujian@msn.com Abstract. In this papr, w assum that wakr Hardy-Littlwood

More information

Cramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter

Cramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter WHEN THE CRAMÉR-RAO INEQUALITY PROVIDES NO INFORMATION STEVEN J. MILLER Abstract. W invstigat a on-paramtr family of probability dnsitis (rlatd to th Parto distribution, which dscribs many natural phnomna)

More information

The Equitable Dominating Graph

The Equitable Dominating Graph Intrnational Journal of Enginring Rsarch and Tchnology. ISSN 0974-3154 Volum 8, Numbr 1 (015), pp. 35-4 Intrnational Rsarch Publication Hous http://www.irphous.com Th Equitabl Dominating Graph P.N. Vinay

More information

Chiang Mai J. Sci. 2014; 41(2) 457 ( 2) ( ) ( ) forms a simply periodic Proof. Let q be a positive integer. Since

Chiang Mai J. Sci. 2014; 41(2) 457 ( 2) ( ) ( ) forms a simply periodic Proof. Let q be a positive integer. Since 56 Chag Ma J Sc 0; () Chag Ma J Sc 0; () : 56-6 http://pgscccmuacth/joural/ Cotrbutd Papr Th Padova Sucs Ft Groups Sat Taș* ad Erdal Karaduma Dpartmt of Mathmatcs, Faculty of Scc, Atatürk Uvrsty, 50 Erzurum,

More information

External Equivalent. EE 521 Analysis of Power Systems. Chen-Ching Liu, Boeing Distinguished Professor Washington State University

External Equivalent. EE 521 Analysis of Power Systems. Chen-Ching Liu, Boeing Distinguished Professor Washington State University xtrnal quvalnt 5 Analyss of Powr Systms Chn-Chng Lu, ong Dstngushd Profssor Washngton Stat Unvrsty XTRNAL UALNT ach powr systm (ara) s part of an ntrconnctd systm. Montorng dvcs ar nstalld and data ar

More information

Summary: Solving a Homogeneous System of Two Linear First Order Equations in Two Unknowns

Summary: Solving a Homogeneous System of Two Linear First Order Equations in Two Unknowns Summary: Solvng a Homognous Sysm of Two Lnar Frs Ordr Equaons n Two Unknowns Gvn: A Frs fnd h wo gnvalus, r, and hr rspcv corrspondng gnvcors, k, of h coffcn mar A Dpndng on h gnvalus and gnvcors, h gnral

More information

DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P

DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P Tsz Ho Chan Dartmnt of Mathmatics, Cas Wstrn Rsrv Univrsity, Clvland, OH 4406, USA txc50@cwru.du Rcivd: /9/03, Rvisd: /9/04,

More information

Equidistribution and Weyl s criterion

Equidistribution and Weyl s criterion Euidistribution and Wyl s critrion by Brad Hannigan-Daly W introduc th ida of a sunc of numbrs bing uidistributd (mod ), and w stat and prov a thorm of Hrmann Wyl which charactrizs such suncs. W also discuss

More information

arxiv: v1 [math.pr] 28 Jan 2019

arxiv: v1 [math.pr] 28 Jan 2019 CRAMÉR-TYPE MODERATE DEVIATION OF NORMAL APPROXIMATION FOR EXCHANGEABLE PAIRS arxv:190109526v1 [mathpr] 28 Jan 2019 ZHUO-SONG ZHANG Abstract In Stn s mthod, an xchangabl par approach s commonly usd to

More information

Physics 256: Lecture 2. Physics

Physics 256: Lecture 2. Physics Physcs 56: Lctur Intro to Quantum Physcs Agnda for Today Complx Numbrs Intrfrnc of lght Intrfrnc Two slt ntrfrnc Dffracton Sngl slt dffracton Physcs 01: Lctur 1, Pg 1 Constructv Intrfrnc Ths wll occur

More information

Limiting value of higher Mahler measure

Limiting value of higher Mahler measure Limiting valu of highr Mahlr masur Arunabha Biswas a, Chris Monico a, a Dpartmnt of Mathmatics & Statistics, Txas Tch Univrsity, Lubbock, TX 7949, USA Abstract W considr th k-highr Mahlr masur m k P )

More information

CS 361 Meeting 12 10/3/18

CS 361 Meeting 12 10/3/18 CS 36 Mting 2 /3/8 Announcmnts. Homwork 4 is du Friday. If Friday is Mountain Day, homwork should b turnd in at my offic or th dpartmnt offic bfor 4. 2. Homwork 5 will b availabl ovr th wknd. 3. Our midtrm

More information

1 Isoparametric Concept

1 Isoparametric Concept UNIVERSITY OF CALIFORNIA BERKELEY Dpartmnt of Civil Enginring Spring 06 Structural Enginring, Mchanics and Matrials Profssor: S. Govindj Nots on D isoparamtric lmnts Isoparamtric Concpt Th isoparamtric

More information

Minimum Spanning Trees

Minimum Spanning Trees Mnmum Spnnng Trs Spnnng Tr A tr (.., connctd, cyclc grph) whch contns ll th vrtcs of th grph Mnmum Spnnng Tr Spnnng tr wth th mnmum sum of wghts 1 1 Spnnng forst If grph s not connctd, thn thr s spnnng

More information

Deift/Zhou Steepest descent, Part I

Deift/Zhou Steepest descent, Part I Lctur 9 Dift/Zhou Stpst dscnt, Part I W now focus on th cas of orthogonal polynomials for th wight w(x) = NV (x), V (x) = t x2 2 + x4 4. Sinc th wight dpnds on th paramtr N N w will writ π n,n, a n,n,

More information

22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches.

22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches. Subjct Chmistry Papr No and Titl Modul No and Titl Modul Tag 8/ Physical Spctroscopy / Brakdown of th Born-Oppnhimr approximation. Slction ruls for rotational-vibrational transitions. P, R branchs. CHE_P8_M

More information

3.4 Properties of the Stress Tensor

3.4 Properties of the Stress Tensor cto.4.4 Proprts of th trss sor.4. trss rasformato Lt th compots of th Cauchy strss tsor a coordat systm wth bas vctors b. h compots a scod coordat systm wth bas vctors j,, ar gv by th tsor trasformato

More information

Smarandache-Zero Divisors in Group Rings

Smarandache-Zero Divisors in Group Rings Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the

More information

Background: We have discussed the PIB, HO, and the energy of the RR model. In this chapter, the H-atom, and atomic orbitals.

Background: We have discussed the PIB, HO, and the energy of the RR model. In this chapter, the H-atom, and atomic orbitals. Chaptr 7 Th Hydrogn Atom Background: W hav discussd th PIB HO and th nrgy of th RR modl. In this chaptr th H-atom and atomic orbitals. * A singl particl moving undr a cntral forc adoptd from Scott Kirby

More information

Combinatorial Networks Week 1, March 11-12

Combinatorial Networks Week 1, March 11-12 1 Nots on March 11 Combinatorial Ntwors W 1, March 11-1 11 Th Pigonhol Principl Th Pigonhol Principl If n objcts ar placd in hols, whr n >, thr xists a box with mor than on objcts 11 Thorm Givn a simpl

More information

Abstract Interpretation: concrete and abstract semantics

Abstract Interpretation: concrete and abstract semantics Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion

More information

CLONES IN 3-CONNECTED FRAME MATROIDS

CLONES IN 3-CONNECTED FRAME MATROIDS CLONES IN 3-CONNECTED FRAME MATROIDS JAKAYLA ROBBINS, DANIEL SLILATY, AND XIANGQIAN ZHOU Abstract. W dtrmin th structur o clonal classs o 3-connctd ram matroids in trms o th structur o biasd graphs. Robbins

More information

Spectral Synthesis in the Heisenberg Group

Spectral Synthesis in the Heisenberg Group Intrnational Journal of Mathmatical Analysis Vol. 13, 19, no. 1, 1-5 HIKARI Ltd, www.m-hikari.com https://doi.org/1.1988/ijma.19.81179 Spctral Synthsis in th Hisnbrg Group Yitzhak Wit Dpartmnt of Mathmatics,

More information

A NON-LINEAR MODEL FOR STUDYING THE MOTION OF A HUMAN BODY. Piteşti, , Romania 2 Department of Automotive, University of Piteşti

A NON-LINEAR MODEL FOR STUDYING THE MOTION OF A HUMAN BODY. Piteşti, , Romania 2 Department of Automotive, University of Piteşti ICSV Carns ustrala 9- July 7 NON-LINER MOEL FOR STUYING THE MOTION OF HUMN OY Ncola-oru Stănscu Marna Pandra nl Popa Sorn Il Ştfan-Lucan Tabacu partnt of ppld Mchancs Unvrsty of Ptşt Ptşt 7 Roana partnt

More information

Representation and Reasoning with Uncertain Temporal Relations

Representation and Reasoning with Uncertain Temporal Relations Rprsntaton and Rasonng wth Uncrtan Tmporal Rlatons Vladmr Ryaov (*) Sppo Puuronn (*) Vagan Trzyan (**) (*) Dpartmnt of Computr Scnc and Informaton Systms Unvrsty of Jyvaskyla P.O.Box 5 SF-4051 Jyvaskyla

More information

Department of Mathematics and Statistics Indian Institute of Technology Kanpur MSO202A/MSO202 Assignment 3 Solutions Introduction To Complex Analysis

Department of Mathematics and Statistics Indian Institute of Technology Kanpur MSO202A/MSO202 Assignment 3 Solutions Introduction To Complex Analysis Dpartmt of Mathmatcs ad Statstcs Ida Isttut of Tchology Kapur MSOA/MSO Assgmt 3 Solutos Itroducto To omplx Aalyss Th problms markd (T) d a xplct dscusso th tutoral class. Othr problms ar for hacd practc..

More information

Linear Algebra. Definition The inverse of an n by n matrix A is an n by n matrix B where, Properties of Matrix Inverse. Minors and cofactors

Linear Algebra. Definition The inverse of an n by n matrix A is an n by n matrix B where, Properties of Matrix Inverse. Minors and cofactors Dfnton Th nvr of an n by n atrx A an n by n atrx B whr, Not: nar Algbra Matrx Invron atrc on t hav an nvr. If a atrx ha an nvr, thn t call. Proprt of Matrx Invr. If A an nvrtbl atrx thn t nvr unqu.. (A

More information

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018 Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs

More information

Finding low cost TSP and 2-matching solutions using certain half integer subtour vertices

Finding low cost TSP and 2-matching solutions using certain half integer subtour vertices Finding low cost TSP and 2-matching solutions using crtain half intgr subtour vrtics Sylvia Boyd and Robrt Carr Novmbr 996 Introduction Givn th complt graph K n = (V, E) on n nods with dg costs c R E,

More information

Some Results on E - Cordial Graphs

Some Results on E - Cordial Graphs Intrnational Journal of Mathmatics Trnds and Tchnology Volum 7 Numbr 2 March 24 Som Rsults on E - Cordial Graphs S.Vnkatsh, Jamal Salah 2, G.Sthuraman 3 Corrsponding author, Dpartmnt of Basic Scincs, Collg

More information

Mutually Independent Hamiltonian Cycles of Pancake Networks

Mutually Independent Hamiltonian Cycles of Pancake Networks Mutually Indpndnt Hamiltonian Cycls of Pancak Ntworks Chng-Kuan Lin Dpartmnt of Mathmatics National Cntral Univrsity, Chung-Li, Taiwan 00, R O C discipl@ms0urlcomtw Hua-Min Huang Dpartmnt of Mathmatics

More information

Almost all Cayley Graphs Are Hamiltonian

Almost all Cayley Graphs Are Hamiltonian Acta Mathmatca Sca, Nw Srs 199, Vol1, No, pp 151 155 Almost all Cayly Graphs Ar Hamltoa Mg Jxag & Huag Qogxag Abstract It has b cocturd that thr s a hamltoa cycl vry ft coctd Cayly graph I spt of th dffculty

More information

Outlier-tolerant parameter estimation

Outlier-tolerant parameter estimation Outlr-tolrant paramtr stmaton Baysan thods n physcs statstcs machn larnng and sgnal procssng (SS 003 Frdrch Fraundorfr fraunfr@cg.tu-graz.ac.at Computr Graphcs and Vson Graz Unvrsty of Tchnology Outln

More information

MA 262, Spring 2018, Final exam Version 01 (Green)

MA 262, Spring 2018, Final exam Version 01 (Green) MA 262, Spring 218, Final xam Vrsion 1 (Grn) INSTRUCTIONS 1. Switch off your phon upon ntring th xam room. 2. Do not opn th xam booklt until you ar instructd to do so. 3. Bfor you opn th booklt, fill in

More information

Self-interaction mass formula that relates all leptons and quarks to the electron

Self-interaction mass formula that relates all leptons and quarks to the electron Slf-intraction mass formula that rlats all lptons and quarks to th lctron GERALD ROSEN (a) Dpartmnt of Physics, Drxl Univrsity Philadlphia, PA 19104, USA PACS. 12.15. Ff Quark and lpton modls spcific thoris

More information