Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )
|
|
- Lynne Phelps
- 5 years ago
- Views:
Transcription
1 Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us to onstrut new sets of sequenes with entries from the ommuting vriles 0 with zero utoorreltion funtion. We show tht for twelve ses if the esigns exist they nnot e onstrte using four irulnt mtries in the Goethls-Seiel rry. Further we show tht the neessry onitions for the existene of n OD(44 s 1 s 2 ) re suient exept possily for the following 7 ses: (7 32) (8 31) (9 30) (9 33) (11 30) (13 29) (15 26) whih oul not e foun euse of the lrge size of the serh spe for omplete serh. These ses remin open. In ll we n 398 ses, show 67 o not exist n estlish 12 ses nnot e onstrute using four irulnt mtries. We give new onstrution for OD(2n) nod(n + 1) from OD(n). The full OD(44 s 1 s 2 s 3 44 ; s 1 ; s 2 ; s 3 )given in this pper yiel t lest 68 equivlene lsses of Hmr mtries. Key wors n phrses: Autoorreltion, onstrution, sequene, orthogonl esign. AMS Sujet Clssition: Primry 05B15, 05B20, Seonry 62K05. 1 Introution Throughout this pper we will use the enition n nottion of Koukouvinos, Mitrouli, Seerry n Krels [2]. We note from [3] tht we hve totest 1 4 n2 = 484 ses. We n 398 ses, show 67o not exist n estlish 12 ses nnot e onstrute using four irulnt mtries. There re 7 open ses whih oul not e foun euse of the lrge size of the serh spe for omplete serh. 2 New orthogonl esigns Theorem 1 An OD(44 s 1 s 2 ) nnot exist for the following 2;tuples (s 1 s 2 ): Deprtment of Mthemtis, Ntionl Tehnil University ofathens, Zogrfou 15773, Athens, Greee. y Deprtment of Mthemtis, University ofathens, Pnepistemiopolis 15784, Athens, Greee. z Shool of IT n Computer Siene, University ofwollongong, Wollongong, NSW, 2522, Austrli. 1
2 (1 7) (1 15) (1 23) (1 28) (1 31) (1 39) (1 42) (2 14) (2 30) (3 5) (3 13) (3 20) (3 21) (3 29) (3 37) (3 40) (4 7) (4 15) (4 23) (4 28) (4 31) (4 39) (5 11) (5 12) (5 19) (5 27) (5 35) (6 10) (6 26) (7 9) (7 16) (7 17) (7 25) (7 28) (7 33) (7 36) (8 14) (8 30) (9 15) (9 23) (9 28) (9 31) (10 17) (10 22) (10 24) (11 13) (11 16) (11 20) (11 21) (11 29) (12 13) (12 15) (12 20) (12 21) (12 29) (13 19) (13 27) (14 18) (15 16) (15 17) (15 20) (15 25) (16 19) (16 23) (16 28) (17 23) (19 20) (19 21) Proof. These ses re eliminte y the numer theoreti neessry onitions given in [1] or[2, Lemm 3]. Exmple. To illustrte how we use the numer theoreti onitions to estlish the nonexistene of n OD(4n 11 20) we onsier the prout = now thisis numer of the form 4 (8 + 7) whih nnot e written s the sum of three squres n hene n OD(4n 11 20) nnot exist. Remrk. A omputer serh, whih we elieve ws exhustive, ws rrie out whih les us to elieve tht 1. there re no 4-NPAF(7 19) sequenes of length there re no 4-NPAF(3 31), 4-NPAF(5 30), 4-NPAF(6 29) n 4-NPAF(8 27) sequenes of length 9. This mens tht there re lso no 4-NPAF(1 5 30), 4- NPAF(1 6 29) n 4-NPAF(1 8 27) of length there re no 4-NPAF(2 41) sequenes of length 11. This mens tht there re lso no 4-NPAF(1 2 41) sequenes of length there re no 4-NPAF(6 37) sequenes of length 11. Lemm 1 OD( ) n n OD( ) o not exist (this is prove theoretilly). The Germit-Verner Theorem sys tht if n OD( ) exists then n OD( ) will exist, n if n OD( ) exists then n OD( ) will exist. Hene the OD( ) n OD( ) o not exist. Lemm 2 The following OD( ; ) n OD(44 43 ; ) nnot e onstrute using four irulnt mtries in the Goethls-Seiel rry: (6 37) (1 6 37) (10 33) ( ) (12 31) ( ) (13 30) ( ) (14 29) ( ) (16 27) ( ) (19 24) ( ) (20 23) ( ) Proof. By the Germit-Verner theorem if n orthogonl esign OD(n x 1 x 2 x u;1 x u ) with u i=1 x i = n ; 1 exists, n 0(mo 4), then n OD(n 1 x 1 x 2 x u;1 x u ) exists. Now for eh of the ses in this lemm we hve nod(44 43 ; ) n tht is y the Germit-Verner theorem n OD( ; ). Using the sum-ll mtrix metho we write 1 = , = n 43; = We require the sum-ll mtrix to e 34 orthogonl mtrix with the rst row ontining n 0 the seon row ontining n 4 in some orer n the thir row ontining n 4 in some orer. 2
3 However, s we illustrte for OD( ), this is not possile for the ses mentione in the enunition. Using the sum-ll mtrix metho for OD( ), 1 = , 20 = n 23 = (;1) There is no wy to form n orthogonl mtrix unless oth 20 n 23 n e written s the sum of 3 squres. 2 Theorem 2 Therere OD(44 s 1 s 2 s 3 44;s 1 ;s 2 ;s 3 ) onstrute using four sequenes to otin four irulnt mtries for use in the Goethls-Seiel rry for the following 2;tuples: Corollry 1 By suitly hoosing the vriles of the known OD(44 s 1 s 2 s 3 44 ; s 1 ; s 2 ; s 3 ) to e reple y1 these le to t lest 36 lgerilly inequivlent Hmr mtries of orer 44. Bysuitlyhoosing the vriles of the known OD(44 s 1 44 ; s 1 ) to e reple y 1 these le to t lest 12 more lgerilly inequivlent Hmr mtries of orer 44. Corollry 2 By suitly hoosing the vriles of the known OD(44 1 s 1 35 ; s 1 ) to e reple y 1 we otin t lest 20 lgerilly inequivlent skew-hmr mtries of orer 44. The numer epens on whether eh skew-hmr mtrix is equivlent to its trnspose or not. 3 New Algorithm The lgorithm previously use to n OD vi four sequenes of length t 10 ws prohiitively slow for length 11. Hene we trie new lgorithm, whih epene on the previous lgorithm, to n rst W (4t k) me with four sequenes of length t with PAF =0orNPAF = 0. In the new lgorithm MAT LAB ws use to set up series of equtions to e solve for eh iniviul k n then ll solutions to these equtions were foun. Exmple. We illustrte the lgorithm y trying to onstrut the OD( ). We rst notie tht 11 hs unique eomposition into squres 11 = , while 27 hs three eompositions into four squres. All three n e use in this onstrution s they must e le to e use in n integer mtrix (the sum-ll mtrix) whih is orthogonl. Hene we use27= = = Sowehve the mtries " ;1 5 # " ;1 4 ;1 3 # or " ;3 3 We now ll eh of the positions whih re represente y 0y one of 17 vriles x 1 x 2 x 17. Wenow use MATLAB to expn the rst rows to mke four irulnt mtries with row inner prout zero: this orrespons to forming four sequenes with PAF = 0. The equtions will e those tht involve somex j,1j 17 with, n those whih hve no terms in. This gives t most 6 inepenent equtions. A serh isnow me through the 17 vriles, llowing them to ssume the vlues 0 1, where six of them must lwys e zero, n using the extr onstrints tht 3 #
4 3X i=1 x i = ;1 5X i=4 x i = ;1 X11 i=6 x i =3 X17 i=12 x i =0: We strt with the following four sequenes of length 11 n PAF = We reple the 1 yvrile suh s n we reple the 17 zeros y the vriles. Thus we hve the sequenes ; ; x 1 x 2 x 3 ; ; ; ; ; x 4 x 5 x 6 x 7 x 8 x 9 ; ; x 10 x 11 ; x 12 x 13 x 14 x 15 x 16 x 17 We then use MATLAB to set up series of equtions, tht when solve, yiel, mong others, the following solution: x 1 x 2 x 3 x 4 x 5 x 6 x 7 x 8 x 9 x 10 x 11 x 12 x 13 x 14 x 15 x 16 x 17 0 ; 0 0 ; ; 0 ; ; 0 0 We now reple the vriles in the originl four sequenes y these solutions to otin the OD( ). 2 Remrk. Using this lgorithm we teste ll unknown two vrile ses n foun 7 ses whih we were unle to resolve ue to the extremely lrge serh spe. We estimte tht omplete serh for the OD( ) using this lgorithm requires 2 37 opertions. 2 4 New Results Theorem 3 Write X( ) = fe 1 x 1 e 2 x 2 e n;1 x n;1 e n x n g, Y ( ) = ff 1 y 1 f 2 y 2 f n;1 y n;1 f n y n g for the sequenes of length n, NPAF=0,where e i n f i re hosen from where, re ommuting vriles n x i, y i hve elements 0 1 n the sequenes X(1 1) n Y (1 1) hve NPAF = 0. Suppose ours totl of s 1 times n totl of s 2 times then we sy the two sequenes we hve re 2-NPAF(n s 1 s 2 ). Write i = if e i = n i = if e i = for i = 1,...,n, n similrly, i = if f i = n i = if f i = for i = 1,...,n. Then (i) X( ) Y ( ) n Y ( ) X (; ;) where Z enotes the reverse of the sequene Z or n fe 1 x 1 e 2 x 2 e n;1 x n;1 e n x n n y n n;1 y n;1 2 y 2 1 y 1 g ff 1 y 1 f 2 y 2 f n;1 y n;1 f n y n ; n x n ; n;1 x n;1 ; 2 x 2 ; 1 x 1 g re two sequenes with elements f0 g with NPAF = 0. These sequenes re 2-NPAF(2n 2s 1 2s 2 ). 4
5 n (ii) If x n;1 n y n;1 re oth zero then the sequenes fe 1 x 1 e 2 x 2 n y n e n x n n;2 y n;2 2 y 2 1 y 1 g ff 1 y 1 f 2 y 2 ; n x n f n y n ; n;2 x n;2 ; 2 x 2 ; 1 x 1 g re two sequenes with elements f0 g with NPAF = 0. These sequenes re 2-NPAF(2n ; 2 2s 1 2s 2 ). (iii) Similrly with 4-NPAF(n s 1 s 2 ), X( ), Y ( ), Z( ) n W ( ) we hve X( ) Y ( ) Y ( ) X (; ;) Z( ) W ( ) n W ( ) Z (; ;) where Z enotes the reverse of the sequene Z re 4-NPAF(2n 2s 1 2s 2 ). (iv) Similrly with 4-NPAF(n s 1 s 2 ),iftheseon lst element of eh of the four sequenes is zero thenproeeing s in (ii) we otin 4-NPAF(2n ; 2 2s 1 2s 2 ). (v) Similrly if there re 4-NPAF(n s 1 s 2 ),ntheseon lst element of two of the sequenes is zero n the lst element of two of the sequenes is zero then omining the methos of (ii) n (iii) we n get 4-NPAF(2n ; 2 2s 1 2s 2 ). Proof. The proof follows y writing out the sequenes n heking the NPAF. Exmple. We use to men ; n to men ;. To illustrte prt (v) of the theorem we note tht n re 4-NPAF(7 2 16) n 4-NPAF(7 4 16), respetively. In ft we note n re 4-NPAF( ) n 4-NPAF( ), respetively. We lso note tht n re 4-NPAF( ) n 4-NPAF( ), respetively n 5
6 re 4-NPAF( ) n 4-NPAF( ), respetively. Lemm 3 If there exist 2-NPAF(n s 1 s 2 ) then there exist 4-NPAF(n s 1 2s 2 ). Corollry 3 Sine there exist2-npaf(n s 1 s 2 ) for the vlues liste in the tle we get the orresponing lrger 4-NPAF(n s 1 2s 2 ). 2-NPAF(n s 1 s 2 ) ) 4-NPAF(n s 1 2s 2 ) (9 13) (10 2,2,26) (11 13) (12 2,2,26) (14 17) (15 2,2,34) (18 25) (19 2,2,50) (4 4,4) (5 2,2,8,8) (6 2,8) (7 2,2,4,16) (6 5,5) (7 2,2,10,10) (8 8,8) (9 2,2,16,16) (10 10,10) (11 2,2,20,20) (14 13,13) (15 2,2,26,26) Corollry 4 Using the previous theorem we see tht 4-NPAF(n s 1 s 2 ) ) 4-NPAF(2n 2s 1 2s 2 ) NPAF(5 1,18) NPAF(5 1,19) NPAF(5 2,17) NPAF(5 2,18) NPAF(5 3,17) NPAF(7 3,18) NPAF(5 4,16) NPAF(7 4,17) NPAF(7 4,18) NPAF(5 5,14) NPAF(5 5,15) NPAF(7 5,16) NPAF(7 5,17) NPAF(7 5,18) NPAF(5 6,14) NPAF(7 6,16) NPAF(7 7,14) NPAF(7 7,15) NPAF(5 8,11) NPAF(5 8,12) NPAF(5 9,10) NPAF(5 9,11) NPAF(7 9,12) NPAF(10 2,36) NPAF(10 2,38) NPAF(10 4,34) NPAF(10 4,36) NPAF(10 6,34) NPAF(14 6,36) NPAF(10 8,32) NPAF(14 8,34) NPAF(14 8,36) NPAF(10 10,28) NPAF(10 10,30) NPAF(14 10,32) NPAF(14 10,34) NPAF(14 10,36) NPAF(10 12,28) NPAF(14 12,32) NPAF(14 14,28) NPAF(14 14,30) NPAF(10 16,22) NPAF(10 16,24) NPAF(10 18,20) NPAF(10 18,22) NPAF(14 18,24) Theorem 4 The sequenes given in the Appenies n e use to onstrut the pproprite esigns to estlish tht the neessry onitions for the existene ofnod(44 s 1 s 2 ) re suient, exept possily for the following 12 ses whih nnot e onstrute from four irulnt mtries: 6
7 (5 38) (6 37) (8 35) (10 33) (12 31) (13 30) (14 29) (15 28) (16 27) (19 24) (20 23) (21 22): n the following 7 ses whih re uneie: (7 32) (8 31) (9 30) (9 33) (11 30) (13 29) (15 26) Remrk. There re 484 possile 2;tuples. Tle 1 lists the 398 whih orrespon to esigns whih exist in orer 44: 67 2-tuples orrespon to esigns eliminte y numer theory (NE). For 12 ses, if the esigns exist, they nnot e onstrute using irulnt mtries (Y). 7 ses remin uneie. P inites tht 4-PAF sequenes with length 11 exist n inites 4-NPAF sequenes with length n exist. 7
8 NE NE NE NE NE NE NE NE NE P NE NE NE 3 21 NE NE NE NE NE NE NE NE NE P NE NE 5 12 NE NE NE P 5 35 NE P 5 38 Y NE NE P P P Y NE NE 7 17 NE NE NE P NE 7 34 P 7 35 P 7 36 NE NE P P 8 30 NE P Y NE NE Tle 1: The existene of OD(44 s 1 s 2). 8
9 NE 9 29 P NE 9 32 P P 9 35 P NE P NE NE P P P Y NE NE NE NE P P P NE P P P NE NE NE NE NE P P NE P Y NE P P P P NE P Y P P P NE P P P P P Y P NE NE NE P P P NE P Y P NE NE P Y NE P P NE P P P P P P P P P P NE NE P P Y P P Y Y P Tle 1(Cont): The existene of OD(44 s 1 s 2). Referenes [1] A.V.Germit, n J.Seerry, Orthogonl esigns: Qurti forms n Hmr mtries, Mrel Dekker, New York-Bsel, [2] C.Koukouvinos, M.Mitrouli, J.Seerry, n P.Krels, On suient onitions for some orthogonl esigns n sequenes with zero utoorreltion funtion, Austrls. J. Comin., 13, (1996), [3] C.Koukouvinos n Jennifer Seerry, New orthogonl esigns n sequenes with two n three vriles in orer 28, Ars Comintori, (to pper). 9
10 A1 A2 A3 A4 Appenix A: Orer 40 (Sequenes with zero non-perioi utoorreltion funtion) Design ) (1 (1 4 32) ( ) (2 2 34) (2 4 32) ( ) ( ) ( ) (2 35) (3 31) (3 34) notinyet ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; 0 ; ; ; ; ; ; ; ; ; ; 0 ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; 0 ; 0 ; ; ; ; ; ; ; ; ; 0 ; ; 0 ; ; ; ; 0 ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; 0 ; ; ; ; ; 0 ; 0 ; ; ; ; 0 ; 0 ; ; ; ; ; ; ; ; ; 0 ; 0 ; 0 10
11 A1 A2 A3 A4 Appenix A(ont): Orer 40 (Sequenes with zero non-perioi utoorreltion funtion) Design ) (4 ( ) ( ) ( ) ( ) (5 30) (5 33) (6 31) (7 31) ( ) ( ) notinyet ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; 0 ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; 0 ; 0 0 ; ; ; ; ; ; ; 0 ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; 0 ; 0 ; ; ; 0 ; ; ; ; ; ; ; ; 0 ; ; ; ; 0 ; ; 0 ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; 0 ; ; ; ; ; ; ; ; 0 ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; 11
12 A1 A2 A3 A4 Appenix B: Orer 44 (Sequenes with zero non-perioi utoorreltion funtion) Design ) (1 (1 30) (1 34) (1 35) (1 37) (1 38) (1 40) (1 41) ( ) ( ) ( ) ( ) 0 ; ; 0 ; ; 0 ; 0 ; ; ; ; ; ; ; ; ; 0 0 ; ; ; ; ; ; ; ; ; ; 0 ; 0 0 ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 0 ; ; ; 0 0 ; ; ; ; ; 0 ; ; ; 0 ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; 0 ; 0 ; ; ; ; ; ; ; 0 ; ; ; ; 0 ; 0 ; ; ; ; ; 0 ; ; ; 0 ; ; ; ; ; ; ; 0 ; ; ; ; ; 0 ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; 0 ; ; 0 ; 0 ; ; ; ; ; 12
13 A1 A2 A3 A4 Appenix B(ont): Orer 44 (Sequenes with zero non-perioi utoorreltion funtion) Design ) (2 (2 37) (2 39) (3 35) (3 36) (3 38) (3 39) (3 41) (4 35) (5 36) (5 39) (7 37) ; ; ; 0 ; ; ; ; 0 ; 0 0 ; ; ; ; ; ; ; ; ; ; 0 ; ; ; 0 ; ; ; ; 0 0 ; ; 0 0 ; 0 ; ; 0 ; 0 ; ; 0 0 ; ; 0 ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; 0 0 ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 0 ; ; ; 0 ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; 0 ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 13
14 A1 A2 A3 A4 Appenix C: Orer 44 (Sequenes with zero perioi utoorreltion funtion) Design 9 34) (1 ( ) ( ) ( ) ( ) (2 41) (4 37) (5 34) (5 37) (6 29) (6 33) (6 35) (7 30) ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; 0 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; 0 0 ; ; ; ; 0 0 ; ; ; 0 0 ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; 0 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; 0 ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; 0 0 ; 0 ; 0 ; ; 0 0 ; ; ; 0 ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; 0 ; 0 ; ; ; ; 0 ; ; 14
15 A1 A2 A3 A4 Appenix C(ont): Orer 44 (Sequenes with zero perioi utoorreltion funtion) Design 34) (7 (7 35) (8 27) (8 29) (8 33) (9 32) (10 31) (11 27) (11 28) (11 31) (12 25) (12 26) (12 30) ; ; ; ; ; 0 ; ; 0 ; ; ; ; ; ; ; ; 0 ; 0 ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; 0 ; ; ; ; ; 0 0 ; ; ; 0 ; ; ; ; ; 0 ; ; 0 ; ; ; ; ; ; 0 ; ; ; ; ; 0 ; ; ; ; ; ; ; 0 ; 0 ; ; ; ; ; 0 ; 0 0 ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; 0 0 ; ; 0 ; 0 ; ; ; 0 ; ; ; 0 0 ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; 0 ; ; ; ; 0 ; ; ; 0 ; ; ; 0 0 ; ; ; ; ; ; ; ; 0 ; 0 0 ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; 0 ; ; ; 0 ; ; 0 0 ; ; ; ; 0 ; 0 0 ; ; ; ; ; ; ; ; ; 0 ; 15
16 A1 A2 A3 A4 Appenix C(ont): Orer 44 (Sequenes with zero perioi utoorreltion funtion) Design 22) (13 (13 24) (13 25) (13 26) (13 28) (13 31) (14 15) (14 17) (14 23) (14 24) (14 25) (14 28) ; ; 0 ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; 0 ; 0 ; ; ; ; ; ; 0 ; ; ; 0 ; ; ; ; ; 0 ; 0 ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; 0 ; 0 0 ; 0 ; ; ; ; ; ; ; ; 0 ; 0 ; 0 0 ; ; ; ; ; 0 ; 0 ; ; ; 0 ; ; ; 0 0 ; ; ; ; ; ; 0 ; ; ; ; ; 0 ; 0 ; ; ; ; 0 ; ; 0 ; ; ; ; 0 ; ; 0 ; ; ; ; ; 0 0 ; 0 ; 0 ; ; ; ; ; 0 ; ; 0 ; ; ; 0 ; 0 ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 0 ; ; ; ; ; ; ; ; ; ; 0 ; 0 ; ; ; ; 0 ; 0 ; 0 ; ; ; 0 ; ; ; ; 0 ; ; 0 ; 0 ; ; ; ; ; ; ; 0 0 ; ; ; ; ; ; ; ; ; ; ; ; 16
17 A1 A2 A3 A4 Appenix C(ont): Orer 44 (Sequenes with zero perioi utoorreltion funtion) Design 30) (14 (15 22) (15 23) (15 24) (15 27) (15 29) (17 21) (17 22) (17 24) (17 25) (18 19) (18 21) ; ; ; ; ; ; ; ; ; ; ; ; 0 ; 0 0 ; ; ; ; ; ; ; ; 0 ; 0 ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; 0 ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; 0 ; ; ; ; ; ; 0 ; 0 ; ; 0 ; ; 0 ; ; 0 0 ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; 0 ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; 0 ; ; 0 ; ; 0 ; ; ; ; 0 0 ; 0 ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; 0 0 ; ; ; 0 ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; 0 ; ; 0 ; 0 ; ; ; 17
18 A1 A2 A3 A4 Appenix C(ont): Orer 44 (Sequenes with zero perioi utoorreltion funtion) Design 23) (18 (19 22) (19 23) (20 21) (21 23) ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 0 ; ; ; ; ; ; 0 ; ; ; ; 0 ; ; ; ; ; 0 ; ; ; ; 0 ; ; ; 0 ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; 18
Necessary and sufficient conditions for some two variable orthogonal designs in order 44
University of Wollongong Reserch Online Fculty of Informtics - Ppers (Archive) Fculty of Engineering n Informtion Sciences 1998 Necessry n sufficient conitions for some two vrile orthogonl esigns in orer
More informationSection 2.3. Matrix Inverses
Mtri lger Mtri nverses Setion.. Mtri nverses hree si opertions on mtries, ition, multiplition, n sutrtion, re nlogues for mtries of the sme opertions for numers. n this setion we introue the mtri nlogue
More information18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106
8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More informationCounting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs
Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if
More informationTutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.
Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix
More informationProject 6: Minigoals Towards Simplifying and Rewriting Expressions
MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy
More informationDIFFERENCE BETWEEN TWO RIEMANN-STIELTJES INTEGRAL MEANS
Krgujev Journl of Mthemtis Volume 38() (204), Pges 35 49. DIFFERENCE BETWEEN TWO RIEMANN-STIELTJES INTEGRAL MEANS MOHAMMAD W. ALOMARI Abstrt. In this pper, severl bouns for the ifferene between two Riemn-
More informationPOSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS
Bull. Koren Mth. So. 35 (998), No., pp. 53 6 POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS YOUNG BAE JUN*, YANG XU AND KEYUN QIN ABSTRACT. We introue the onepts of positive
More informationCS 491G Combinatorial Optimization Lecture Notes
CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,
More informationLecture 8: Abstract Algebra
Mth 94 Professor: Pri Brtlett Leture 8: Astrt Alger Week 8 UCSB 2015 This is the eighth week of the Mthemtis Sujet Test GRE prep ourse; here, we run very rough-n-tumle review of strt lger! As lwys, this
More informationLinear Algebra Introduction
Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +
More informationFactorising FACTORISING.
Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will
More informationA Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version
A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment
More informationLogic Synthesis and Verification
Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most
More informationEXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED
EXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED Astrt. The GCD Str of Dvi Theorem n the numerous ppers relte to it hve lrgel een evote to shoing the equlit
More informationTOPIC: LINEAR ALGEBRA MATRICES
Interntionl Blurete LECTUE NOTES for FUTHE MATHEMATICS Dr TOPIC: LINEA ALGEBA MATICES. DEFINITION OF A MATIX MATIX OPEATIONS.. THE DETEMINANT deta THE INVESE A -... SYSTEMS OF LINEA EQUATIONS. 8. THE AUGMENTED
More informationCS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6
CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized
More informationMid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours
Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into
More information1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.
1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the
More informationProbability. b a b. a b 32.
Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,
More informationOn the Spectra of Bipartite Directed Subgraphs of K 4
On the Spetr of Biprtite Direte Sugrphs of K 4 R. C. Bunge, 1 S. I. El-Znti, 1, H. J. Fry, 1 K. S. Kruss, 2 D. P. Roerts, 3 C. A. Sullivn, 4 A. A. Unsiker, 5 N. E. Witt 6 1 Illinois Stte University, Norml,
More informationGraph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}
Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or Multi-Grph We llow loops n multiple eges. G = (V, E.ψ)
More informationLecture 6: Coding theory
Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those
More informationOn a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
Journl of Grph Algorithms n Applitions http://jg.info/ vol. 13, no. 2, pp. 153 177 (2009) On Clss of Plnr Grphs with Stright-Line Gri Drwings on Liner Are M. Rezul Krim 1,2 M. Siur Rhmn 1 1 Deprtment of
More information22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:
22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)
More informationDiscrete Structures Lecture 11
Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.
More informationA Study on the Properties of Rational Triangles
Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn
More informationSOME COPLANAR POINTS IN TETRAHEDRON
Journl of Pure n Applie Mthemtis: Avnes n Applitions Volume 16, Numer 2, 2016, Pges 109-114 Aville t http://sientifivnes.o.in DOI: http://x.oi.org/10.18642/jpm_7100121752 SOME COPLANAR POINTS IN TETRAHEDRON
More information50 AMC Lectures Problem Book 2 (36) Substitution Method
0 AMC Letures Prolem Book Sustitution Metho PROBLEMS Prolem : Solve for rel : 9 + 99 + 9 = Prolem : Solve for rel : 0 9 8 8 Prolem : Show tht if 8 Prolem : Show tht + + if rel numers,, n stisf + + = Prolem
More informationTechnische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution
Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:
More informationCompression of Palindromes and Regularity.
Compression of Plinromes n Regulrity. Kyoko Shikishim-Tsuji Center for Lierl Arts Eution n Reserh Tenri University 1 Introution In [1], property of likstrem t t view of tse is isusse n it is shown tht
More informationProportions: A ratio is the quotient of two numbers. For example, 2 3
Proportions: rtio is the quotient of two numers. For exmple, 2 3 is rtio of 2 n 3. n equlity of two rtios is proportion. For exmple, 3 7 = 15 is proportion. 45 If two sets of numers (none of whih is 0)
More informationLogic Synthesis and Verification
Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 22 Reding: Logi Synthesis in Nutshell Setion 2 most
More informationarxiv: v2 [math.co] 31 Oct 2016
On exlue minors of onnetivity 2 for the lss of frme mtrois rxiv:1502.06896v2 [mth.co] 31 Ot 2016 Mtt DeVos Dryl Funk Irene Pivotto Astrt We investigte the set of exlue minors of onnetivity 2 for the lss
More informationMatrix- System of rows and columns each position in a matrix has a purpose. 5 Ex: 5. Ex:
Mtries Prelulus Mtri- Sstem of rows n olumns eh position in mtri hs purpose. Element- Eh vlue in the mtri mens the element in the n row, r olumn Dimensions- How mn rows b number of olumns Ientif the element:
More informationAlgebra 2 Semester 1 Practice Final
Alger 2 Semester Prtie Finl Multiple Choie Ientify the hoie tht est ompletes the sttement or nswers the question. To whih set of numers oes the numer elong?. 2 5 integers rtionl numers irrtionl numers
More informationIntroduction to Olympiad Inequalities
Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................
More informationSurds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,
Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.
More informationI 3 2 = I I 4 = 2A
ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents
More informationArrow s Impossibility Theorem
Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep
More informationCARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005
RLETON UNIVERSIT eprtment of Eletronis ELE 2607 Swithing iruits erury 28, 05; 0 pm.0 Prolems n Most Solutions, Set, 2005 Jn. 2, #8 n #0; Simplify, Prove Prolem. #8 Simplify + + + Reue to four letters (literls).
More informationCIT 596 Theory of Computation 1. Graphs and Digraphs
CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege
More information2.4 Theoretical Foundations
2 Progrmming Lnguge Syntx 2.4 Theoretil Fountions As note in the min text, snners n prsers re se on the finite utomt n pushown utomt tht form the ottom two levels of the Chomsky lnguge hierrhy. At eh level
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationChapter 8 Roots and Radicals
Chpter 8 Roots nd Rdils 7 ROOTS AND RADICALS 8 Figure 8. Grphene is n inredily strong nd flexile mteril mde from ron. It n lso ondut eletriity. Notie the hexgonl grid pttern. (redit: AlexnderAIUS / Wikimedi
More informationCS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014
S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown
More informationDiscrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α
Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw
More informationNumbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point
GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationAP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals
AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into
More informationArrow s Impossibility Theorem
Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties
More informationMathematical Proofs Table of Contents
Mthemtil Proofs Tle of Contents Proof Stnr Pge(s) Are of Trpezoi 7MG. Geometry 8.0 Are of Cirle 6MG., 9 6MG. 7MG. Geometry 8.0 Volume of Right Cirulr Cyliner 6MG. 4 7MG. Geometry 8.0 Volume of Sphere Geometry
More informationSOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVEX STOCHASTIC PROCESSES ON THE CO-ORDINATES
Avne Mth Moels & Applitions Vol3 No 8 pp63-75 SOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVE STOCHASTIC PROCESSES ON THE CO-ORDINATES Nurgül Okur * Imt Işn Yusuf Ust 3 3 Giresun University Deprtment
More informationAlgorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:
Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer
More informationLesson 55 - Inverse of Matrices & Determinants
// () Review Lesson - nverse of Mtries & Determinnts Mth Honors - Sntowski - t this stge of stuying mtries, we know how to, subtrt n multiply mtries i.e. if Then evlute: () + B (b) - () B () B (e) B n
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More informationNondeterministic Automata vs Deterministic Automata
Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n
More informationLECTURE 3. Orthogonal Functions. n X. It should be noted, however, that the vectors f i need not be orthogonal nor need they have unit length for
ECTURE 3 Orthogonl Functions 1. Orthogonl Bses The pproprite setting for our iscussion of orthogonl functions is tht of liner lgebr. So let me recll some relevnt fcts bout nite imensionl vector spces.
More informationParticle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap
Prtile Physis Mihelms Term 2011 Prof Mrk Thomson g X g X g g Hnout 3 : Intertion y Prtile Exhnge n QED Prof. M.A. Thomson Mihelms 2011 101 Rep Working towrs proper lultion of ey n sttering proesses lnitilly
More informationMatrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24
Mtrix lger Mtrix ddition, Sclr Multipliction nd rnsposition Mtrix lger Section.. Mtrix ddition, Sclr Multipliction nd rnsposition rectngulr rry of numers is clled mtrix ( the plurl is mtrices ) nd the
More informationIf the numbering is a,b,c,d 1,2,3,4, then the matrix representation is as follows:
Reltions. Solutions 1. ) true; ) true; ) flse; ) true; e) flse; f) true; g) flse; h) true; 2. 2 A B 3. Consier ll reltions tht o not inlue the given pir s n element. Oviously, the rest of the reltions
More informationCS 573 Automata Theory and Formal Languages
Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple
More informationSection 1.3 Triangles
Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior
More informationMaximum size of a minimum watching system and the graphs achieving the bound
Mximum size of minimum wthing system n the grphs hieving the oun Tille mximum un système e ontrôle minimum et les grphes tteignnt l orne Dvi Auger Irène Chron Olivier Hury Antoine Lostein 00D0 Mrs 00 Déprtement
More informationLecture Notes No. 10
2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite
More informationOn Implicative and Strong Implicative Filters of Lattice Wajsberg Algebras
Glol Journl of Mthemtil Sienes: Theory nd Prtil. ISSN 974-32 Volume 9, Numer 3 (27), pp. 387-397 Interntionl Reserh Pulition House http://www.irphouse.om On Implitive nd Strong Implitive Filters of Lttie
More informationNON-DETERMINISTIC FSA
Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is
More informationMonochromatic Plane Matchings in Bicolored Point Set
CCCG 2017, Ottw, Ontrio, July 26 28, 2017 Monohromti Plne Mthings in Biolore Point Set A. Krim Au-Affsh Sujoy Bhore Pz Crmi Astrt Motivte y networks interply, we stuy the prolem of omputing monohromti
More informationQuadratic Forms. Quadratic Forms
Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte
More informationBisimulation, Games & Hennessy Milner logic
Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory
More informationLogic, Set Theory and Computability [M. Coppenbarger]
14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer
More informationChapter 4 State-Space Planning
Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different
More information(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.
Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time
More informationUnit 4. Combinational Circuits
Unit 4. Comintionl Ciruits Digitl Eletroni Ciruits (Ciruitos Eletrónios Digitles) E.T.S.I. Informáti Universidd de Sevill 5/10/2012 Jorge Jun 2010, 2011, 2012 You re free to opy, distriute
More informationMatrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix
tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri
More informationKENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations)
KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS 6-7 CLASS - XII MATHEMATICS (Reltions nd Funtions & Binry Opertions) For Slow Lerners: - A Reltion is sid to e Reflexive if.. every A
More informationThings to Memorize: A Partial List. January 27, 2017
Things to Memorize: A Prtil List Jnury 27, 2017 Chpter 2 Vectors - Bsic Fcts A vector hs mgnitude (lso clled size/length/norm) nd direction. It does not hve fixed position, so the sme vector cn e moved
More informationSeptember 13 Homework Solutions
College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are
More informationLecture 2: Cayley Graphs
Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re
More informationLecture Solution of a System of Linear Equation
ChE Lecture Notes, Dept. of Chemicl Engineering, Univ. of TN, Knoville - D. Keffer, 5/9/98 (updted /) Lecture 8- - Solution of System of Liner Eqution 8. Why is it importnt to e le to solve system of liner
More informationIdentifying and Classifying 2-D Shapes
Ientifying n Clssifying -D Shpes Wht is your sign? The shpe n olour of trffi signs let motorists know importnt informtion suh s: when to stop onstrution res. Some si shpes use in trffi signs re illustrte
More informationIntermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths
Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t
More information1B40 Practical Skills
B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need
More informationTotal score: /100 points
Points misse: Stuent's Nme: Totl sore: /100 points Est Tennessee Stte University Deprtment of Computer n Informtion Sienes CSCI 2710 (Trnoff) Disrete Strutures TEST 2 for Fll Semester, 2004 Re this efore
More information16z z q. q( B) Max{2 z z z z B} r z r z r z r z B. John Riley 19 October Econ 401A: Microeconomic Theory. Homework 2 Answers
John Riley 9 Otober 6 Eon 4A: Miroeonomi Theory Homework Answers Constnt returns to sle prodution funtion () If (,, q) S then 6 q () 4 We need to show tht (,, q) S 6( ) ( ) ( q) q [ q ] 4 4 4 4 4 4 Appeling
More informationSEMI-EXCIRCLE OF QUADRILATERAL
JP Journl of Mthemtil Sienes Volume 5, Issue &, 05, Pges - 05 Ishn Pulishing House This pper is ville online t http://wwwiphsiom SEMI-EXCIRCLE OF QUADRILATERAL MASHADI, SRI GEMAWATI, HASRIATI AND HESY
More informationSECTION A STUDENT MATERIAL. Part 1. What and Why.?
SECTION A STUDENT MATERIAL Prt Wht nd Wh.? Student Mteril Prt Prolem n > 0 n > 0 Is the onverse true? Prolem If n is even then n is even. If n is even then n is even. Wht nd Wh? Eploring Pure Mths Are
More information6. Suppose lim = constant> 0. Which of the following does not hold?
CSE 0-00 Nme Test 00 points UTA Stuent ID # Multiple Choie Write your nswer to the LEFT of eh prolem 5 points eh The k lrgest numers in file of n numers n e foun using Θ(k) memory in Θ(n lg k) time using
More informationMore Properties of the Riemann Integral
More Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologil Sienes nd Deprtment of Mthemtil Sienes Clemson University Februry 15, 2018 Outline More Riemnn Integrl Properties The Fundmentl
More informationON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups. Sang Keun Lee
Kngweon-Kyungki Mth. Jour. 10 (2002), No. 2, pp. 117 122 ON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups Sng Keun Lee Astrt. In this pper, we give some properties of left(right) semi-regulr nd g-regulr
More informationSeparable discrete functions: recognition and sufficient conditions
Seprle isrete funtions: reognition n suffiient onitions Enre Boros Onřej Čepek Vlimir Gurvih Novemer 21, 217 rxiv:1711.6772v1 [mth.co] 17 Nov 217 Astrt A isrete funtion of n vriles is mpping g : X 1...
More informationData Compression Techniques (Spring 2012) Model Solutions for Exercise 4
58487 Dt Compressio Tehiques (Sprig 0) Moel Solutios for Exerise 4 If you hve y fee or orretios, plese ott jro.lo t s.helsii.fi.. Prolem: Let T = Σ = {,,, }. Eoe T usig ptive Huffm oig. Solutio: R 4 U
More informationPAIR OF LINEAR EQUATIONS IN TWO VARIABLES
PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,
More informationSolutions to Problem Set #1
CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors
More informationParse trees, ambiguity, and Chomsky normal form
Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
More informationLecture 2e Orthogonal Complement (pages )
Lecture 2e Orthogonl Complement (pges -) We hve now seen tht n orthonorml sis is nice wy to descrie suspce, ut knowing tht we wnt n orthonorml sis doesn t mke one fll into our lp. In theory, the process
More informationLecture 11 Binary Decision Diagrams (BDDs)
C 474A/57A Computer-Aie Logi Design Leture Binry Deision Digrms (BDDs) C 474/575 Susn Lyseky o 3 Boolen Logi untions Representtions untion n e represente in ierent wys ruth tle, eqution, K-mp, iruit, et
More information