On the Spectra of Bipartite Directed Subgraphs of K 4
|
|
- Janel Hunter
- 5 years ago
- Views:
Transcription
1 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, IL Alm College, Alm, MI Illinois Wesleyn University, Bloomington, IL Bowling Green Stte University, Bowling Green, OH Brighm Young University, Provo, UT Simeon Creer Aemy, Chigo, IL Astrt The omplete irete grph of orer n, enote K n, is the irete grph on n verties tht ontins the rs (u, v) n (v, u) for every pir of istint verties u n v. For given irete grph, D, the set of ll n for whih K n mits D-eomposition is lle the spetrum of D. In this pper, we fin the spetrum for eh iprtite sugrph of K 4 with 5 or fewer rs. 1 Introution One of the primry questions in the fiel of grph eompositions is Given grph G, whih omplete grphs mit G-eomposition? Answering this question for ll grphs of smll orer hs een the topi of vrious ppers. In prtiulr, this question ws nswere for grphs n uniform hypergrphs of smll orer in [3] n [5], respetively. In this pper we follow this line of inquiry to irete grphs y lssifying the spetr of iprtite irete grphs of orer t most 4, with up to 5 rs. If n re integers, we enote {, +1,..., } y [, ] (if >, then [, ] = ). Let N enote the set of nonnegtive integers n Z m the group of integers moulo m. Throughout this pper, we refer to irete grphs Reserh supporte y Ntionl Siene Fountion Grnt No. A
2 s igrphs. For igrph, D, let V (D) n E(D) enote the vertex set of D n the r set of D, respetively. The orer n the size of igrph D re V (D) n E(D), respetively. Throughout this pper we will use the nmes for igrphs, isplye in Tles 1 n 2, foun in An Atls of Grphs [13] y Re n Wilson. Let H n D e igrphs suh tht D is sugrph of H. A D- eomposition of H is set = {D 1, D 2,..., D r } of pirwise ege-isjoint sugrphs of H eh of whih is isomorphi to D n suh tht E(H) = r i=1 E(D i). If D-eomposition of H exists, then we sy tht D eomposes H. The reverse orienttion of D is the igrph with vertex set V (D) n r set {(v, u): (u, v) E(D)}. Let D n H enote the reverse orienttions of D n H, respetively. We note tht the existene of D- eomposition of H neessrily implies the existene of D -eomposition of H. A D-eomposition of Kn is lso known s (Kn, D)-esign. The set of ll n for whih Kn mits D-eomposition is lle the spetrum of D. Sine Kn is its own reverse orienttion, we note tht the spetrum of D is equivlent to the spetrum of D. The neessry onitions for igrph D to eompose Kn inlue (A) V (D) n, (B) E(D) ivies n(n 1), n (C) g{outegree(v): v V (D)} n g{inegree(v): v V (D)} oth ivie n 1. There re 51 iprtite sugrphs of K 4 with no isolte verties. It ws shown in [6] tht 37 of these eompose K mx+1 ylilly (efine in Setion 2), where m is the numer of rs in the sugrph. Until now, the spetr for the mjority of these grphs h not een lssifie. This pper extens those results y fining the spetr for ll 42 iprtite sugrphs of K 4 with 5 rs or fewer. If D is sugrph of K 4 with m 5 rs, then y onition (B) the existene of (K n, D)-esign neessittes tht n 0 or 1 (mo m). Through series of lemms, we prove the following. Theorem 1. The spetr for the 42 iprtite sugrphs of K4 fewer rs re s isplye in Tle 3. with 5 or The spetr for ertin sugrphs (oth iprtite n non-iprtite) of K 4 hve lrey een stuie. When D is yli orienttion of K 3, then (K n, D)-esign is known s Menelsohn triple system. The spetrum for Menelsohn triple systems ws foun inepenently y Menelsohn [11] n Bermon [2].When D is trnsitive orienttion of K 3, then (K n, D)- esign is known s trnsitive triple system. The spetrum for trnsitive triple systems ws foun y Hung n Menelsohn [9]. In [8], Hrtmn n Menelsohn foun the spetr for ll remining simple onnete su- 2
3 grphs of K 3, whih inlue grphs D7, D10, D11, D13, D16, n D25 (see Tle 1). There re extly four orienttions of 4-yle. It ws shown in [15] tht if D is yli orienttion of 4-yle (i.e., D67), then (K n, D)- esign exists if n only if n 0 or 1 (mo 4) n n 4. The spetr for the remining three orienttions of 4-yle (i.e., D46, D59, D60) were foun in [7]. A irete pth on n verties, enote DP n, is the irete grph whose unerlying simple grph is pth on n verties suh tht every vertex tht is not lef in the unerlying grph hs oth inegree n outegree of one. In [12], neessry n suffiient onitions for eomposition of the omplete multi-igrph into irete pths of ritrrily presrie lengths were foun. In prtiulr, this hrterizes the spetr of D25 n D38. Here, we stte their result only for ege multipliity one n fixe pth length. Theorem 2. [12] Neessry n suffiient onitions for the existene of (K n, DP m+1 )-esign re m n 1 n n(n 1) 0 (mo m), unless (m, n) is either (4, 5) or (2, 3). A igrph is lle n ntiirete pth if its unerlying grph is pth, n it oes not mit irete pth of length 2 s sugrph. Let D e n ntiirete pth. Neessry n suffiient onitions for the existene of (K n, D)-esign were otine in [16]. Notie tht D7, D10, n D33 re ntiirete pths. Theorem 3. [16] Let AP m enote n ntiirete pth on m verties. A (Kn, AP m+1 )-esign exists if n only if the following onitions re stisfie: (1) m n 1, (2) n(n 1) 0 (mo m), (3) n or m is o. Let G e iprtite sugrph of the 2-fol unirete omplete grph on 4 verties. In [1] neessry n suffiient onitions were otine for the existene of G-eomposition of the 2-fol unirete omplete grph on n verties. Severl of these eompositions iretly trnslte to igrph eompositions of interest in this pper. In prtiulr, the spetr of D3, D4, D16, D27, D37, n D66 re otine from these results. 3
4 2 Grph lelings Let V (K n) = [0, n 1]. The length of n r (i, j) is j i if j > i, n it is n + j i otherwise. Note tht E(K n) onsists of n rs of length i for eh i [1, n 1]. Let D e sugrph of K n. By rotting D, we men pplying the permuttion i i + 1 to V (D) where the ition is one moulo n. Moreover in this se, if j N, then D + j is the igrph otine from D y suessively rotting D totl of j times. Note tht rotting n r oes not hnge its length. Also note tht D + j is isomorphi to D for every j N. A (K n, D)-esign is yli if rotting is n utomorphism of. Grph lelings were introue y Ros in [14] n provie mens of otining yli esigns for unirete grphs. In prtiulr, the wellknown greful leling ws efine in [14]. In 1985, Bloom n Hsu [4] extene the onept of greful leling to irete grphs. With the nottion pte to etter suit this pper, we present the following efinition from [4]. Let D e irete grph with m rs n t most m + 1 verties. Let f : V (D) [0, m] e n injetive funtion, n efine funtion f : E(D) [1, m] s follows: f((, )) = f() f(), if f() > f(), n f((, )) = m f() f(), otherwise. We ll f irete ρ-leling of D if { f((, )): (, ) E(D)} = [1, m]. Thus, irete ρ-leling of D is n emeing of D in K m+1 suh tht there is extly one r in D of length i for eh i [1, m]. It ws shown in [10] tht for igrph D with size m n orer t most m + 1, yli (K m+1, D)-esign exists if n only if D mits irete ρ-leling. In orer to otin n infinite fmily of yli esigns, it is neessry to exten the notion of irete ρ-leling. In our se this is omplishe y restriting ourselves to iprtite igrphs n imposing n orer on the leling. Let D e iprtite irete grph with m rs n t most m + 1 verties. Let {A, B} e vertex iprtition of V (D). A irete ρ-leling f of D is orere if f() < f() for eh r with en verties A n B. An orere irete ρ-leling is lso lle irete ρ + -leling. The onnetion etween irete ρ + -lelings n yli igrph esigns is foun in result from [6]. Theorem 4. If D is iprtite irete grph with m rs tht mits irete ρ + -leling, then there exists yli (K mx+1, D)-esign for ll x Z +. Next we onsier n nlogue of 1-rottionl esigns for irete grphs. If we let V (K n) = [0, n 2] { }, then the length of n r (i, j), where {i, j}, is j i if j > i, n it is n 1 + j i otherwise. Furthermore, 4
5 we sy tht the length of n r of the form (i, ) is +, n the length of n r of the form (, j) is. Let D e sugrph of Kn. A (Kn, D)- esign is lle 1-rottionl irete esign if pplying the permuttion (0, 1, 2,..., n 2)( ) is n utomorphism of. Let D e irete grph with m rs n t most m verties. Let f : V (D) [0, m 1] { } e n injetive funtion n efine funtion f : E(D) [1, m 2] {+, } s follows: f() f() if f() > f(), m 1 + f() f() if f() < f(), f((, )) = + if f() =, if f() =. We ll f 1-rottionl irete ρ-leling of D if { f((, )): (, ) E(D)} = [1, m 2] {+, }. Thus, 1-rottionl irete ρ-leling of D is n emeing of D in K m suh tht there is extly one r in D of length i for eh i [1, m 2] {+, }. The following theorem formlizes this oservtion. Theorem 5. Let D e iprtite irete grph with m rs. There exists 1-rottionl (K m, D)-esign if n only if D mits 1-rottionl irete ρ-leling. 3 Min Results The 42 non-isomorphi iprtite sugrphs of K4 of size t most 5 re shown in Tles 1 n 2. These tles lso give key tht enotes lele opy for eh iprtite irete grph. For exmple, D11[,, ] refers to the grph with three verties lele,, n with two rs etween n n single r irete from to. Our generl metho for lssifying the spetrum for suh grph of size m is to rek into two ses: omplete grphs with mx + 1 verties n omplete grphs with mx verties. However, we first note the following negtive results for the suffiieny of the neessry onitions, whih n e esily verifie. Lemm 6. There oes not exist n (H, D)-esign for (H, D) {(K 4, D50), (K 5, D50), (K 4, D51), (K 6, D99)}. Let G n H e vertex-isjoint irete grphs. The join of G n H, enote G H, is efine to e the irete grph with vertex set V (G) V (H) n r set E(G) E(H) {(u, v), (v, u): u V (G), v V (H)}. We use the shorthn nottion t i=1 G i to enote G 1 G 2 G t, n when G i = Gj t = G for ll 1 i < j t, we use the nottion i=1 G. For exmple, K12 = 4 i=1 K 3. 5
6 Tle 1: Biprtite sugrphs of K 4 with 3 or fewer rs. 2 3 verties D3[, ] D4[, ] D7[,, ] D10[,, ] D11[,, ] D13[,, ] D25[,, ] D27[,,, ] D28[,,, ] D31[,,, ] D32[,,, ] 4 verties D33[,,, ] D36[,,, ] D37[,,, ] D38[,,, ] D39[,,, ] D40[,,, ] 6
7 Tle 2: Biprtite sugrphs of K 4 with 4 or 5 rs. D16[,, ] D41[,,, ] D44[,,, ] D46[,,, ] D50[,,, ] D51[,,, ] D52[,,, ] D54[,,, ] D56[,,, ] D59[,,, ] D60[,,, ] D62[,,, ] D63[,,, ] D64[,,, ] D66[,,, ] D67[,,, ] D70[,,, ] D77[,,, ] D84[,,, ] D86[,,, ] D91[,,, ] D92[,,, ] D99[,,, ] D100[,,, ] D104[,,, ] 7
8 Tle 3: The neessry n suffiient onitions for the given igrphs to eompose Kn. Dirph Conitions Referenes D3 n 1 [1] D4 n 1 [1] D7 n 1 (mo 2) [8], [16], [6] D10 n 1 (mo 2) [8], [16], [6] D11 n 0 or 1 (mo 3) [8], [6] D13 n 0 or 1 (mo 3) [8], [6] D16 n 0 or 1 (mo 4) [8], [6] D25 n = 1 or n 4 [8], [12] D27 n = 1 or n 4 [1] D28 n 1 (mo 3) [6] D31 n 0 or 1 (mo 3), n 3 [6], Lemm 12 D32 n 0 or 1 (mo 3), n 3 Lemms 8 n 13 D33 n 0 or 1 (mo 3), n 3 [16], [6] D36 n 0 or 1 (mo 3), n 3 [6], Lemm 12 D37 n 0 or 1 (mo 3), n = 1 or n 6 [1] D38 n 0 or 1 (mo 3), n 3 [12], [6] D39 n 0 or 1 (mo 3), n 3 Lemms 8 n 13 D40 n 1 (mo 3) [6] D41 n 0 or 1 (mo 4) [6], Lemm 14 D44 n 1 (mo 4) [6] D46 n 1 (mo 4) [7], [6] D50 n 0 or 1 (mo 4), n = 1 or n 8 Lemms 6, 9, n 15 D51 n 0 or 1 (mo 4), n 4 [6], Lemms 6 n 16 D52 n 0 or 1 (mo 4) Lemms 10 n 17 D54 n 0 or 1 (mo 4) [6], Lemm 18 D56 n 0 or 1 (mo 4) [6], Lemm 18 D59 n 0 or 1 (mo 4), n = 1 or n 8 [7] D60 n 0 or 1 (mo 4), n 5 [7] D62 n 0 or 1 (mo 4) [6], Lemm 14 D63 n 1 (mo 4) [6] D64 n 0 or 1 (mo 4) Lemms 10 n 17 D66 n 0 or 1 (mo 4) [6], [1] D67 n 0 or 1 (mo 4), n 4 [15] D70 n 0 or 1 (mo 5) [6], Lemm 19 D77 n 0 or 1 (mo 5) [6], Lemm 20 D84 n 0 or 1 (mo 5) [6], Lemm 21 D86 n 0 or 1 (mo 5) [6], Lemm 22 D91 n 0 or 1 (mo 5) [6], Lemm 19 D92 n 0 or 1 (mo 5) [6], Lemm 20 D99 n 0 or 1 (mo 5), n 6 Lemms 6, 11, n 23 D100 n 0 or 1 (mo 5) [6], Lemm 24 D104 n 0 or 1 (mo 5) [6], Lemm 21 8
9 3.1 Deompositions of K mx+1 Leling methos n e use to otin yli (K mx+1, D)-esigns for 31 of the 42 irete grphs. This is ue to the ft tht these grphs mit irete ρ + -lelings s shown in [6]. Theorem 7. [6] Let D e iprtite sugrph of K4 of size m, n let x e positive integer. If D oes not elong to the set {D25, D27, D32, D37, D39, D50, D52, D59, D60, D64, D99}, then there exists yli (Kmx+1, D)-esign. Next, we proee to the igrphs tht o not mit irete ρ + - leling. Throughout this setion we let the vertex set of Kmx+1 e [0, mx]. Furthermore, throughout the entirety of the pper let Ks,t hve vertex iprtition {A, B} where A = [0, s 1] n B = [s, s + t 1]. Lemm 8. For every integer x 1 there exists (K 3x+1, D)-esign for D {D32, D39}. Proof. Sine D39 is the reverse orienttion of D32, it suffies to show the existene of (K3x+1, D32)-esign. For x = 1, we hve the following (K4, D32)-esign: {D32[0, 3, 2, 1], D32[1, 2, 3, 0], D32[3, 2, 1, 0], D32[2, 3, 0, 1]}. For x > 1, we require the following (K 3,3, D32)-esign: {D32[0, 3, 4, 2], D32[1, 4, 5, 0], D32[2, 5, 3, 1], D32[4, 1, 0, 5], D32[5, 2, 1, 3], D32[3, 0, 2, 4]}. We write K3x+1 = K1 x i=1 K 3. On eh of the x opies of K1 K3, we ple (K4, D32)-esign. The remining rs form r-isjoint opies of K3,3, on eh of whih we ple (K3,3, D32)-esign. Lemm 9. For every integer x 2 there exists (K 4x+1, D50)-esign. Proof. For x = 2, onsier the igrph G = D50[0, 3, 5, 1] D50[0, 6, 4, 2]. It is esy to hek tht we hve irete ρ-leling of G, n thus (K 9, D50)-esign exists. For x = 3, onsier the irete grph H = D50[0, 6, 4, 1] D50[0, 4, 5, 2] D50[0, 5, 6, 3]. It is esy to hek tht we hve irete ρ-leling of H, n thus (K 13, D50)-esign exists. For x > 3, we require the following (K 4,4, D50)-esign: {D50[0, 5, 6, 4], D50[1, 6, 7, 5], D50[2, 7, 4, 6], D50[3, 4, 5, 7], D50[0, 6, 5, 7], D50[1, 7, 6, 4], D50[2, 4, 7, 5], D50[3, 5, 4, 6]}. 9
10 Cse 1: x = 2k for some integer k 2. We write K8k+1 = K1 k i=1 K 8. On eh of the k opies of K1 K8, we ple (K9, D50)-esign. The remining rs form r-isjoint opies of K8,8, eh of whih n e eompose into opies of K4,4. On eh of these opies of K4,4, we ple (K4,4, D50)-esign. Cse 2: x = 2k + 1 for some integer k 2. We write K 8k+5 = K 1 K 12 k 1 i=1 K 8. On the opy of K 1 K 12, we ple (K 13, D50)-esign. On eh of the k 1 opies of K 1 K 8, we ple (K 9, D50)-esign. The remining rs form r-isjoint opies of K 8,12 n K8,8, oth of whih n e eompose into opies of K4,4. On eh of these opies of K4,4, we ple (K4,4, D50)-esign. Lemm 10. For every integer x 1 there exists (K 4x+1, D)-esign for D {D52, D64}. Proof. Sine D64 is the reverse orienttion of D52, it suffies to show the existene of (K4x+1, D52)-esign. For x = 1, we hve the following (K5, D52)-esign: {D52[1, 0, 2, 3], D52[3, 4, 2, 1], D52[3, 1, 0, 4], D52[4, 1, 0, 2], D52[2, 4, 0, 3]}. For x > 1, we require the following (K 2,2, D52)-esign: {D52[0, 3, 2, 1], D52[1, 3, 2, 0]}. We write K4x+1 = K1 x i=1 K 4. On eh of the x opies of K1 K4, we ple (K5, D52)-esign. The remining rs form r-isjoint opies of K4,4, eh of whih n e eompose into opies of K2,2. On eh of these opies of K2,2, we ple (K2,2, D52)-esign. Lemm 11. For every integer x 2 there exists (K 5x+1, D99)-esign. Proof. For x = 2, we hve the following (K 11, D99)-esign: {D99[0, 1, 4, 7], D99[7, 3, 2, 6], D99[3, 0, 8, 5], D99[9, 5, 2, 4], D99[9, 8, 3, 6], D99[5, 10, 8, 3], D99[7, 8, 4, 1], D99[0, 2, 5, 1], D99[0, 6, 7, 5], D99[1, 3, 5, 2], D99[2, 10, 1, 6], D99[3, 4, 2, 5], D99[4, 6, 2, 8], D99[4, 9, 8, 1], D99[6, 7, 2, 9], D99[6, 9, 5, 3], D99[8, 0, 2, 7], D99[8, 10, 4, 0], D99[9, 0, 1, 10], D99[10, 4, 6, 1], D99[10, 7, 3, 5], D99[10, 9, 1, 7]}. For x = 3, onsier the igrph G = D99[0, 7, 2, 1] D99[0, 13, 8, 3] D99[0, 4, 5, 6]. It is esy to hek tht we hve irete ρ-leling of 10
11 G, n thus (K 16, D99)-esign exists. For x > 3, we require the following (K 5,10, D99)-esign: {D99[0, 5, 6, 2], D99[1, 6, 7, 3], D99[2, 7, 8, 4], D99[3, 8, 9, 0], D99[4, 9, 5, 1], D99[5, 3, 4, 14], D99[6, 4, 0, 10], D99[7, 0, 1, 11], D99[8, 1, 2, 12], D99[9, 2, 3, 13], D99[12, 0, 4, 8], D99[13, 1, 0, 9], D99[14, 2, 1, 5], D99[10, 3, 2, 6], D99[11, 4, 3, 7], D99[0, 14, 11, 1], D99[1, 10, 12, 2], D99[2, 11, 13, 3], D99[3, 12, 14, 4], D99[4, 13, 10, 0]}; n the rgument proees similrly s in the proof for Lemm Deompositions of K mx Neessry onition (A) implies tht there is no (K 3, D)-esign for ny igrph D {D28, D31, D32, D33, D36, D37, D38, D39, D40}. Furthermore, there is no (K 2, D27)-esign. Now, let D {D7, D10, D28, D40, D44, D63} n suppose D hs m rs. Then neessry onition (C) implies tht there is no (K mx, D)-esign for ny positive integer x. Throughout this setion we let V (K m) = [0, m 2] { }. Lemm 12. For every integer x 2 there exists (K 3x, D)-esign for D {D31, D36}. Proof. Sine D36 is the reverse orienttion of D31, it suffies to show the existene of (K 3x, D31)-esign. Let x 2 e n integer. The following is (K 3x, D31)-esign: {D31[0, 1,, 2], D31[0,, 1, 3]} {D31[0, 3 + 3(i 3), 4 + 3(i 3), 6 + 3(i 3)]: 3 i x}. Lemm 13. For every integer x 2 there exists (K 3x, D)-esign for D {D32, D39}. Proof. Sine D39 is the reverse orienttion of D32, it suffies to show the existene of (K 3x, D32)-esign. Let x 2 e n integer. The following is (K 3x, D32)-esign: {D32[0, 1,, 2]} {D32[0, 3 + 3(i 2), 4 + 3(i 2), 1]: 2 i x}. Lemm 14. For every integer x 1 there exists (K 4x, D)-esign for D {D41, D62}. 11
12 Proof. Sine D62 is the reverse orienttion of D41, it suffies to show the existene of (K 4x, D41)-esign. Let x 1 e n integer. The following is (K 4x, D41)-esign: {D41[0, 1, 2, ]} {D41[0, 1+4(i 1), 2+4(i 1), 4(i 1)]: 2 i x}. Lemm 15. For every integer x 2 there exists (K 4x, D50)-esign. Proof. Let x 2 e n integer. Cse 1: x = 2k for some integer k 1. The following is (K 8k, D50)- esign: {D50[0, 1, 2, ], D50[0, 6, 5, 4]} {D50[0, 1 + 8(i 1), 2 + 8(i 1), 8(i 1)]: 2 i x} {D50[0, 6 + 8(i 1), 5 + 8(i 1), 4 + 8(i 1)]: 2 i x}. Cse 2: x = 2k + 1 for some positive integer k 1. For k = 1, onsier the igrph G = D50[0, 7, 3, ] D50[0, 3, 5, 1] D50[0, 5, 7, 2]. It is esy to hek tht we hve 1-rottionl irete ρ-leling of G, n thus (K 12, D50)-esign exists. For k > 1, we write K 8k+4 = K 12 k 1 i=1 K 8. On the opy of K 12, we ple (K 12, D50)-esign. On eh of the k 1 opies of K 8, we ple (K 8, D50)-esign, whih is shown to exist in the proof of Cse 1. The remining rs form r-isjoint opies of K 8,12 n K 8,8, oth of whih n e eompose into opies of K 4,4. On eh of these opies of K4,4, we ple (K4,4, D50)-esign, whih is shown to exist in the proof for Lemm 9. Lemm 16. For every integer x 2 there exists (K 4x, D51)-esign. Proof. Let x 2 e n integer. The following is (K 4x, D51)-esign: {D51[0,, 1, 4], D51[0, 3, 2, ]} {D51[0, 6 + 4(i 3), 7 + 4(i 3), 2]: 3 i x}. Lemm 17. For every integer x 1 there exists (K 4x, D)-esign for D {D52, D64}. Proof. Sine D64 is the reverse orienttion of D52, it suffies to show the existene of (K4x, D52)-esign. For x = 1, onsier the igrph D52[0, 1,, 2]. It is esy to hek tht we hve 1-rottionl irete ρ- leling of D52, n thus (K4, D52)-esign exists. For x > 1, we write K 4x = x i=1 K 4. On eh of the x opies of K 4, we ple (K 4, D52)- esign. The remining rs form r-isjoint opies of K 4,4, eh of whih n e eompose into opies of K 2,2. On eh of these opies of K 2,2, we ple (K2,2, D52)-esign, whih is shown to exist in the proof for Lemm
13 Lemm 18. For every integer x 1 there exists (K 4x, D)-esign for D {D54, D56}. Proof. Sine D56 is the reverse orienttion of D54, it suffies to show the existene of (K 4x, D54)-esign. Let x 1 e n integer. The following is (K 4x, D54)-esign: {D54[0,, 2, 1]} {D54[0, 4 + 4(i 2), 6 + 4(i 2), 1]: 2 i x}. Lemm 19. For every integer x 1 there exists (K 5x, D)-esign for D {D70, D91}. Proof. Sine D91 is the reverse orienttion of D70, it suffies to show the existene of (K 5x, D70)-esign. Let x 1 e n integer. The following is (K 5x, D70)-esign: {D70[0,, 2, 1]} {D70[0, 5(i 1), 2+5(i 1), 1+5(i 1)]: 2 i x}. Lemm 20. For every integer x 1 there exists (K 5x, D)-esign for D {D77, D92}. Proof. Sine D92 is the reverse orienttion of D77, it suffies to show the existene of (K 5x, D77)-esign. Let x 1 e n integer. The following is (K 5x, D77)-esign: {D77[0,, 3, 1]} {D77[0, 5(i 1), 3 + 5(i 1), 1]: 2 i x}. Lemm 21. For every integer x 1 there exists (K 5x, D)-esign for D {D84, D104}. Proof. Sine D104 is the reverse orienttion of D84, it suffies to show the existene of (K 5x, D84)-esign. Let x 1 e n integer. The following is (K 5x, D84)-esign: {D84[0,, 2, 1]} {D84[4 + 5(i 2), 0, 2, 5 + 5(i 2)]: 2 i x}. Lemm 22. For every integer x 1 there exists (K5x, D86)-esign. Proof. For x = 1, we hve the following (K5, D86)-esign: {D86[0, 1, 2, 3], D86[0, 3,, 2], D86[, 1, 0, 2], D86[, 3, 2, 1]}. For x > 1, we require the following (K5,5, D86)-esign: {D86[0, 5, 7, 4], D86[1, 6, 8, 0], D86[2, 7, 9, 1], D86[3, 8, 5, 2], D86[4, 9, 6, 3], D86[6, 2, 4, 5], D86[7, 3, 0, 6], D86[8, 4, 1, 7], D86[9, 0, 2, 8], D86[5, 1, 3, 9]}; n the rgument proees similrly s in the proof for Lemm
14 Lemm 23. For every integer x 1 there exists (K 5x, D99)-esign. Proof. For x = 1, onsier the igrph D99[0, 2,, 1]. It is esy to hek tht we hve the 1-rottionl irete ρ-leling of D99, n thus (K 5, D99)-esign exists. For x = 2, We hve the following (K 10, D99)-esign: {D99[1, 0, 4, 5], D99[2, 0, 5, 6], D99[3, 0, 6, 4], D99[0, 7, 4, 1], D99[0, 8, 5, 2], D99[0, 9, 6, 3], D99[7, 4, 1, 5], D99[8, 5, 2, 6], D99[9, 6, 3, 4], D99[4, 8, 2, 7], D99[5, 9, 3, 8], D99[6, 7, 1, 9], D99[8, 1, 7, 5], D99[9, 2, 8, 6], D99[7, 3, 9, 4], D99[2, 1, 4, 9], D99[3, 2, 5, 7], D99[1, 3, 6, 8]}. For x > 2, we require (K 5,10, D99)-esign, whih is shown to exist in the proof for Lemm 11. Cse 1: x = 2k + 1 for some integer k 2. We write K 10k+5 = K 5 k i=1 K 10. On the opy of K 5, we ple (K 5, D9)- esign. On eh of the k opies of K 10, we ple (K 10, D99)-esign. The remining rs form r-isjoint opies of K 5,10 n K 10,10, whih n e eompose into opies of K 5,10. On eh of these opies of K 5,10, we ple (K 5,10, D99)-esign. Cse 2: x = 2k for some integer k 2. We write K 10k = k i=1 K 10. On eh of the k opies of K 10, we ple (K 10, D99)-esign. The remining rs form r-isjoint opies of K 10,10, eh of whih n e eompose into opies of K5,10. On eh of these opies of K5,10, we ple (K5,10, D99)-esign. Lemm 24. For every integer x 1 there exists (K 5x, D100)-esign. Proof. Let x 1 e n integer. The following is (K 5x, D100)-esign: {D100[0, 1, 2, ]} {D100[0, 1 + 5(i 1), 2 + 5(i 1), 2]: 2 i x}. Thus, we hve shown tht Theorem 1 hols. 4 Aknowlegments The uthors re grteful to Peter Ams for help in fining some of the smll esigns neee for this work. This reserh is supporte y grnt numer A from the Division of Mthemtil Sienes t the Ntionl Siene Fountion. This work ws one while ll ut the first, seon, n fifth uthors were prtiipnts in REU Site: Mthemtis Reserh Experiene for Pre-servie n for In-servie Tehers t Illinois Stte University. 14
15 Referenes [1] S. R. Allen, J. Bolt, R. C. Bunge, S. Burton, n S. I. El-Znti, On the Inex 2 Spetr of Biprtite Sugrphs of 2 K 4, Bull. Inst. Comin. Appl., to pper. [2] J. C. Bermon, An pplition of the solution of Kirkmn s shoolgirl prolem: the eomposition of the symmetri oriente omplete grph into 3-iruits, Disrete Mth. 8 (1974) [3] J. C. Bermon n J. Shönheim, G-eomposition of K n, where G hs four verties or less, Disrete Mth. 19 (1977), [4] G. S. Bloom n D. F. Hsu, On greful irete grphs, SIAM J. Algeri Disrete Methos 6 (1985), [5] D. Brynt, S. Herke, B. Menhut, n W. Wnnsit, Deompositions of omplete 3-uniform hypergrphs into smll 3-uniform hypergrphs, Austrlsin J. of Comin. 60 (2014), [6] R. C. Bunge, S. I. El-Znti, J. Klister, D. Roerts, n C. Ruell, On orere irete ρ-lelings of iprtite igrphs n yli igrph eompositions, J. Comin. Mth. Comin. Comput., to pper. [7] F. Hrry, W. Wllis, n K. Heinrih, Deompositions of omplete symmetri igrphs into the four oriente qurilterls, Comintoril Mthemtis, Pro. Internt. Conf. Comintoril Theory, Cnerr, 1977, in Leture Notes in Mth., 686 (es. D. A. Holton n J. Seerry), Springer-Verlg, 1978, pp [8] A. Hrtmn n E. Menelsohn, The Lst of the Triple Systems, Ars Comin. 22 (1986), [9] S. H. Y. Hung n N. S. Menelsohn, Direte triple systems, J. Comintoril Theory Set. A 14 (1973), [10] G. Kpln, A. Lev, n Y. Roitty, On grph leling prolems n regulr eompositions of omplete grphs, Ars Comin. 92 (2009), [11] N. S. Menelsohn, A nturl generliztion of Steiner triple systems, Computers in numer theory, Pro. Si. Res. Counil Atls Sympos. No. 2, Oxfor, 1969, Aemi Press, Lonon (1971) [12] M. Meszk n Z. Skupień, Deompositions of omplete multiigrph into non-hmiltonin pths, J. Grph Theory 51 (2006)
16 [13] R. C. Re n R. J. Wilson, An Atls of Grphs, Oxfor University Press, Oxfor, [14] A. Ros, On ertin vlutions of the verties of grph, in: Théorie es grphes, journées interntionles étues, Rome 1966 (Duno, Pris, 1967) [15] J. Shönheim, Prtition of the eges of the irete omplete grph into 4-yles, Disrete Mth. 11 (1975), [16] T. W. Shyu n C. Lin, Isomorphi Antiirete Pth Deompositions of Complete Symmetri Grphs, Ars Comin. 61 (2001),
Mid-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 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 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 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 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 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 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 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 informationNecessary 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 )
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
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 informationObstructions to chordal circular-arc graphs of small independence number
Ostrutions to horl irulr-r grphs of smll inepenene numer Mthew Frnis,1 Pvol Hell,2 Jurj Stho,3 Institute of Mth. Sienes, IV Cross Ro, Trmni, Chenni 600 113, Ini Shool of Comp. Siene, Simon Frser University,
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 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 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 informationAnswers and Solutions to (Some Even Numbered) Suggested Exercises in Chapter 11 of Grimaldi s Discrete and Combinatorial Mathematics
Answers n Solutions to (Some Even Numere) Suggeste Exercises in Chpter 11 o Grimli s Discrete n Comintoril Mthemtics Section 11.1 11.1.4. κ(g) = 2. Let V e = {v : v hs even numer o 1 s} n V o = {v : v
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 informationCS261: A Second Course in Algorithms Lecture #5: Minimum-Cost Bipartite Matching
CS261: A Seon Course in Algorithms Leture #5: Minimum-Cost Biprtite Mthing Tim Roughgren Jnury 19, 2016 1 Preliminries Figure 1: Exmple of iprtite grph. The eges {, } n {, } onstitute mthing. Lst leture
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 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 informationDirected acyclic graphs with the unique dipath property
Direte yli grphs with the unique ipth property Jen-Clue Bermon, Mihel Cosnr, Stéphne érennes To ite this version: Jen-Clue Bermon, Mihel Cosnr, Stéphne érennes. Direte yli grphs with the unique ipth property.
More informationSection 4.4. Green s Theorem
The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higher-dimensionl nlogues) with the definite integrls
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 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 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 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 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 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 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 informationCSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4
Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones
More informationarxiv: v1 [cs.dm] 24 Jul 2017
Some lsses of grphs tht re not PCGs 1 rxiv:1707.07436v1 [s.dm] 24 Jul 2017 Pierluigi Biohi Angelo Monti Tizin Clmoneri Rossell Petreshi Computer Siene Deprtment, Spienz University of Rome, Itly pierluigi.iohi@gmil.om,
More informationLecture 4: Graph Theory and the Four-Color Theorem
CCS Disrete II Professor: Pri Brtlett Leture 4: Grph Theory n the Four-Color Theorem Week 4 UCSB 2015 Through the rest of this lss, we re going to refer frequently to things lle grphs! If you hen t seen
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 informationA Short Introduction to Self-similar Groups
A Short Introution to Self-similr Groups Murry Eler* Asi Pifi Mthemtis Newsletter Astrt. Self-similr groups re fsinting re of urrent reserh. Here we give short, n hopefully essile, introution to them.
More informationGeneralized Kronecker Product and Its Application
Vol. 1, No. 1 ISSN: 1916-9795 Generlize Kroneker Prout n Its Applition Xingxing Liu Shool of mthemtis n omputer Siene Ynn University Shnxi 716000, Chin E-mil: lxx6407@163.om Astrt In this pper, we promote
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 informationComputing all-terminal reliability of stochastic networks with Binary Decision Diagrams
Computing ll-terminl reliility of stohsti networks with Binry Deision Digrms Gry Hry 1, Corinne Luet 1, n Nikolos Limnios 2 1 LRIA, FRE 2733, 5 rue u Moulin Neuf 80000 AMIENS emil:(orinne.luet, gry.hry)@u-pirie.fr
More informationarxiv: v1 [cs.cg] 28 Apr 2009
Orienttion-Constrine Retngulr Lyouts Dvi Eppstein 1 n Elen Mumfor 2 1 Deprtment of Computer Siene, University of Cliforni, Irvine, USA 2 Deprtment of Mthemtis n Computer Siene, TU Einhoven, The Netherlns
More informationThe DOACROSS statement
The DOACROSS sttement Is prllel loop similr to DOALL, ut it llows prouer-onsumer type of synhroniztion. Synhroniztion is llowe from lower to higher itertions sine it is ssume tht lower itertions re selete
More information#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS
#A42 INTEGERS 11 (2011 ON THE CONDITIONED BINOMIAL COEFFICIENTS Liqun To Shool of Mthemtil Sienes, Luoyng Norml University, Luoyng, Chin lqto@lynuedun Reeived: 12/24/10, Revised: 5/11/11, Aepted: 5/16/11,
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 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 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 informationF / x everywhere in some domain containing R. Then, + ). (10.4.1)
0.4 Green's theorem in the plne Double integrls over plne region my be trnsforme into line integrls over the bounry of the region n onversely. This is of prtil interest beuse it my simplify the evlution
More informationThe vertex leafage of chordal graphs
The vertex lefge of horl grphs Steven Chplik, Jurj Stho b Deprtment of Physis n Computer Siene, Wilfri Lurier University, 75 University Ave. West, Wterloo, Ontrio N2L 3C5, Cn b DIMAP n Mthemtis Institute,
More informationfor all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx
Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion
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 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 informationVidyalankar S.E. Sem. III [CMPN] Discrete Structures Prelim Question Paper Solution
S.E. Sem. III [CMPN] Discrete Structures Prelim Question Pper Solution 1. () (i) Disjoint set wo sets re si to be isjoint if they hve no elements in common. Exmple : A = {0, 4, 7, 9} n B = {3, 17, 15}
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 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 informationNow we must transform the original model so we can use the new parameters. = S max. Recruits
MODEL FOR VARIABLE RECRUITMENT (ontinue) Alterntive Prmeteriztions of the pwner-reruit Moels We n write ny moel in numerous ifferent ut equivlent forms. Uner ertin irumstnes it is onvenient to work with
More informationNondeterministic Finite Automata
Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)
More informationImplication Graphs and Logic Testing
Implition Grphs n Logi Testing Vishwni D. Agrwl Jmes J. Dnher Professor Dept. of ECE, Auurn University Auurn, AL 36849 vgrwl@eng.uurn.eu www.eng.uurn.eu/~vgrwl Joint reserh with: K. K. Dve, ATI Reserh,
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 informationGraph Algorithms. Vertex set = { a,b,c,d } Edge set = { {a,c}, {b,c}, {c,d}, {b,d}} Figure 1: An example for a simple graph
Inin Institute of Informtion Tehnology Design n Mnufturing, Knheepurm, Chenni 00, Ini An Autonomous Institute uner MHRD, Govt of Ini http://www.iiitm..in COM 0T Design n Anlysis of Algorithms -Leture Notes
More informationEigenvectors and Eigenvalues
MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.
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 informationQUADRATIC EQUATION. Contents
QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,
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 informationSubsequence Automata with Default Transitions
Susequene Automt with Defult Trnsitions Philip Bille, Inge Li Gørtz, n Freerik Rye Skjoljensen Tehnil University of Denmrk {phi,inge,fskj}@tu.k Astrt. Let S e string of length n with hrters from n lphet
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 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 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 informationCIRCULAR COLOURING THE PLANE
CIRCULAR COLOURING THE PLANE MATT DEVOS, JAVAD EBRAHIMI, MOHAMMAD GHEBLEH, LUIS GODDYN, BOJAN MOHAR, AND REZA NASERASR Astrct. The unit distnce grph R is the grph with vertex set R 2 in which two vertices
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 informationMCH T 111 Handout Triangle Review Page 1 of 3
Hnout Tringle Review Pge of 3 In the stuy of sttis, it is importnt tht you e le to solve lgeri equtions n tringle prolems using trigonometry. The following is review of trigonometry sis. Right Tringle:
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 informationCo-ordinated s-convex Function in the First Sense with Some Hadamard-Type Inequalities
Int. J. Contemp. Mth. Sienes, Vol. 3, 008, no. 3, 557-567 Co-ordinted s-convex Funtion in the First Sense with Some Hdmrd-Type Inequlities Mohmmd Alomri nd Mslin Drus Shool o Mthemtil Sienes Fulty o Siene
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 informationThe Word Problem in Quandles
The Word Prolem in Qundles Benjmin Fish Advisor: Ren Levitt April 5, 2013 1 1 Introdution A word over n lger A is finite sequene of elements of A, prentheses, nd opertions of A defined reursively: Given
More informationIntroduction to Graphical Models
Introution to Grhil Moels Kenji Fukumizu The Institute of Sttistil Mthemtis Comuttionl Methoology in Sttistil Inferene II Introution n Review 2 Grhil Moels Rough Sketh Grhil moels Grh: G V E V: the set
More informationA Graphical Characterization of Lattice Conditional Independence Models
A Grphil Chrteriztion of Lttie Conitionl Inepenene Moels Steen A. Anersson, Dvi Mign, Mihel D. Perlmn *, n Christopher M. Triggs Inin University, University of Wshington, n University of Aukln Astrt Lttie
More informationOn the existence of a cherry-picking sequence
On the existene of herry-piking sequene Jnosh Döker, Simone Linz Deprtment of Computer Siene, University of Tüingen, Germny Deprtment of Computer Siene, University of Aukln, New Zeln Astrt Reently, the
More informationAutomata and Regular Languages
Chpter 9 Automt n Regulr Lnguges 9. Introution This hpter looks t mthemtil moels of omputtion n lnguges tht esrie them. The moel-lnguge reltionship hs multiple levels. We shll explore the simplest level,
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 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 informationLinear choosability of graphs
Liner hoosility of grphs Louis Esperet, Mikel Montssier, André Rspud To ite this version: Louis Esperet, Mikel Montssier, André Rspud. Liner hoosility of grphs. Stefn Felsner. 2005 Europen Conferene on
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 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 informationMinimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
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 informationNecessary 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 informationA CLASS OF GENERAL SUPERTREE METHODS FOR NESTED TAXA
A CLASS OF GENERAL SUPERTREE METHODS FOR NESTED TAXA PHILIP DANIEL AND CHARLES SEMPLE Astrt. Amlgmting smller evolutionry trees into single prent tree is n importnt tsk in evolutionry iology. Trditionlly,
More informationFirst Midterm Examination
24-25 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet
More informationGreedoid polynomial, chip-firing, and G-parking function for directed graphs. Connections in Discrete Mathematics
Greedoid polynomil, hip-firing, nd G-prking funtion for direted grphs Swee Hong Chn Cornell University Connetions in Disrete Mthemtis June 15, 2015 Motivtion Tutte polynomil [Tut54] is polynomil defined
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 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 informationAnti-Monotonic Overlap-Graph Support Measures
Anti-Monotoni Overlp-Grph Support Mesures Toon Clers (t.lers@tue.nl) Einhoven University of Tehnology Jn Rmon (jn.rmon@s.kuleuven.e) Ktholieke Universiteit Leuven Dries Vn Dyk (ries.vnyk@uhsselt.e) Hsselt
More information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
More informationGeodesics on Regular Polyhedra with Endpoints at the Vertices
Arnol Mth J (2016) 2:201 211 DOI 101007/s40598-016-0040-z RESEARCH CONTRIBUTION Geoesis on Regulr Polyher with Enpoints t the Verties Dmitry Fuhs 1 To Sergei Thnikov on the osion of his 60th irthy Reeive:
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 informationHyers-Ulam stability of Pielou logistic difference equation
vilble online t wwwisr-publitionsom/jns J Nonliner Si ppl, 0 (207, 35 322 Reserh rtile Journl Homepge: wwwtjnsom - wwwisr-publitionsom/jns Hyers-Ulm stbility of Pielou logisti differene eqution Soon-Mo
More informationMaximizing Maximal Angles for Plane Straight-Line Graphs
Mximizing Mximl Angles for Plne Stright-Line Grphs Oswin Aihholzer 1, Thoms Hkl 1, Mihel Hoffmnn 2, Clemens Huemer 3, Attil Pór 4, Frniso Sntos 5, Bettin Spekmnn 6, n Birgit Vogtenhuer 1 1 Institute for
More informationSection 2.1 Special Right Triangles
Se..1 Speil Rigt Tringles 49 Te --90 Tringle Setion.1 Speil Rigt Tringles Te --90 tringle (or just 0-60-90) is so nme euse of its ngle mesures. Te lengts of te sies, toug, ve very speifi pttern to tem
More informationGraph Theory. Dr. Saad El-Zanati, Faculty Mentor Ryan Bunge Graduate Assistant Illinois State University REU. Graph Theory
Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Grph Theory Dniel Gibson, Concordi University Jckelyn Ngel, Dominicn University Benjmin Stnley, New Mexico Stte University Allison
More informationOn the Construction of the Inclusion Boundary Neighbourhood for Markov Equivalence Classes of Bayesian Network Structures
On te Constrution of te Inlusion Bounry Neigouroo for Mrkov Equivlene Clsses of Byesin Network Strutures Vinent Auvry Eletril Engineering n Computer Siene Dept. University of Liège uvry@montefiore.ulg..e
More informationGraph width-parameters and algorithms
Grph width-prmeters nd lgorithms Jisu Jeong (KAIST) joint work with Sigve Hortemo Sæther nd Jn Arne Telle (University of Bergen) 2015 KMS Annul Meeting 2015.10.24. YONSEI UNIVERSITY Grph width-prmeters
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 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 informationAPPENDIX. Precalculus Review D.1. Real Numbers and the Real Number Line
APPENDIX D Preclculus Review APPENDIX D.1 Rel Numers n the Rel Numer Line Rel Numers n the Rel Numer Line Orer n Inequlities Asolute Vlue n Distnce Rel Numers n the Rel Numer Line Rel numers cn e represente
More information