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

Size: px
Start display at page:

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

Transcription

1 isid/ms/26/2 Fbruary, 26 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 Indian Statistical Institut, Dlhi Cntr 7, SJSS Marg, Nw Dlhi 6, India

2

3 Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng Collg of Mathmatical and Informational Scincs, Jiangxi Normal Univrsity, Nanchang 3322, China Alok Dy Indian Statistical Institut,Nw Dlhi 6, India Abstract: A rplacmnt procdur to construct orthogonal arrays of strngth thr was proposd by Sun, Das and Dy (2). This mthod was latr xtndd by Sun and Dy (23). In this papr, w furthr xplor th rplacmnt procdur to obtain som nw familis of orthogonal arrays of strngth thr. MSC: 62K5 Kywords: Galois fild; Orthogonal arrays; Rplacmnt mthod; Strngth thr. Introduction and Prliminaris Asymmtric orthogonal arrays introducd by Rao (973) hav rcivd wid attntion in rcnt yars. Such arrays ar usful in xprimntal dsigns as univrsally optimal fractional factorial plans and thir us in industrial xprimnts for quality improvmnt has also bn widsprad. Th construction of asymmtric orthogonal arrays of strngth two hav bn studid xtnsivly, and on may rfr to Hdayat, Sloan and Stufkn (999) for a comprhnsiv account of ths. Mor rcnt work on orthogonal arrays of

4 strngth two includ thos by Sun and Kuhfld (25) and Chn, Ji and Li (24). Mthods of constructing asymmtric orthogonal arrays of strngth gratr than two hav not bn studid as xtnsivly as thos of strngth two. Som of ths mthods can b found.g., in Hdayat t al. (999), Dy and Mukrj (999), Sun, Das and Dy (2), Sun and Dy (23), Jiang and Yin (23) and Zhang, Zong and Dy (26). Sun t al. (2) proposd a rplacmnt procdur for rplacing a column with 2 k -symbols in an orthogonal array of strngth thr by svral 2-symbol columns to obtain nw familis of tight asymmtric orthogonal arrays of strngth thr. Th rplacmnt procdur of Sun t al. (2) was xtndd by Sun and Dy (23). In this papr, w furthr xplor th rplacmnt procdur to obtain svral nw familis of orthogonal arrays of strngth thr. Som of th constructd arrays ar tight. Rcall that an orthogonal array OA(N, n, m m n, g) of strngth g is an N n matrix with lmnts in th ith ( i n) column from a finit st of m i ( 2) distinct lmnts, such that in vry N g subarray, all possibl combinations of lmnts appar qually oftn as rows. Whn m = m 2 = = m n = m, say, w hav a symmtric orthogonal array, dnotd by OA(N, n, m, g); othrwis th array calld asymmtric. It is wll-known that in an OA(N, n, m m n, 3) of strngth thr, } { n N + (m i ) + (m n ) (m i ) (m ), () i= i= m i. Arrays of strngth thr attaining th abov bound whr m = max i n ar calld tight. Throughout, following th trminology in factorial xprimnts, w call th columns of an OA(N, n, m m n, g) factors, and dnot ths factors by L, L 2,, L n. Lt GF (s) dnot a Galois fild of ordr s. W can thn writ th lmnts of GF (s) as {,, w, w 2,, w s 2 }, whr, ar th idntity lmnts of GF (s) with rspct to th oprations of addition and multiplication, rspctivly and w is a primitiv lmnt of GF (s). Throughout, for a matrix A, A T dnots its transpos. W shall nd th following rsult. Lmma. Lt α, β b two lmnts of GF (s) such that α 2 = β 2. Thn (i) α = β, if s is vn, (ii) ithr α = β or α = β, if s is odd. If α, α,, α s ar th lmnts of GF (s), thn th st S = {α 2, α 2,, α 2 s } contains all th lmnts of GF (s), if s is vn. If s is odd, thn 2

5 th lmnts of th st S ar and (s )/2 non-zro lmnts of GF (s), ach non-zro lmnt apparing twic in S. For th factor L i ( i n), dfin u i columns, ach of ordr t ovr GF (s), say d i, d i2,, d iui. Thus, for th n factors, w hav in all n i= u i columns. Also, lt b a s t t matrix whos rows ar all possibl t-tupls ovr GF (s). Sun t al. (2) provd th following rsult. Thorm (Sun t al., 2). Considr a t n i= u i matrix H = A, A 2,, A n, A i = d i, d i2,, d iui, i n, such that for any choic of g matrics A i, A i2,, A ig from A, A 2,, A n, th t g j= u ij matrix A i, A i2,, A ig has full column rank ovr GF (s). Thn an OA(s t, n, (s u ) (s u 2 ) (s un ), g) can b constructd. 2 A Rplacmnt Mthod Lt s = p k, whr p is a prim and k( 2) is an intgr. W start with an asymmtric orthogonal array OA(s m, n, (s r ) s n, 3) (not that whn r =, th starting orthogonal array is a symmtric orthogonal array OA(s m, n, s, 3)). Following a rplacmnt procdur, an asymmtric orthogonal array OA(ps m, t + u +, (ps r ) s t p u, 3) can b constructd, whr t, u ar intgrs. Our mthod of construction involvs th following stps. Stp : Construct an asymmtric orthogonal array OA(s m, n, (s r ) s n, 3). This array can b constructd using Thorm by slcting n matrics ovr GF (s), namly A, A 2,, A n, such that for any choic of 3 distinct matrics A i, A j, A k, i, j, k {, 2,, n}, th matrix A i, A j, A k has full column rank. For xampl, an array OA(s 4, s+2, (s 2 ) s s+, 3) (s = 2 k ) can b constructd T by taking ths matrics as A =, A 2 =,,, T, A 3 =,,, T, A 4+i =, w 2i,, w i T, i s 2, whr w is a primitiv lmnt of GF (2 k ). Stp 2: Not that for obtaining th OA(s m, n, (s r ) s n, 3), w us th lmnts of GF (s), s = p k. Howvr, w find it mor convnint to us lmnts of GF (p) than thos of GF (p k ). In ordr to rplac th lmnts of GF (p k ) by thos of GF (p), w nd a matrix rprsntation of th lmnts of GF (p k ), whr th ntris of ths matrics ar th lmnts of GF (p). Lt th irrducibl polynomial of GF (p k ) b w k + α k w k + + α w + α, whr w is a primitiv lmnt of GF (p k ), α j GF (p), j k. Thn 3

6 th companion matrix of th irrducibl polynomial is α α W = α 2.. α k A typical lmnt w i of GF (p k ) corrsponds to a k k matrix W i with ntris from GF (p), whr is rprsntd by a null matrix of ordr k and is rprsntd by idntity matrix of ordr k. Rplacing th lmnts of GF (p k ) in A, A 2,, A n by thos of GF (p), w gt matrics A, A 2,, A n, whr A is an mk rk matrix with lmnts from GF (p), and A j (2 j n) ar of ordr mk k. Nxt, dfin th following matrics: T T P = A, P i = A, i = 2,, n, (2) i whr is a null vctor. Lt L = P, P 2,, P n and b a p mk+ (mk + ) matrix with rows as all possibl (mk + )-tupls ovr GF (p). Tak th product L and rplac th p rk+ = ps r distinct combinations undr th (rk + ) columns of P by ps r distinct lvls of L as wll as th p k = s distinct combinations undr th k columns of P j by s distinct lvls of th factor L j for ach j, 2 j n. Th array OA(ps m, n, (ps r ) s n, 3) can now b constructd via Thorm. Stp 3: Finally, w giv a mthod to construct an orthogonal array of typ OA(ps m, t + u +, (ps r ) s t p u, 3). To obtain this family of orthogonal arrays, w rplac a p k -lvl column by svral p-lvl columns in th array OA(ps m, n, (ps r ) s n, 3). Th rplacmnt procdur is as follows. Lt 2 b a matrix of ordr k h. Considr th matrics P i (i {2,, n}) dfind abov. Lt M i = P i 2 = T A i 2, 2 i n, (3) thn th lmnts of th first row of M i ar all zros. Substituting th first row of all zros by a row of all ons, th matrics Q i = A (4) i 2 4

7 ar obtaind. This rplacmnt procdur dos not disturb th orthogonality and can b usd for ach factor P i, 2 i n. Thn th array OA(ps m, t + u +, (ps r ) s t p u, 3), t n can b constructd by choosing th matrix H = P, P 2,, P t+, Q t+2,, Q n, whr Q i = q i, q i2,, q i,h and q ij is th column of th factor P t++(i t 2)h+j with p symbols, t + 2 i n, j h. Thus, following th abov stps, an orthogonal array OA(ps m, t + u +, (ps r ) s t p u, 3) can b constructd. Sinc 2 dpnds on whthr s is vn or odd, w dal with ths two cas sparatly. In th nxt sction, w construct svral familis of asymmtric orthogonal arrays of strngth thr. 3 Construction of Orthogonal Arrays Whn s is a powr of two, svral tight orthogonal arrays of strngth thr wr obtaind by Sun t al. (2) by invoking Thorm and also via a rplacmnt procdur. In this sction, w first obtain two nw familis of orthogonal arrays of strngth thr, whn s is a powr or of two. To bgin with, w hav th following rsults. Lmma 2. Lt b a k (2 k ) matrix whos columns ar all possibl k- tupls ovr GF (2), xcluding th null column and G b dfind as G =, whr is a row of all ons of ordr 2 k. Thn any thr columns of G ar linarly indpndnt. Proof. Sinc ach of th matrics of th following thr typs has full column rank, choosing any thr columns g, g 2, g 3 of G, in th matrix g, g 2, g 3 thr xits a 3 3 subarray with on of th abov thr typs. This can b don through lmntary row and column oprations. So any thr columns of G ar linarly indpndnt. Thorm 2. Suppos A, A 2,, A n ar matrics ovr GF (2 k ) with lmnt at th sam position, and any thr of thm ar linarly indpndnt. If th matrix F = P, P 2,, P t, Q t+,, Q n is obtaind by th rplacmnt 5

8 mthod dscribd abov for s vn, thn any thr factors of F ar linarly indpndnt. A proof of this Thorm is givn in Appndix. Using Thorm 2, w hav th following familis of tight arrays. Thorm 3. If s is a powr of two, thn a tight array OA(2s 4, s 2 (s 2)t, (2s 2 ) s t 2 (s+ t)(s ), 3) can b constructd for t s +. Proof. First, w construct an array OA(s 4, s+2, (s 2 ) s s+, 3). According to Sun t al. (2), th matrics corrsponding to th factors ar as follows: A = A 2 = A 3 = A 4+i = w 2i w i i s 2, whr w is a primitiv lmnt of GF (2 k ). Thn th array OA(s 4, s+2, (s 2 ) s s+, 3) can b constructd by Thorm. For k 3, ach matrix A k has lmnt at th sam position, and by Thorm 2, w know that any thr factors of F = P 3, P 4,, P t, Q t+,, Q s+2 ar linarly indpndnt. y th rplacmnt stps, P 2 is obtaind via th rplacmnt of A 2. Nxt, w prov th orthogonality of P 2 and F, for which w nd to considr six cass: P 2, P a, P b, P 2, P a, Q b, P 2, Q a, Q b, Q 2, P a, P b, Q 2, P a, Q b, Q 2, Q a, Q b, a, b 3. To sav spac, w provid a proof of only th cas Q 2, Q a, Q b ; th othr cass can b handld in a similar fashion. Rplacing th s-symbol column in P 2, P a, P b by 2 k columns with 2 symbols ach, w gt Q 2 =, Q a = W 2i W i, Q b = W 2j W j whr is a (2 k ) vctor of all ons, is a null matrix of ordr k (2 k ) and, is a matrix of ordr k (2 k ) whos columns ar all possibl k-tupls ovr GF (2), xcluding th null column. Choosing any thr columns q 2, q a, q b of Q 2, Q a, Q b, th matrix q 2, q a, q b xists a 3 3 subarray. 6

9 with on of th following typs: α whr α is any lmnt of GF (2). Hnc an array OA(2s 4, s 2 (s 2)t, (2s 2 ) s t 2 (s+ t)(s ), 3) can b constructd for t s +. Th tightnss of th array follows from (). Thorm 4. If s is a powr of two, thn a tight array OA(2s 5, s 3 (s 2)t, (2s 2 ) s t 2 (s2 +s+ t)(s ), 3) can b constructd for t s 2 + s +. Proof. First, construct an array OA(s 5, s 2 +s+2, (s 2 ) s s2 +s+, 3). Following Sun t l. (2), dfin th matrics corrsponding to th factors as: A = T, A 2 = T, A 3,, A s+2 ar of th form, α 2,,, α, α GF (s), and A s+3,, A s 2 +s+2 ar of th form β 2, γ 2,, β, γ, β, γ GF (s). Thn th array OA(s 5, s 2 + s + 2, (s 2 ) s s2 +s+, 3) can b constructd via Thorm. For 3 k s + 2, ach matrix A k has lmnt at th sam position, by Thorm 2, any thr factors of F = P 3, P 4,, P t, Q t +,, Q s+2 ar linarly indpndnt. In a similar way, any thr factors of F 2 = P s+3, P s+4,, P t2, Q t2 +,, Q s 2 +s+2 ar linarly indpndnt. y th rplacmnt stps, P 2 is obtaind from A 2. Th orthogonality of P 2, F and F 2 can b handld as in th cas of Thorm 3. Hnc an array OA(2s 5, s 3 (s 2)t, (2s 2 ) s t 2 (s2 +s+ t)(s ), 3) can b constructd for t s 2 + s +. Th tightnss of th array follows from (). W now considr th cas whn s is an odd prim powr. W confin to th cas whn s is a powr of 3 as, arrays for this cas ar not too larg. For othr valus of s bing an odd prim powr, mthods similar to s = 3 k can b mployd, but thn th siz of th arrays will b quit larg. Whn s is a powr of thr, th lmnts of GF (s) can b writtn as { w s 3 2,, w, w,, w, w,, w s 3 2 }. An orthogonal array OA(s m, n, (s r ) s n, 3) (s = 3 k, k ( 2) is an intgr) can b constructd by slcting n matrics ovr GF (3 k ), namly A, A 2,, A n such that ths matrics satisfy th rank condition of Thorm. Hr also, for constructing an OA(s m, n, (s r ) s n, 3), it is 7

10 mor convnint to us lmnts of GF (3) than thos of GF (3 k ). So an array OA(3s m, n, (3s r ) s n, 3) can b constructd by th rplacmnt stps of Sction 2. To obtain an orthogonal array of th typ OA(3s m, t + u +, (3s r ) s t 3 u, 3), w rplac a 3 k -symbol column by svral 3-symbol columns. Similar to th cas whn s is vn, w start by rplacing a column with 3 k symbols by 3 k columns with all possibl k-tupls ovr GF (3), xcluding th null column. W rplac a 3 k -symbol column by 2k columns ach with 3 symbols, without disturbing th orthogonality. Lt 3 = I k, 2I k, I k is idntity T matrix of ordr k. From (2), (3) and (4), w gt M i = P i 3 = T A i 2A, i Q i =, 2 i n, whr, as bfor, is a null vctor and is a A i 2A i row of all ons. It can b sn that th factors L i (2 i n) corrsponding to 3 k symbols can b rplacd by 2k factors with 3 symbols ach, dnotd by th matrix Q i, without disturbing th rank condition. Thn th array OA(3s m, (n t)2k+t+, (3s r ) s t 3 2k(n t), 3) ( t n ) can b constructd by choosing th matrix H = P, P 2,, P t+, Q t+2,, Q n, whr Q i = q i, q i2,, q (i,2k) and q ij is th column of th factor L t++(i t 2)k+j with 3 symbols, t + 2 i n, j 2k. Hr is an xampl to illustrat th abov stps of construction. Exampl. Suppos s = 9 = 3 2 so that k = 2. W start from constructing a symmtric orthogonal array OA(9 3,, 9, 3). Dfin th following matrics corrspond to th factors: A =,, T, A 2 =,, T, A 3 =, w, w 2 T, A 4 =, w 2, w 4 T, A 5 =, w 3, w 6 T, A 6 =, w 4, w T, A 7 =, w 5, w 2 T, A 8 =, w 6, w 4 T, A 9 =, w 7, w 6 T, A =,, T, whr w is a primitiv lmnt of GF (3 2 ). Thorm can now b usd to construct an orthogonal array OA(9 3,, 9, 3). An irrducibl polynomial of GF (3 2 ) is takn as w 2 + w + 2. Thn th companion matrix is W = 2 and th lmnts of GF (3 2 ) can b rprsntd by 2 2 matrics,, w 2,, w , w , 8

11 w 4 2 2, w 5 2 2, w 6 2, w 7 Rplacing th lmnts of GF (3 2 ) in A, A 2,, A by th abov matrics, w gt matrics A i ( i ) with th lmnts from GF (3) as A = T,, A = From th matrics A i ( i ), w gt th matrics P i ( i ), whr T T P = A, P j = A, 2 j. j According to th prvious analysis and using th matrics P i ( i ), th array OA(3 9 3,, , 3) can b constructd. W nxt illustrat th rplacmnt procdur for rplacing a 9-symbol column by 4 columns, ach with 3-symbols. For xampl, th first 9-symbol column dnotd by P 2, can b writtn as 2 2 P 2 = 2 = Q Th othr 9-symbol columns can b handld in a similar way. Hnc th array OA(3 9 3, 37 3t, 27 9 t t, 3) ( t 9) can b constructd by choosing th matrix H = P, P 2,, P t+, Q t+2,, Q, whr th matrix Q i has four columns, ach having 3 symbols. For obtaining mor orthogonal arrays, w nd th following rsults. Lmma 3. Lt = I k, 2I k, whr I k is an idntity matrix of ordr k. Dfin th matrix G as G =, whr is a row of all ons of ordr 2k. Thn any thr columns of G ar linarly indpndnt. Proof. Choos any thr columns g, g 2, g 3 of G. Suppos th thr columns g, g 2, g 3 ar from or, thn clarly, th matrix g I k 2I, g 2, g 3 has k. T. 9

12 full column rank. Suppos th thr columns g, g 2, g 3 ar from and I k, rspctivly. Thn th matrix g 2I, g 2, g 3 xists a 3 3 subarray with k on of th following typs by conducting row and column transformation: Hnc any thr columns of G ar linarly indpndnt. 2 Thorm 5. Suppos A, A 2,, A n ar matrics with lmnt at th sam position ovr GF (3 k ), and any thr of thm ar linarly indpndnt. If th matrix F = P, P 2,, P t, Q t+,, Q n is obtaind by th rplacmnt mthod dscribd arlir, thn any thr factors of F ar linarly indpndnt. A proof of this Thorm is givn in th Appndix. y Thorm 5, w hav th following rsults. Thorm 6. If s is a powr of thr, thn an array OA(3s 4, 2sk (2k )t + 2k +, (3s 2 ) s t 2 2k(s+ t), 3) can b constructd for t s +. Proof. First, construct an array OA(s 4, s + 2, (s 2 ) s s+, 3). Following Sun t al. (2), th matrics corrsponding to th factors ar A = A 2 = A 3 = A 5+2i = w 2i w i A 4+2i =. w 2i w i i s 3 2, whr w is a primitiv lmnt of GF (3k ). Thn th array OA(s 4, s + 2, (s 2 ) s s+, 3) can b constructd by Thorm. For k 3, ach matrix A k has lmnt at th sam position, and by Thorm 5, w know that any thr factors of F = P 3, P 4,, P t, Q t+,, Q s+2 ar linarly indpndnt. y th rplacmnt stps, P 2 is obtaind from A 2. Lt N = {3, 4, 6, 8,, s + }, N 2 = {5, 7, 9,, s + 2}. Nxt, w prov th

13 orthogonality of P 2 and F, which has 8 cass. To sav spac, w prov only th cas Q 2, Q a, Q b, a N, b N 2. Rplacing th s-symbol column in P 2, P a, P b by 2k columns with 3-symbols ach, w gt Q 2 =, Q a = W 2i W i, Q b = W 2j W j whr is a row of ons of ordr 2k, is a null matrix of ordr k 2k and = I k, 2I k. Choosing thr columns q 2, q a, q b of Q 2, Q a, Q b, in th matrix q 2, q a, q b thr xists a 3 3 subarray of on of th following typs: α 2 α 2 α, 2 2 α whr α is any lmnt of GF (3). Othr cass can b handld in a similar fashion. Hnc an array OA(3s 4, 2sk (2k )t + 2k +, (3s 2 ) s t 2 2k(s+ t), 3) can b constructd for s = 3 k, t s +. Thorm 7. If s is a powr of thr, thn an array OA(3s 5, 2(s + )ks (2k )t +, (3s 2 ) s t 3 2k(s2 +s t), 3) can b constructd for t s 2 + s. Proof. First, construct an OA(s 5, s 2 + s +, (s 2 ) s s2 +s, 3). Following Zhang t al. (26), dfin th matrics corrsponding to th factors: T A =, A 2 = 2 T, A 3,, A s+ of th form, α 2,,, α, α GF (s), α, and A s+2,, A s 2 +s+ of th form β 2, γ 2,, β, γ, β, γ GF (s). Thn an array OA(s 5, s 2 + s +, (s 2 ) s s2 +s, 3) can b constructd by Thorm. For 3 k s +, ach matrix A k has lmnt at th sam position, and by Thorm 5, any thr factors of F = P 3, P 4,, P t, Q t +,, Q s+ ar linarly indpndnt. In a similar way, any thr factors of F 2 = P s+2, P s+3,, P t2, Q t2 +,, Q s 2 +s+ ar linarly indpndnt. y th rplacmnt stps, P 2 is obtaind from A 2. Th orthogonality of P 2, F and F 2 can b handld in a similar way as in Thorm 6. Hnc th array OA(3s 5, 2(s + )ks (2k )t +, (3s 2 ) s t 3 2k(s2 +s t), 3) can b constructd for t s 2 + s.

14 Appndix Proof of Thorm 2. Without loss of gnrality, st A i =, i n. y th rplacmnt mthod, w obtain A Ik D i T i = Di, P i = I k Q i = Di Di whr I k is idntity matrix of ordr k, is a null vctor of ordr k, is a row of all ons of ordr 2 k, is a matrix of ordr k (2 k ) whos columns ar all possibl k-tupls ovr GF (2), xcluding th null column. Choosing any thr factors of F hav th following cass: Cas : Lt th thr columns f, f 2, f 3 b from Q i. This cas thn follows from Lmma 2. Cas 2 : Lt th thr columns f, f 2, f 3 b from Q i, Q j, Q k, i, j, k ar all distinct. f is th i -th column of Q i, f 2 is th j -th column of Q j, f 3 is th k -th column of Q k. (a) Suppos i, j, k ar all distinct. This cas follows from Lmma 2. (b) Suppos i = j k, w can choos a row in and D i, rspctivly. Thn in th matrix f, f 2, f 3 thr xists a 3 3 subarray is on of th following typs: α whr α is any lmnt of GF (2). α (c) Suppos i = j = k. W can choos two rows in D i. Thn in th matrix f, f 2, f 3 thr xists 3 3 subarray with th sam typs as in cas (b). Cas 3 : Lt two columns f, f 2 b from Q i, f 3 is from Q j, i j. f, f 2 ar th i -th, j -th columns of Q i, f 3 is th k -th column of Q j. Suppos i j = k. Thn this cas is th sam as Cas (2b). Suppos i j k, thn this cas is sam as Cas (2a). 2

15 Cas 4 : Choosing th matrix P i, two columns f, f 2 ar from Q j. In th matrix P i, f, f 2 thr xists a (k + 2) (k + 2) subarray of on of th following typs: T I k α T I k α whr α is any lmnt of GF (2). Thn this matrix P i, f, f 2 has rank k + 2. Cas 5 : Choosing th matrics P i, P j, and a column f is from Q k. matrix T T P i, P j, f = I k I k b Di Dj Dkb whr b is a column of, and this matrix has rank 2k +. Th Hnc any thr factors of F ar linarly indpndnt. Proof of Thorm 5 Without loss of gnrality, st A i =, i n. y th rplacmnt mthod for s odd, w obtain Q i = I k 2I k, whr is a row D i of all ons with ordr k, I k is idntity matrix of ordr k. Choosing any thr factors of F, w hav th following cass: Cas : Lt thr columns f, f 2, f 3 b from Q i. This cas follows from Lmma 3. Cas 2 : Lt thr columns f, f 2, f 3 b from Q i, Q j, Q k, i, j, k ar all distinct. f is th i -th column of Q i, f 2 is th j -th column of Q j, f 3 is th k -th column of Q k. D i 2D i (a) Suppos i, j, k ar all distinct. This cas follows from Lmma 3. (b) Suppos i = j k. W can choos a row in I k, 2I k and D i, 2D i, rspctivly. A row in I k, 2I k corrsponds to th columns 3

16 of f, f 2, f 3 has two sam lmnts and on diffrnt lmnt, anothr row corrsponds to th columns of f, f 2, f 3 hav two diffrnt lmnts in th corrsponding position of I k, 2I k with two sam lmnts. For xampl, th matrix f, f 2, f 3 xists a 3 3 subarray 2 2 α, whr α is any lmnt of GF (3). (c) Suppos i = j = k. W can choos two rows in D i, 2D i. Thn in th matrix f, f 2, f 3 thr xists 3 3 subarrays with th sam typs as in Cas (b). Cas 3 : Lt two columns f, f 2 b from Q i, f 3 is from Q j, i j. f, f 2 ar th i -th, j -th column of Q i, f 3 is th k -th column of Q j. Thn in th matrix f, f 2, f 3 xists a 3 3 subarrays with th sam typs of cas (b). Cas 4 : Choosing th matrix P i and two columns f, f 2 from Q j, th matrix P i, f, f 2 has a (k + 2) (k + 2) subarray with on of th following typs: T I k α T I k α 2 T I k α 2 whr α is any lmnt of GF (3), is a null vctor with ordr k. This matrix has rank k + 2. Cas 5 : Choosing th matrics P i, P j, a column f from Q k, th matrix T T P i, P j, f = I k I k b Di Dj Dkb whr b is a column of I k, 2I k, has rank 2k +. Hnc any thr factors of F ar linarly indpndnt. Acknowldgmnt Th work of A. Dy was supportd by th National Acadmy of Scincs, India undr th Snior Scintist program of th Acadmy. Th support is gratfully acknowldgd. 4

17 Rfrncs Chn, G.Z., Ji, L.J. and Li, J.G.(24). Th xistnc of mixd orthogonal arrays with four and fiv Factors of strngth two. J. Combin. Dsigns Dy, A. and Mukrj, R. (999). Fractional Factorial Plans. Nw York: Wily. Hdayat, A. S., Sloan, N. J. A. and Stufkn, J. (999). Orthogonal Arrays: Thory and Applications. Nw York: Springr. Jiang, L. and Yin, J. X. (23). An approach of constructing mixd-lvl orthogonal arrays of strngth 3. Sci. China Math Nguyn, M. V. M. (28). Som nw constructions of strngth 3 mixd orthogonal arrays. J. Statist. Plann. Infrnc Rao, C. R. (973). Som combinatorial problms of arrays and applications to dsign of xprimnts. In: A Survy of Combinatorial Thory (J.N.Srivastava, Ed.), Amstrdam: North-Holland, pp Sun, C. Y., Das, A. and Dy, A. (2). On th construction of asymmtric orthogonal arrays. Statist. Sinica Sun, C. Y. and Dy, A. (23). Construction of asymmtric orthogonal arrays through finit gomtris. J. Statist. Plann. Infrnc Sun, C. Y. and Kuhfld, W. F. (25). On th construction of mixd orthogonal arrays of strngth two. J. Statist. Plann. Infrnc Zhang, T. F., Zong, Y. Y. and Dy, A. (26). On th construction of asymmtric orthogonal arrays. J. Statist. Plann. Infrnc

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

(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

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

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

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

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

On the construction of asymmetric orthogonal arrays

On the construction of asymmetric orthogonal arrays isid/ms/2015/03 March 05, 2015 http://wwwisidacin/ statmath/indexphp?module=preprint On the construction of asymmetric orthogonal arrays Tianfang Zhang and Aloke Dey Indian Statistical Institute, Delhi

More information

Addition of angular momentum

Addition of angular momentum Addition of angular momntum April, 0 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat th

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

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

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

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

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

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

Addition of angular momentum

Addition of angular momentum Addition of angular momntum April, 07 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat

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

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

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

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

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

Lie Groups HW7. Wang Shuai. November 2015

Lie Groups HW7. Wang Shuai. November 2015 Li roups HW7 Wang Shuai Novmbr 015 1 Lt (π, V b a complx rprsntation of a compact group, show that V has an invariant non-dgnratd Hrmitian form. For any givn Hrmitian form on V, (for xampl (u, v = i u

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

u 3 = u 3 (x 1, x 2, x 3 )

u 3 = u 3 (x 1, x 2, x 3 ) Lctur 23: Curvilinar Coordinats (RHB 8.0 It is oftn convnint to work with variabls othr than th Cartsian coordinats x i ( = x, y, z. For xampl in Lctur 5 w mt sphrical polar and cylindrical polar coordinats.

More information

SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH.

SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH. SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH. K VASUDEVAN, K. SWATHY AND K. MANIKANDAN 1 Dpartmnt of Mathmatics, Prsidncy Collg, Chnnai-05, India. E-Mail:vasu k dvan@yahoo.com. 2,

More information

2.3 Matrix Formulation

2.3 Matrix Formulation 23 Matrix Formulation 43 A mor complicatd xampl ariss for a nonlinar systm of diffrntial quations Considr th following xampl Exampl 23 x y + x( x 2 y 2 y x + y( x 2 y 2 (233 Transforming to polar coordinats,

More information

That is, we start with a general matrix: And end with a simpler matrix:

That is, we start with a general matrix: And end with a simpler matrix: DIAGON ALIZATION OF THE STR ESS TEN SOR INTRO DUCTIO N By th us of Cauchy s thorm w ar abl to rduc th numbr of strss componnts in th strss tnsor to only nin valus. An additional simplification of th strss

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

CPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming

CPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming CPSC 665 : An Algorithmist s Toolkit Lctur 4 : 21 Jan 2015 Lcturr: Sushant Sachdva Linar Programming Scrib: Rasmus Kyng 1. Introduction An optimization problm rquirs us to find th minimum or maximum) of

More information

PROOF OF FIRST STANDARD FORM OF NONELEMENTARY FUNCTIONS

PROOF OF FIRST STANDARD FORM OF NONELEMENTARY FUNCTIONS Intrnational Journal Of Advanc Rsarch In Scinc And Enginring http://www.ijars.com IJARSE, Vol. No., Issu No., Fbruary, 013 ISSN-319-8354(E) PROOF OF FIRST STANDARD FORM OF NONELEMENTARY FUNCTIONS 1 Dharmndra

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

Homotopy perturbation technique

Homotopy perturbation technique Comput. Mthods Appl. Mch. Engrg. 178 (1999) 257±262 www.lsvir.com/locat/cma Homotopy prturbation tchniqu Ji-Huan H 1 Shanghai Univrsity, Shanghai Institut of Applid Mathmatics and Mchanics, Shanghai 272,

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

Chapter 10. The singular integral Introducing S(n) and J(n)

Chapter 10. The singular integral Introducing S(n) and J(n) Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don

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

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

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

Application of Vague Soft Sets in students evaluation

Application of Vague Soft Sets in students evaluation Availabl onlin at www.plagiarsarchlibrary.com Advancs in Applid Scinc Rsarch, 0, (6):48-43 ISSN: 0976-860 CODEN (USA): AASRFC Application of Vagu Soft Sts in studnts valuation B. Chtia*and P. K. Das Dpartmnt

More information

Higher order derivatives

Higher order derivatives Robrto s Nots on Diffrntial Calculus Chaptr 4: Basic diffrntiation ruls Sction 7 Highr ordr drivativs What you nd to know alrady: Basic diffrntiation ruls. What you can larn hr: How to rpat th procss of

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

ABEL TYPE THEOREMS FOR THE WAVELET TRANSFORM THROUGH THE QUASIASYMPTOTIC BOUNDEDNESS

ABEL TYPE THEOREMS FOR THE WAVELET TRANSFORM THROUGH THE QUASIASYMPTOTIC BOUNDEDNESS Novi Sad J. Math. Vol. 45, No. 1, 2015, 201-206 ABEL TYPE THEOREMS FOR THE WAVELET TRANSFORM THROUGH THE QUASIASYMPTOTIC BOUNDEDNESS Mirjana Vuković 1 and Ivana Zubac 2 Ddicatd to Acadmician Bogoljub Stanković

More information

1 Minimum Cut Problem

1 Minimum Cut Problem CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms

More information

4.2 Design of Sections for Flexure

4.2 Design of Sections for Flexure 4. Dsign of Sctions for Flxur This sction covrs th following topics Prliminary Dsign Final Dsign for Typ 1 Mmbrs Spcial Cas Calculation of Momnt Dmand For simply supportd prstrssd bams, th maximum momnt

More information

Title: Vibrational structure of electronic transition

Title: Vibrational structure of electronic transition Titl: Vibrational structur of lctronic transition Pag- Th band spctrum sn in th Ultra-Violt (UV) and visibl (VIS) rgions of th lctromagntic spctrum can not intrprtd as vibrational and rotational spctrum

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

10. Limits involving infinity

10. Limits involving infinity . Limits involving infinity It is known from th it ruls for fundamntal arithmtic oprations (+,-,, ) that if two functions hav finit its at a (finit or infinit) point, that is, thy ar convrgnt, th it of

More information

Week 3: Connected Subgraphs

Week 3: Connected Subgraphs Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y

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

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

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

ON THE DISTRIBUTION OF THE ELLIPTIC SUBSET SUM GENERATOR OF PSEUDORANDOM NUMBERS

ON THE DISTRIBUTION OF THE ELLIPTIC SUBSET SUM GENERATOR OF PSEUDORANDOM NUMBERS INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 2008, #A3 ON THE DISTRIBUTION OF THE ELLIPTIC SUBSET SUM GENERATOR OF PSEUDORANDOM NUMBERS Edwin D. El-Mahassni Dpartmnt of Computing, Macquari

More information

Hydrogen Atom and One Electron Ions

Hydrogen Atom and One Electron Ions Hydrogn Atom and On Elctron Ions Th Schrödingr quation for this two-body problm starts out th sam as th gnral two-body Schrödingr quation. First w sparat out th motion of th cntr of mass. Th intrnal potntial

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

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

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

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula 7. Intgration by Parts Each drivativ formula givs ris to a corrsponding intgral formula, as w v sn many tims. Th drivativ product rul yilds a vry usful intgration tchniqu calld intgration by parts. Starting

More information

LINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM

LINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM Elctronic Journal of Diffrntial Equations, Vol. 2003(2003), No. 92, pp. 1 6. ISSN: 1072-6691. URL: http://jd.math.swt.du or http://jd.math.unt.du ftp jd.math.swt.du (login: ftp) LINEAR DELAY DIFFERENTIAL

More information

Square of Hamilton cycle in a random graph

Square of Hamilton cycle in a random graph Squar of Hamilton cycl in a random graph Andrzj Dudk Alan Friz Jun 28, 2016 Abstract W show that p = n is a sharp thrshold for th random graph G n,p to contain th squar of a Hamilton cycl. This improvs

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

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero. SETION 6. 57 6. Evaluation of Dfinit Intgrals Exampl 6.6 W hav usd dfinit intgrals to valuat contour intgrals. It may com as a surpris to larn that contour intgrals and rsidus can b usd to valuat crtain

More information

Construction of some new families of nested orthogonal arrays

Construction of some new families of nested orthogonal arrays isid/ms/2017/01 April 7, 2017 http://www.isid.ac.in/ statmath/index.php?module=preprint Construction of some new families of nested orthogonal arrays Tian-fang Zhang, Guobin Wu and Aloke Dey Indian Statistical

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

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

Observer Bias and Reliability By Xunchi Pu

Observer Bias and Reliability By Xunchi Pu Obsrvr Bias and Rliability By Xunchi Pu Introduction Clarly all masurmnts or obsrvations nd to b mad as accuratly as possibl and invstigators nd to pay carful attntion to chcking th rliability of thir

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

COMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH.

COMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, April 04, 2005, 8:35 AM) PART I: CHAPTER TWO COMB MATH. C:\Dallas\0_Courss\03A_OpSci_67\0 Cgh_Book\0_athmaticalPrliminaris\0_0 Combath.doc of 8 COPUTER GENERATED HOLOGRAS Optical Scincs 67 W.J. Dallas (onday, April 04, 005, 8:35 A) PART I: CHAPTER TWO COB ATH

More information

INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS. xy 1 (mod p), (x, y) I (j)

INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS. xy 1 (mod p), (x, y) I (j) INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS T D BROWNING AND A HAYNES Abstract W invstigat th solubility of th congrunc xy (mod ), whr is a rim and x, y ar rstrictd to li

More information

Another view for a posteriori error estimates for variational inequalities of the second kind

Another view for a posteriori error estimates for variational inequalities of the second kind Accptd by Applid Numrical Mathmatics in July 2013 Anothr viw for a postriori rror stimats for variational inqualitis of th scond kind Fi Wang 1 and Wimin Han 2 Abstract. In this papr, w giv anothr viw

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 graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the

The graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the Copyright itutcom 005 Fr download & print from wwwitutcom Do not rproduc by othr mans Functions and graphs Powr functions Th graph of n y, for n Q (st of rational numbrs) y is a straight lin through th

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

International Journal of Scientific & Engineering Research, Volume 6, Issue 7, July ISSN

International Journal of Scientific & Engineering Research, Volume 6, Issue 7, July ISSN Intrnational Journal of Scintific & Enginring Rsarch, Volum 6, Issu 7, July-25 64 ISSN 2229-558 HARATERISTIS OF EDGE UTSET MATRIX OF PETERSON GRAPH WITH ALGEBRAI GRAPH THEORY Dr. G. Nirmala M. Murugan

More information

ME 321 Kinematics and Dynamics of Machines S. Lambert Winter 2002

ME 321 Kinematics and Dynamics of Machines S. Lambert Winter 2002 3.4 Forc Analysis of Linkas An undrstandin of forc analysis of linkas is rquird to: Dtrmin th raction forcs on pins, tc. as a consqunc of a spcifid motion (don t undrstimat th sinificanc of dynamic or

More information

Fourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation.

Fourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation. Lur 7 Fourir Transforms and th Wav Euation Ovrviw and Motivation: W first discuss a fw faturs of th Fourir transform (FT), and thn w solv th initial-valu problm for th wav uation using th Fourir transform

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

INTEGRATION BY PARTS

INTEGRATION BY PARTS Mathmatics Rvision Guids Intgration by Parts Pag of 7 MK HOME TUITION Mathmatics Rvision Guids Lvl: AS / A Lvl AQA : C Edcl: C OCR: C OCR MEI: C INTEGRATION BY PARTS Vrsion : Dat: --5 Eampls - 6 ar copyrightd

More information

Supplementary Materials

Supplementary Materials 6 Supplmntary Matrials APPENDIX A PHYSICAL INTERPRETATION OF FUEL-RATE-SPEED FUNCTION A truck running on a road with grad/slop θ positiv if moving up and ngativ if moving down facs thr rsistancs: arodynamic

More information

The second condition says that a node α of the tree has exactly n children if the arity of its label is n.

The second condition says that a node α of the tree has exactly n children if the arity of its label is n. CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is

More information

Linear-Phase FIR Transfer Functions. Functions. Functions. Functions. Functions. Functions. Let

Linear-Phase FIR Transfer Functions. Functions. Functions. Functions. Functions. Functions. Let It is impossibl to dsign an IIR transfr function with an xact linar-phas It is always possibl to dsign an FIR transfr function with an xact linar-phas rspons W now dvlop th forms of th linarphas FIR transfr

More information

Symmetric centrosymmetric matrix vector multiplication

Symmetric centrosymmetric matrix vector multiplication Linar Algbra and its Applications 320 (2000) 193 198 www.lsvir.com/locat/laa Symmtric cntrosymmtric matrix vctor multiplication A. Mlman 1 Dpartmnt of Mathmatics, Univrsity of San Francisco, San Francisco,

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

CLASSIFYING EXTENSIONS OF THE FIELD OF FORMAL LAURENT SERIES OVER F p

CLASSIFYING EXTENSIONS OF THE FIELD OF FORMAL LAURENT SERIES OVER F p CLASSIFYING EXTENSIONS OF THE FIELD OF FORMAL LAURENT SERIES OVER F p JIM BROWN, ALFEEN HASMANI, LINDSEY HILTNER, ANGELA RAFT, DANIEL SCOFIELD, AND IRSTI WASH Abstract. In prvious works, Jons-Robrts and

More information

Brief Introduction to Statistical Mechanics

Brief Introduction to Statistical Mechanics Brif Introduction to Statistical Mchanics. Purpos: Ths nots ar intndd to provid a vry quick introduction to Statistical Mchanics. Th fild is of cours far mor vast than could b containd in ths fw pags.

More information

Lecture 6.4: Galois groups

Lecture 6.4: Galois groups Lctur 6.4: Galois groups Matthw Macauly Dpartmnt of Mathmatical Scincs Clmson Univrsity http://www.math.clmson.du/~macaul/ Math 4120, Modrn Algbra M. Macauly (Clmson) Lctur 6.4: Galois groups Math 4120,

More information

10. The Discrete-Time Fourier Transform (DTFT)

10. The Discrete-Time Fourier Transform (DTFT) Th Discrt-Tim Fourir Transform (DTFT Dfinition of th discrt-tim Fourir transform Th Fourir rprsntation of signals plays an important rol in both continuous and discrt signal procssing In this sction w

More information

5.80 Small-Molecule Spectroscopy and Dynamics

5.80 Small-Molecule Spectroscopy and Dynamics MIT OpnCoursWar http://ocw.mit.du 5.80 Small-Molcul Spctroscopy and Dynamics Fall 008 For information about citing ths matrials or our Trms of Us, visit: http://ocw.mit.du/trms. Lctur # 3 Supplmnt Contnts

More information

A Simple Formula for the Hilbert Metric with Respect to a Sub-Gaussian Cone

A Simple Formula for the Hilbert Metric with Respect to a Sub-Gaussian Cone mathmatics Articl A Simpl Formula for th Hilbrt Mtric with Rspct to a Sub-Gaussian Con Stéphan Chrétin 1, * and Juan-Pablo Ortga 2 1 National Physical Laboratory, Hampton Road, Tddinton TW11 0LW, UK 2

More information

On the number of pairs of positive integers x,y H such that x 2 +y 2 +1, x 2 +y 2 +2 are square-free

On the number of pairs of positive integers x,y H such that x 2 +y 2 +1, x 2 +y 2 +2 are square-free arxiv:90.04838v [math.nt] 5 Jan 09 On th numbr of pairs of positiv intgrs x,y H such that x +y +, x +y + ar squar-fr S. I. Dimitrov Abstract In th prsnt papr w show that thr xist infinitly many conscutiv

More information

Coupled Pendulums. Two normal modes.

Coupled Pendulums. Two normal modes. Tim Dpndnt Two Stat Problm Coupld Pndulums Wak spring Two normal mods. No friction. No air rsistanc. Prfct Spring Start Swinging Som tim latr - swings with full amplitud. stationary M +n L M +m Elctron

More information

1 Input-Output Stability

1 Input-Output Stability Inut-Outut Stability Inut-outut stability analysis allows us to analyz th stability of a givn syst without knowing th intrnal stat x of th syst. Bfor going forward, w hav to introduc so inut-outut athatical

More information

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 401 Digital Signal Processing Prof. Mark Fowler EEO 401 Digital Signal Procssing Prof. Mark Fowlr Dtails of th ot St #19 Rading Assignmnt: Sct. 7.1.2, 7.1.3, & 7.2 of Proakis & Manolakis Dfinition of th So Givn signal data points x[n] for n = 0,, -1

More information

ON A SECOND ORDER RATIONAL DIFFERENCE EQUATION

ON A SECOND ORDER RATIONAL DIFFERENCE EQUATION Hacttp Journal of Mathmatics and Statistics Volum 41(6) (2012), 867 874 ON A SECOND ORDER RATIONAL DIFFERENCE EQUATION Nourssadat Touafk Rcivd 06:07:2011 : Accptd 26:12:2011 Abstract In this papr, w invstigat

More information

SCALING OF SYNCHROTRON RADIATION WITH MULTIPOLE ORDER. J. C. Sprott

SCALING OF SYNCHROTRON RADIATION WITH MULTIPOLE ORDER. J. C. Sprott SCALING OF SYNCHROTRON RADIATION WITH MULTIPOLE ORDER J. C. Sprott PLP 821 Novmbr 1979 Plasma Studis Univrsity of Wisconsin Ths PLP Rports ar informal and prliminary and as such may contain rrors not yt

More information

Mapping properties of the elliptic maximal function

Mapping properties of the elliptic maximal function Rv. Mat. Ibroamricana 19 (2003), 221 234 Mapping proprtis of th lliptic maximal function M. Burak Erdoğan Abstract W prov that th lliptic maximal function maps th Sobolv spac W 4,η (R 2 )intol 4 (R 2 )

More information

Inference Methods for Stochastic Volatility Models

Inference Methods for Stochastic Volatility Models Intrnational Mathmatical Forum, Vol 8, 03, no 8, 369-375 Infrnc Mthods for Stochastic Volatility Modls Maddalna Cavicchioli Cá Foscari Univrsity of Vnic Advancd School of Economics Cannargio 3, Vnic, Italy

More information

Slide 1. Slide 2. Slide 3 DIGITAL SIGNAL PROCESSING CLASSIFICATION OF SIGNALS

Slide 1. Slide 2. Slide 3 DIGITAL SIGNAL PROCESSING CLASSIFICATION OF SIGNALS Slid DIGITAL SIGAL PROCESSIG UIT I DISCRETE TIME SIGALS AD SYSTEM Slid Rviw of discrt-tim signals & systms Signal:- A signal is dfind as any physical quantity that varis with tim, spac or any othr indpndnt

More information

Engineering 323 Beautiful HW #13 Page 1 of 6 Brown Problem 5-12

Engineering 323 Beautiful HW #13 Page 1 of 6 Brown Problem 5-12 Enginring Bautiful HW #1 Pag 1 of 6 5.1 Two componnts of a minicomputr hav th following joint pdf for thir usful liftims X and Y: = x(1+ x and y othrwis a. What is th probability that th liftim X of th

More information

APPROXIMATION THEORY, II ACADEMIC PRfSS. INC. New York San Francioco London. J. T. aden

APPROXIMATION THEORY, II ACADEMIC PRfSS. INC. New York San Francioco London. J. T. aden Rprintd trom; APPROXIMATION THORY, II 1976 ACADMIC PRfSS. INC. Nw York San Francioco London \st. I IITBRID FINIT L}ffiNT }ffithods J. T. adn Som nw tchniqus for dtrmining rror stimats for so-calld hybrid

More information

Platonic Orthonormal Wavelets 1

Platonic Orthonormal Wavelets 1 APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS 4, 351 35 (1997) ARTICLE NO. HA9701 Platonic Orthonormal Wavlts 1 Murad Özaydin and Tomasz Przbinda Dpartmnt of Mathmatics, Univrsity of Oklahoma, Norman, Oklahoma

More information

ELECTRON-MUON SCATTERING

ELECTRON-MUON SCATTERING ELECTRON-MUON SCATTERING ABSTRACT Th lctron charg is considrd to b distributd or xtndd in spac. Th diffrntial of th lctron charg is st qual to a function of lctron charg coordinats multiplid by a four-dimnsional

More information

Homogeneous Constant Matrix Systems, Part I

Homogeneous Constant Matrix Systems, Part I 39 Homognous Constant Matrix Systms, Part I Finally, w can start discussing mthods for solving a vry important class of diffrntial quation systms of diffrntial quations: homognous constant matrix systms

More information