Research Article Cayley Graphs of Order 27p Are Hamiltonian

Size: px
Start display at page:

Download "Research Article Cayley Graphs of Order 27p Are Hamiltonian"

Transcription

1 Interntionl Journl of Comintorics Volume 2011, Article ID , 16 pges doi: /2011/ Reserch Article Cyley Grphs of Order 27p Are Hmiltonin Erhim Ghderpour nd Dve Witte Morris Deprtment of Mthemtics nd Computer Science, University of Lethridge, Leth-Bridge, AB, Cnd T1K 3M4 Correspondence should e ddressed to Dve Witte Morris, dve.morris@uleth.c Received 22 Jnury 2011; Accepted 18 April 2011 Acdemic Editor: Ci Heng Li Copyright q 2011 E. Ghderpour nd D. W. Morris. This is n open ccess rticle distriuted under the Cretive Commons Attriution License, which permits unrestricted use, distriution, nd reproduction in ny medium, provided the originl work is properly cited. Suppose tht G is finite group, such tht G 27p, wherep is prime. We show tht if S is ny generting set of G, then there is Hmiltonin cycle in the corresponding Cyley grph Cy G; S. 1. Introduction Theorem 1.1. If G 27p, wherep is prime, then every connected Cyley grph on G hs Hmiltonin cycle. Comining this with results in 1 3 estlishes tht Every Cyley grph on G hs hmiltonin cycle if G kp, where p is prime, 1 k<32, nd k / The reminder of the pper provides proof of the theorem. Here is n outline. Section 2 reclls known results on hmiltonin cycles in Cyley grphs; Section 3 presents the proof under the ssumption tht the Sylow p-sugroup of G is norml; Section 4 presents the proof under the ssumption tht the Sylow p-sugroups of G re not norml. 2. Preliminries: Known Results on Hmiltonin Cycles in Cyley Grphs For convenience, we record some known results tht provide hmiltonin cycles in vrious Cyley grphs, fter fixing some nottion.

2 2 Interntionl Journl of Comintorics Nottion 1 see 4, Sections 1.1 nd 5.1. For ny group G, we use the following nottion: 1 G denotes the commuttor sugroup G, G of G, 2 Z G denotes the center of G, 3 Φ G denotes the Frttini sugroup of G. For, G, weuse to denote the conjugte 1. Nottion 2. If s 1,s 2,...,s n is ny sequence, we use s 1,s 2,...,s n # to denote the sequence s 1,s 2,...,s n 1 tht is otined y deleting the lst term. Theorem 2.1 Mrušič, Durnerger, Keting-Witte 5. If G is cyclic group of prime-power order, then every connected Cyley grph on G hs hmiltonin cycle. Lemm 2.2 see 3, Lemm Let S generte the finite group G, nd let s S.If i s G, ii Cy G/ s ; S hs hmiltonin cycle, nd iii either 1 s Z G,or 2 s is prime, then Cy G; S hs hmiltonin cycle. Lemm 2.3 see 1, Lemm 2.7. Let S generte the finite group G, nd let s S. If i s G, ii s is divisor of pq,wherep nd q re distinct primes, iii s p Z G, iv G/ s is divisile y q, nd v Cy G/ s ; S hs hmiltonin cycle, then there is hmiltonin cycle in Cy G; S. The following results re well known nd esy to prove. Lemm 2.4 Fctor Group Lemm. Suppose tht i S is generting set of G, ii N is cyclic, norml sugroup of G, iii s 1 N,...,s n N is hmiltonin cycle in Cy G/N; S, nd iv the product s 1 s 2 s n genertes N. Then s 1,...,s n N is hmiltonin cycle in Cy G; S. Corollry 2.5. Suppose tht i S is generting set of G,

3 Interntionl Journl of Comintorics 3 ii N is norml sugroup of G, such tht N is prime, iii s t modn for some s, t S S 1 with s / t, nd iv there is hmiltonin cycle in Cy G/N; S tht uses t lest one edge lelled s. Then there is hmiltonin cycle in Cy G; S. Definition 2.6. If H is ny sugroup of G, then H \Cy G; S denotes the multigrph in which i the vertices re the right cosets of H, nd ii there is n edge joining Hg 1 nd Hg 2 for ech s S S 1, such tht g 1 s Hg 2. Thus, if there re two different elements s 1 nd s 2 of S S 1, such tht g 1 s 1 nd g 1 s 2 re oth in Hg 2, then the vertices Hg 1 nd Hg 2 re joined y doule edge. Lemm 2.7 see 3, Corollry 2.9. Suppose tht i S is generting set of G, ii H is sugroup of G, such tht H is prime, iii the quotient multigrph H \ Cy G; S hs hmiltonin cycle C, nd iv C uses some doule-edge of H \ Cy G; S. Then there is hmiltonin cycle in Cy G; S. Theorem 2.8 see 6, Corollry 3.3. Suppose tht i S is generting set of G, ii N is norml p-sugroup of G, nd iii st 1 N, for ll s, t S. Then Cy G; S hs hmiltonin cycle. Remrk 2.9. In the proof of our min result, we my ssume p 5, for otherwise either i G 54 is of the form 18q, where q is prime, nd so 3, Propostion 9.1 pplies, or ii G 3 4 is prime power, nd so the min theorem of 7 pplies. 3. Assume the Sylow p-sugroup of G Is Norml Nottion 3. Let i G e group of order 27p, where p is prime, nd p 5 see Remrk 2.9, ii S e miniml generting set for G, iii P Z p e Sylow p-sugroup of G, iv w e genertor of P,nd v Q e Sylow 3-sugroup of G.

4 4 Interntionl Journl of Comintorics Assumption 3.1. In this section, we ssume tht P is norml sugroup of G. Therefore G is semidirect product: G Q P. 3.1 We my ssume tht G is not cyclic of prime order for otherwise Theorem 2.1 pplies.this implies tht Q is nonelin nd cts nontrivilly on P;so G Q P is cyclic of order 3p. 3.2 Nottion 4. Since Q is 3-group nd cts nontrivilly on P Z p, we must hve p 1 mod 3. Thus, one my choose r Z, such tht r 3 1 ( mod p ), ut r / 1 ( mod p ). 3.3 Dividing r 3 1yr 1, we see tht r 2 r 1 0 ( mod p ) A Lemm Tht Applies to Both of the Possile Sylow 3-Sugroups There re only 2 nonelin groups of order 27, nd we will consider them s seprte cses, ut, first, we cover some common ground. Note Since Q is nonelin group of order 27, nd G Q P Q Z p, it is esy to see tht Q Φ Q Z Q Z G Φ G. 3.5 Lemm 3.2. Assume tht i s S S 1 Q, such tht s does not centrlize P, nd ii c C Q P \ Φ Q. Then we my ssume tht S is either {s, cw} or {s, c 2 w} or {s, scw} or {s, sc 2 w}. Proof. Since G/P Q is 2-generted group of prime-power order, there must e n element of S, such tht {s, } genertes G/P. We my write s i c j zw k, with 0 i 2, 1 j 2, z Z Q, nd 0 k<p. 3.6 Note the following. i By replcing with its inverse if necessry, we my ssume i {0, 1}.

5 Interntionl Journl of Comintorics 5 Thus, ii By pplying n utomorphism of G tht fixes s nd mps c to cz j, we my ssume tht z is trivil since cz j j c j z j2 c j z. iii By replcing w with w k if k / 0, we my ssume k {0, 1}. s i c j w k with i, k {0, 1}, nd j {1, 2}. 3.7 Cse 1 Assume generting sets. k 1. Then s, G, ndsos {s, }. This yields the four listed Cse 2 Assume k 0. Then s, Q, nd there must e third element of S,with/ Q; fter replcing w with n pproprite power, we my write tw with t Q. We must hve t s, Φ Q, for otherwise s, G which contrdicts the minimlity of S. Therefore t s i z with 0 i 2, nd z Φ Q Z G. 3.8 We my ssume the following. i i / 0, for otherwise z w S Z G P ;solemm 2.3 pplies. ii i 1, y replcing with its inverse if necessry. iii z / e, for otherwise s nd provide doule edge in Cy G/P; S ;socorollry 2.5 pplies. Then s 1 z w genertes Z G P. Consider the hmiltonin cycles ( 1,s 2) 3, ( ( 1,s 2) 3 #, ), ( ( 1,s 2) 3 ##, 2) 3.9 in Cy G/ z, w ; S. Letting z 1 s 2 3 z, we see tht their endpoints in G re resp. z, z ( ) s 1 z z w, z ( ) s ( ) s 1 s 1 z ( z ) 2 w s w The finl two endpoints oth hve nontrivil projection to P since s, eing 3-element, cnnot invert w, nd t lest one of these two endpoints lso hs nontrivil projection to Z G. Such n endpoint genertes Z G P z, w, nd so the Fctor Group Lemm 2.4 provides hmiltonin cycle in Cy G; S Sylow 3-Sugroup of Exponent 3 Lemm 3.3. Assume tht Q is of exponent 3; so Q x, y, z x 3 y 3 z 3 e, [ x, y ] z, x, z [ y, z ] e. 3.11

6 6 Interntionl Journl of Comintorics Then one my ssume the following: 1 w x w r,uty nd z centrlize P, nd 2 either S {x, yw}, or S {x, xyw}. Proof. 1 Since Q cts nontrivilly on P, nd Aut P is cyclic, ut Q/Φ Q is not cyclic, there must e elements nd of Q \ Φ Q, such tht centrlizes P,ut does not. And z must centrlize P, ecuse it is in Q. By pplying n utomorphism of Q, we my ssume y nd x. Furthermore, we my ssume w x w r y replcing x with its inverse if necessry. 2 S must contin n element tht does not centrlize P; so we my ssume x S.By pplying Lemm 3.2 with s x nd c y, we see tht we my ssume tht S is { } { } x, yw or x, y 2 w or { x, xyw } { } or x, xy 2 w But there is n utomorphism of G tht fixes x nd w nd sends y to y 2 ; so we need only consider two of these possiilities. Proposition 3.4. Assume, s usul, tht G 27p,wherep is prime, nd tht G hs norml Sylow p-sugroup. If the Sylow 3-sugroup Q is of exponent 3, then Cy G; S hs hmiltonin cycle. Proof. We write for the nturl homomorphism from G to G G/P. FromLemm 3.3 2, we see tht we need only consider two possiilities for S. Cse 1 Assume S {x, yw}. For x nd yw, we hve the following hmiltonin cycle in Cy G/P; S : e x x 2 x 2 y 1 y 2 z 2 z 2 xz 2 x 2 z 2 xyz x 2 yz 2 1 yz 2 yz xy xy 2 z 2 x 2 y 2 x 2 y 2 z 2 xy 2 x 2 y 2 z y 2 1 y 2 z y x 2 z z 1 e. x 2 yz 1 xyz 2 xz 1 xy 2 z 3.13 Its endpoint in G is x 2 ywx 2( yw ) 2 x 2 ywx 2 ywx ( yw ) 2 x 1 ywx 2 ywx ( yw ) 1 x 2 ( yw ) x 2 ywxy 2 w 2 x 2 ywx 2 ywxy 2 w 2 x 2 ywx 2 ywxy 2 w 1 x 2 yw 2.

7 Interntionl Journl of Comintorics 7 Since the wlk is hmiltonin cycle in G/P, we know tht this endpoint is in P w. So ll terms except powers of w must cncel. Thus, we need only clculte the contriution from ech ppernce of w in this expression. To do this, note tht if term w i is followed y net totl of j ppernces of x, then the term contriutes fctor of w irj to the product. So the endpoint in G is w r13 w 2r12 w r10 w r8 w 2r7 w r5 w r3 w r2 w Since r 3 1 modp, this simplifies to w r w 2 w r w r2 w 2r w r2 ww r2 w 2 w r 2 r r2 2r r 2 1 r 2 2 w r2 4r 1 w r2 r 1 w 3r w 0 w 3r w 3r Since p 3r, this endpoint genertes P; so the Fctor Group Lemm 2.4 provides hmiltonin cycle in Cy G; S. Cse 2 Assume S {x, xyw}. For x nd xyw, we hve the hmiltonin cycle ( (, 2) 3 #, ) in Cy G/P; S. Its endpoint in G is ( ( 2) ) 3 3 ( ( 1 x ( xyw ) ) ) 2 3 ( ) 3 ( ( 1x xyw x(x 2 y 2 w r 1)) 3 ( w 1 y 1 x 1) ) 3 x ( ( y 2 w r 1) 3 (w 1 y 1)) 3 (w ( 3 r 1 w 1 y 1)) 3 (y 1 w 3r 2) 3 w 3 3r Since we re free to choose r to e either of the two primitive cue roots of 1 in Z p,ndthe eqution 3r 2 0 hs only one solution in Z p, we my ssume tht r hs een selected to mke the exponent nonzero. Then the Fctor Group Lemm 2.4 provides hmiltonin cycle in Cy G; S Sylow 3-Sugroup of Exponent 9 Lemm 3.5. Assume tht Q is of exponent 9; so Q x, y x 9 y 3 e, [ x, y ] x

8 8 Interntionl Journl of Comintorics There re two possiilities for G, depending on whether C Q P contins n element of order 9 or not. 1 Assume tht C Q P does not contin n element of order 9. Then we my ssume tht y centrlizes P,utw x w r. Furthermore, we my ssume tht: S {x, yw}, or S {x, xyw}. 2 Assume tht C Q P contins n element of order 9. Then we my ssume x centrlizes P, ut w y w r. Furthermore, we my ssume tht: S {xw, y}, S {xyw, y}, c S {xy, xw}, or d S {xy, x 2 yw}. Proof. 1 Since x hs order 9, we know tht it does not centrlize P. Butx 3 must centrlize P since x 3 is in G. Therefore, we my ssume w x x r y replcing x with its inverse if necessry. Also,sinceQ/C Q P must e cyclic ecuse Aut P is cyclic, utc G P does not contin n element of order 9, we see tht C Q P contins every element of order 3; so y must e in C Q P. Since S must contin n element tht does not centrlize P, we my ssume x S. By pplying Lemm 3.2 with s x nd c y, we see tht we my ssume tht S is: { } { } x, yw or x, y 2 w or { x, xyw } { } or x, xy 2 w The second generting set need not e considered, ecuse y 2 w 1 yw 1 yw ;soitis equivlent to the first. Also, the fourth generting set cn e converted into the third, since there is n utomorphism of G tht fixes y, ut tkes x to xyw nd w to w 1. 2 We my ssume x C Q P ;soc Q P x. We know tht S must contin n element s tht does not centrlize P, nd there re two possiilities: either I s hs order 3, or II s hs order 9. We consider these two possiilities s seprte cses. Cse I Assume tht s hs order 3. We my ssume s y. Letting c x, weseefrom Lemm 3.2 tht we my ssume S is either { } { } y, xw or y, x 2 w or { y, yxw } { } or y, yx 2 w The second nd fourth generting sets need not e considered, ecuse there is n utomorphism of G tht fixes y nd w, ut tkes x to x 2. Also, the third generting set my e replced with {y, xyw}, since there is n utomorphism of G tht fixes y nd w, ut tkes x to y 1 xy.

9 Interntionl Journl of Comintorics 9 Cse II Assume tht s hs order 9. We my ssume s xy. Letting c x, weseefrom Lemm 3.2 tht we my ssume tht S is either { } { } xy, xw or xy, x 2 w or { xy, xyxw } { } or xy, xyx 2 w The second generting set is equivlent to {xy, xw}, since the utomorphism of G tht sends x to x 4, y to x 3 y,ndw to w 1 mps it to {xy, xw 1 }. The third generting set is mpped to {xy, x 2 yw} y the utomorphism tht sends x to x x, y nd y to x, y 1 y. The fourth generting set need not e considered, ecuse xyx 2 w is n element of order 3 tht does not centrlize P, which puts it in the previous cse. Proposition 3.6. Assume, s usul, tht G 27p,wherep is prime, nd tht G hs norml Sylow p-sugroup. If the Sylow 3-sugroup Q is of exponent 9, then Cy G; S hs hmiltonin cycle. Proof. We will show tht, for n pproprite choice of nd in S S 1, the wlk ( 3, 1,, 1, 4, 2, 2,, 2,, 3,, 1, 1, 1, 2) 3.23 provides hmiltonin cycle in Cy G/P; S whose endpoint in G genertes P so the Fctor Group Lemm 2.4 pplies. We egin y verifying two situtions in which 3.23 is hmiltonin cycle. HC1 If 9, 3, nd 4 in G G/P, then we hve the hmiltonin cycle: e e HC2 If 9, 9, 7,nd 3 6 in G G/P, then we hve the hmiltonin cycle: e e. 3.25

10 10 Interntionl Journl of Comintorics To clculte the endpoint in G,fixr 1,r 2 Z p,with w w r 1, w w r 2, 3.26 nd write w 1, w 2, where, Q, w 1,w 2 P Note tht if n occurrence of w i in the product is followed y net totl of j 1 ppernces of nd net totl of j 2 ppernces of, then it contriutes fctor of w rj 1 1 rj 2 2 i to the product. A similr occurrence of w 1 i contriutes fctor of w rj1 1 rj 2 2 i to the product. Furthermore, since r 3 1 r3 2 1 modp, there is no hrm in reducing j 1 nd j 2 modulo 3. We will pply these considertions only in few prticulr situtions. E1 Assume w 1 e so Q nd. Then the endpoint of the pth in G is ( w 2 ) 1 ( w2 ) 1 4 ( w 2 ) 2 2 ( w 2 ) 2 ( w 2 ) 3 ( w 2 ) 1 ( w 2 ) 1 1 ( w 2 ) 2 3( w 1 2 1) ( w 1 2 1) 4( w 2 w 2 ) 2 ( w 2 ) ( w 2 ) 3 ( w 2 ) 1 ( w 1 2 1) 1( w w 1 2 1). By the ove considertions, this simplifies to w m 2, where m 1 r 2 1 r 2 r 1 r 2 r 1 r 2 2 r 1r 2 r 1 r 2 1 r 2 r 2 2 r 2 1 r 2 r 2 1 2r 1r 2 2r 1 r Note the following. If r 1 / 1ndr 2 1, then m simplifies to 6r 1, ecuse r 2 1 r modp in this cse. If r 1 / 1ndr 2 / 1, then m simplifies to 3r 1 r 2 1, ecuse r 2 1 r 1 1 r 2 2 r modp in this cse.

11 Interntionl Journl of Comintorics 11 E2 Assume w 2 e so Q nd. Then the endpoint of the pth in G is ( w 1 ) 3 1 ( w 1 ) 1 ( w 1 ) 4 2 ( w 1 ) 2 ( w1 ) 2 ( w1 ) 3 ( w1 ) 1 1 ( w 1 ) 1 2 ( w 1 w 1 w 1 ) 1 ( w 1 ) 1 ( w 1 w 1 w 1 w 1 ) 2 ( w w 1 1 1) ( w 1 w 1 ) ( w1 w 1 w 1 ) ( w 1 1 1) 1( w 1 1 1) By the ove considertions, this simplifies to w m 1, where m r 2 1 r 1 1 r 2 1 r 2 r 1 r 2 2 r2 2 r2 1 r2 2 r 1r 2 2 r 1 r 2 1 r2 1 r2 2 r 1r 2 2 r 2 r 2 1 r 2 r 1 r 2 r 1 r 2 1 r r 2 1 r2 2 3r 1r 2 2 r2 2 r2 1 r 2 r 1 r 2 r 2 r 1 1. Note the following. If r 1 1ndr 2 / 1, then m simplifies to 3 r 2 2, ecuse r 2 2 r modp in this cse. If r 1 / 1ndr 2 / 1, then m simplifies to r 1 r 2 2r 1 r 2 2, ecuse r 2 1 r 1 1 r 2 2 r modp in this cse. Now we provide hmiltonin cycle for ech of the generting sets listed in Lemm If C Q P hs exponent 3, nd S {x, yw}, welet x nd yw in HC1. In this cse, we hve w 1 e, r 1 r, ndr 2 1; so E1 tells us tht the endpoint in G is w 6r 2. 1 If C Q P hs exponent 3, nd S {x, xyw},welet x nd xyw 1 in HC2. In this cse, we hve w 1 e, r 1 r, ndr 2 r 1 r 2 ;so E1 tells us tht the endpoint in G is w m 2, where ( ) ( ) m 3r 1 r 2 1 3r r r 3 r 3 1 r 3 r 1 ( mod p ) If C Q P hs exponent 9, nd S {xw, y}, welet xw nd y in HC1. In this cse, we hve w 2 e, r 1 1, nd r 2 r; so E2 tells us tht the endpoint in G is w 3 r If C Q P hs exponent 9, nd S {xyw, y}, welet xyw nd y in HC1. In this cse, we hve w 2 e nd r 1 r 2 r; so E2 tells us tht the endpoint in G is w m 2, where ( ) m r 1 r 2 2r 1 r 2 2 r 2 2r r 2 r 2 r ( mod p ). 3.33

12 12 Interntionl Journl of Comintorics 2c If C Q P hs exponent 9, nd S {xy, xw},welet xw nd xy 1 in HC2. In this cse, we hve w 2 e, r 1 1, nd r 2 r 1 r 2 ;so E2 tells us tht the endpoint in G is w m 1, where ( ) m 3 r r r r 1 ( mod p ) d If C Q P hs exponent 9, nd S {xy, x 2 yw},welet xy nd x 2 yw in HC2. In this cse, we hve w 1 e nd r 1 r 2 r; so E1 tells us tht the endpoint in G is w m 2, where ( ) m 3r 1 r 2 1 3r r 1 3 r 2 r ( mod p ) In ll cses, there is t most one nonzero vlue of r modulo p for which the exponent of w i is 0. Since we re free to choose r to e either of the two primitive cue roots of 1 in Z p,we my ssume tht r hs een selected to mke the exponent nonzero. Then the Fctor Group Lemm 2.4 provides hmiltonin cycle in Cy G; S. 4. Assume the Sylow p-sugroups of G Are Not Norml Lemm 4.1. Assume tht i G 27p, wherep is n odd prime, nd ii the Sylow p-sugroups of G re not norml. Then p 13, nd G Z 13 Z 3 3, where genertor w of Z 13 cts on Z 3 3 vi multipliction on the right y the mtrix W Furthermore, we my ssume tht S is of the form { } w i,w j v, 4.2 where v 1, 0, 0 Z 3 3, nd ( i, j ) { 1, 0, 2, 0, 1, 2, 1, 3, 1, 5, 1, 6, 2, 5 }. 4.3 Proof. Let P e Sylow p-sugroup of G,ndletQ e Sylow 3-sugroup of G. Since no odd prime divides 3 1or3 2 1, nd 13 is the only odd prime tht divides 3 3 1, Sylow s Theorem 8, Theorem 15.7, pge 230 implies tht p 13, nd tht N G P P;soG must hve norml

13 Interntionl Journl of Comintorics 13 p-complement 4, Theorem ; thtis,g P Q. Since P must ct nontrivilly on Q since P is not norml, we know tht it must ct nontrivilly on Q/Φ Q 4, Theorem 5.3.5, pge 180. However, P cnnot ct nontrivilly on n elementry elin group of order 3 or 3 2, ecuse P 13 is not divisor of 3 1or Therefore, we must hve Q/Φ Q 3 3 ; so Q must e elementry elin nd the ction of P is irreducile. Let W e the mtrix representing the ction of w on Z 3 3 with respect to some sis tht will e specified lter. In the polynomil ring Z 3 X, we hve the fctoriztion: X 13 1 ( ) ( ) ( ) ( ) X 1 X 3 X 1 X 3 X 2 1 X 3 X 2 X 1 X 3 X 2 X Since w 13 e, the miniml polynomil of W must e one of the fctors on the right-hnd side. By replcing w with n pproprite power, we my ssume tht it is the first fctor. Then, choosing ny nonzero v Z 3 3, the mtrix representtion of w with respect to the sis {v, v w,v w2 } is W the Rtionl Cnonicl Form. Now, let ζ e primitive 13th root of unity in the finite field GF 27. Then ny Glois utomorphism of GF 27 over GF 3 must rise ζ to power. Since the sugroup of order 3 in Z 13 is generted y the numer 3, we conclude tht the orit of ζ under the Glois group is {ζ, ζ 3,ζ 9 }. These must e the 3 roots of one of the irreducile fctors on the right-hnd side of 4.4. Thus, for ny k Z 13, the mtrices W k, W 3k,ndW 9k ll hve the sme miniml polynomil; so they re conjugte under GL 3 3. Thtis, W, W 3,W 9 powers of W in the sme row of the following rry re conjugte under GL 3 3 : W 2,W 5,W 6 W 4,W 12,W 10 W 7,W 8,W There is n element of S tht genertes G/Q P. Then hs order p; so, replcing it y conjugte, we my ssume P w, ndso w i for some i Z 13.From 4.5, we see tht we my ssume i {1, 2} perhps fter replcing y its inverse. Now let e the second element of S; so we my ssume w j v for some j. We my ssume 0 j 6 y replcing with its inverse, if necessry. We my lso ssume j / i, for otherwise S Q,ndsoTheorem 2.8 pplies. If j 0, then i, j is either 1, 0 or 2, 0, oth of which pper in the list; henceforth, let us ssume j / 0. Cse 1 Assume i 1. Since j / i, we must hve j {2, 3, 4, 5, 6}. Note tht since W 3 is conjugte to W under GL 3 3 since they re in the sme row of 4.5, we know tht the pir w, w 4 is isomorphic to the pir w 3, w 3 4 w 3,w 1.By replcing with its inverse, nd then interchnging nd, this is trnsformed to w, w 3. So we my ssume j / 4. Cse 2 Assume i 2. We my ssume tht W j is in the second or fourth row of the tle for otherwise we could interchnge with to enter the previous cse. So j {2, 5, 6}. Since

14 14 Interntionl Journl of Comintorics j / i, this implies j {5, 6}. However, since W 5 is conjugte to W 2 since they re in the sme row of 4.5, nd we hve w 2 3 w 6 nd w 5 3 w 2, we see tht the pir w 2,w 6 is isomorphic to w 2,w 5. So we my ssume j / 6. Proposition 4.2. If G 27p, wherep is prime, nd the Sylow p-sugroups of G re not norml, then Cy G; S hs hmiltonin cycle. Proof. From Lemm 4.1 nd Remrk 2.9, we my ssume G Z 13 Z 3 3. For ech of the generting sets listed in Lemm 4.1, we provide n explicit hmiltonin cycle in the quotient multigrph P \ Cy G; S tht uses t lest one doule edge. So Lemm 2.7 pplies. To sve spce, we use i 1 i 2 i 3 to denote the vertex P i 1,i 2,i 3. i, j 1, 0 w, 1 w 12, 1, 0, 0, nd 1 1, 0, 0 Doule edge: with 1 nd : i, j 2, 0 w 2, 1 w 11, 1, 0, 0, nd 1 1, 0, 0 Doule edge: with nd 1 : i, j 1, 2 w, 1 w 12, w 2 1, 0, 0, nd 1 w 11 1, 1, 1 Doule edge: with nd :

15 Interntionl Journl of Comintorics 15 i, j 1, 3 w, 1 w 12, w 3 1, 0, 0, nd 1 w 10 0, 1, 1 Doule edge: with nd : i, j 1, 5 w, 1 w 12, w 5 1, 0, 0, nd 1 w 8 1, 0, 1 Doule edge: with nd 1 : i, j 1, 6 w, 1 w 12, w 6 1, 0, 0, nd 1 w 7 1, 1, 1 Doule edge: with 1 nd : i, j 2, 5 w 2, 1 w 11, w 5 1, 0, 0, nd 1 w 8 1, 0, 1 Doule edge: with 1 nd :

16 16 Interntionl Journl of Comintorics Acknowledgments This work ws prtilly supported y reserch grnts from the Nturl Sciences nd Engineering Reserch Council of Cnd. References 1 S. J. Currn, D. W. Morris, nd J. Morris, Hmiltonin cycles in Cyley grphs of order 16p, Preprint. 2 E. Ghderpour nd D. W. Morris, Cyley grphs of order 30p re hmiltonin, Preprint. 3 K. Kutnr, D. Mrušič, J. Morris, D. W. Morris, nd P. Šprl, Hmiltonin cycles in Cyley grphs whose order hs few prime fctors, Ars Mthemtic Contemporne. In press. 4 D. Gorenstein, Finite Groups, Chelse, New York, NY, USA, K. Keting nd D. Witte, Hmilton cycles in Cyley grphs with cyclic commuttor sugroup, Annls of Discrete Mthemtics, vol. 27, pp , D. W. Morris, 2-generted Cyley digrphs on nilpotent groups hve hmiltonin pths, Preprint. 7 D. Witte, Cyley digrphs of prime-power order re hmiltonin, Journl of Comintoril Theory, Series B, vol. 40, no. 1, pp , T. W. Judson, Astrct Alger, Virgini Commonwelth University, Richmond, V, USA, 2009.

17 Advnces in Opertions Reserch Advnces in Decision Sciences Mthemticl Prolems in Engineering Journl of Alger Proility nd Sttistics The Scientific World Journl Interntionl Journl of Differentil Equtions Sumit your mnuscripts t Interntionl Journl of Advnces in Comintorics Mthemticl Physics Journl of Complex Anlysis Interntionl Journl of Mthemtics nd Mthemticl Sciences Journl of Stochstic Anlysis Astrct nd Applied Anlysis Interntionl Journl of Mthemtics Discrete Dynmics in Nture nd Society Journl of Journl of Discrete Mthemtics Journl of Applied Mthemtics Journl of Function Spces Optimiztion

Research Article On Cayley Digraphs That Do Not Have Hamiltonian Paths

Research Article On Cayley Digraphs That Do Not Have Hamiltonian Paths Hindwi Pulishing Corportion Interntionl Journl of Comintorics Volume 2013, Article ID 725809, 7 pges http://dx.doi.org/10.1155/2013/725809 Reserch Article On Cyley Digrphs Tht Do Not Hve Hmiltonin Pths

More information

Research Article Fejér and Hermite-Hadamard Type Inequalities for Harmonically Convex Functions

Research Article Fejér and Hermite-Hadamard Type Inequalities for Harmonically Convex Functions Hindwi Pulishing Corportion Journl of Applied Mthemtics Volume 4, Article ID 38686, 6 pges http://dx.doi.org/.55/4/38686 Reserch Article Fejér nd Hermite-Hdmrd Type Inequlities for Hrmoniclly Convex Functions

More information

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS PETE L CLARK Circ 1870, Zolotrev observed tht the Legendre symbol ( p ) cn be interpreted s the sign of multipliction by viewed s permuttion of the set Z/pZ

More information

Research Article The Group Involutory Matrix of the Combinations of Two Idempotent Matrices

Research Article The Group Involutory Matrix of the Combinations of Two Idempotent Matrices Hindwi Pulishing Corportion Journl of Applied Mthemtics Volume 2012, Article ID 504650, 17 pges doi:10.1155/2012/504650 Reserch Article The Group Involutory Mtrix of the Comintions of Two Idempotent Mtrices

More information

The Modified Heinz s Inequality

The Modified Heinz s Inequality Journl of Applied Mthemtics nd Physics, 03,, 65-70 Pulished Online Novemer 03 (http://wwwscirporg/journl/jmp) http://dxdoiorg/0436/jmp03500 The Modified Heinz s Inequlity Tkshi Yoshino Mthemticl Institute,

More information

Hamiltonian Cycle in Complete Multipartite Graphs

Hamiltonian Cycle in Complete Multipartite Graphs Annls of Pure nd Applied Mthemtics Vol 13, No 2, 2017, 223-228 ISSN: 2279-087X (P), 2279-0888(online) Pulished on 18 April 2017 wwwreserchmthsciorg DOI: http://dxdoiorg/1022457/pmv13n28 Annls of Hmiltonin

More information

Free groups, Lecture 2, part 1

Free groups, Lecture 2, part 1 Free groups, Lecture 2, prt 1 Olg Khrlmpovich NYC, Sep. 2 1 / 22 Theorem Every sugroup H F of free group F is free. Given finite numer of genertors of H we cn compute its sis. 2 / 22 Schreir s grph The

More information

Torsion in Groups of Integral Triangles

Torsion in Groups of Integral Triangles Advnces in Pure Mthemtics, 01,, 116-10 http://dxdoiorg/1046/pm011015 Pulished Online Jnury 01 (http://wwwscirporg/journl/pm) Torsion in Groups of Integrl Tringles Will Murry Deprtment of Mthemtics nd Sttistics,

More information

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.

More information

CIRCULAR COLOURING THE PLANE

CIRCULAR 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 information

Coalgebra, Lecture 15: Equations for Deterministic Automata

Coalgebra, 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 information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey 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 information

arxiv: v1 [math.ra] 1 Nov 2014

arxiv: v1 [math.ra] 1 Nov 2014 CLASSIFICATION OF COMPLEX CYCLIC LEIBNIZ ALGEBRAS DANIEL SCOFIELD AND S MCKAY SULLIVAN rxiv:14110170v1 [mthra] 1 Nov 2014 Abstrct Since Leibniz lgebrs were introduced by Lody s generliztion of Lie lgebrs,

More information

Bases for Vector Spaces

Bases 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 information

September 13 Homework Solutions

September 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 information

p-adic Egyptian Fractions

p-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 information

ON THE NILPOTENCY INDEX OF THE RADICAL OF A GROUP ALGEBRA. XI

ON THE NILPOTENCY INDEX OF THE RADICAL OF A GROUP ALGEBRA. XI Mth. J. Okym Univ. 44(2002), 51 56 ON THE NILPOTENCY INDEX OF THE RADICAL OF A GROUP ALGEBRA. XI Koru MOTOSE Let t(g) be the nilpotency index of the rdicl J(KG) of group lgebr KG of finite p-solvble group

More information

Necessary and sufficient conditions for some two variable orthogonal designs in order 44

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 information

Surface maps into free groups

Surface maps into free groups Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The

More information

First Midterm Examination

First Midterm Examination Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does

More information

On the Hanna Neumann Conjecture

On the Hanna Neumann Conjecture On the Hnn Neumnn Conjecture Toshiki Jitsukw Bill Khn Alexei G. Mysnikov Astrct The Hnn Neumnn conjecture sttes tht if F is free group, then for ll nontrivil finitely generted sugroups H, K F, rnk(h K)

More information

Section 4: Integration ECO4112F 2011

Section 4: Integration ECO4112F 2011 Reding: Ching Chpter Section : Integrtion ECOF Note: These notes do not fully cover the mteril in Ching, ut re ment to supplement your reding in Ching. Thus fr the optimistion you hve covered hs een sttic

More information

Research Article Moment Inequalities and Complete Moment Convergence

Research Article Moment Inequalities and Complete Moment Convergence Hindwi Publishing Corportion Journl of Inequlities nd Applictions Volume 2009, Article ID 271265, 14 pges doi:10.1155/2009/271265 Reserch Article Moment Inequlities nd Complete Moment Convergence Soo Hk

More information

Results on Planar Near Rings

Results on Planar Near Rings Interntionl Mthemticl Forum, Vol. 9, 2014, no. 23, 1139-1147 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/10.12988/imf.2014.4593 Results on Plnr Ner Rings Edurd Domi Deprtment of Mthemtics, University

More information

Regular expressions, Finite Automata, transition graphs are all the same!!

Regular expressions, Finite Automata, transition graphs are all the same!! CSI 3104 /Winter 2011: Introduction to Forml Lnguges Chpter 7: Kleene s Theorem Chpter 7: Kleene s Theorem Regulr expressions, Finite Automt, trnsition grphs re ll the sme!! Dr. Neji Zgui CSI3104-W11 1

More information

QUADRATURE is an old-fashioned word that refers to

QUADRATURE is an old-fashioned word that refers to World Acdemy of Science Engineering nd Technology Interntionl Journl of Mthemticl nd Computtionl Sciences Vol:5 No:7 011 A New Qudrture Rule Derived from Spline Interpoltion with Error Anlysis Hdi Tghvfrd

More information

Parse trees, ambiguity, and Chomsky normal form

Parse 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 information

Homework Solution - Set 5 Due: Friday 10/03/08

Homework Solution - Set 5 Due: Friday 10/03/08 CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution - et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte non-finl.

More information

N 0 completions on partial matrices

N 0 completions on partial matrices N 0 completions on prtil mtrices C. Jordán C. Mendes Arújo Jun R. Torregros Instituto de Mtemátic Multidisciplinr / Centro de Mtemátic Universidd Politécnic de Vlenci / Universidde do Minho Cmino de Ver

More information

QUADRATIC RESIDUES MATH 372. FALL INSTRUCTOR: PROFESSOR AITKEN

QUADRATIC RESIDUES MATH 372. FALL INSTRUCTOR: PROFESSOR AITKEN QUADRATIC RESIDUES MATH 37 FALL 005 INSTRUCTOR: PROFESSOR AITKEN When is n integer sure modulo? When does udrtic eution hve roots modulo? These re the uestions tht will concern us in this hndout 1 The

More information

IN GAUSSIAN INTEGERS X 3 + Y 3 = Z 3 HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH

IN GAUSSIAN INTEGERS X 3 + Y 3 = Z 3 HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A2 IN GAUSSIAN INTEGERS X + Y = Z HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH Elis Lmpkis Lmpropoulou (Term), Kiprissi, T.K: 24500,

More information

Research Article Analytical Solution of the Fractional Fredholm Integrodifferential Equation Using the Fractional Residual Power Series Method

Research Article Analytical Solution of the Fractional Fredholm Integrodifferential Equation Using the Fractional Residual Power Series Method Hindwi Compleity Volume 7, Article ID 457589, 6 pges https://doi.org/.55/7/457589 Reserch Article Anlyticl Solution of the Frctionl Fredholm Integrodifferentil Eqution Using the Frctionl Residul Power

More information

Infinitely presented graphical small cancellation groups

Infinitely presented graphical small cancellation groups Infinitely presented grphicl smll cncelltion groups Dominik Gruer Université de Neuchâtel Stevens Group Theory Interntionl Weinr Decemer 10, 2015 Dominik Gruer (Neuchâtel) 2/30 Motivtion Grphicl smll cncelltion

More information

Things to Memorize: A Partial List. January 27, 2017

Things 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 information

List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.

List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1. Mth Anlysis CP WS 4.X- Section 4.-4.4 Review Complete ech question without the use of grphing clcultor.. Compre the mening of the words: roots, zeros nd fctors.. Determine whether - is root of 0. Show

More information

Research Article Harmonic Deformation of Planar Curves

Research Article Harmonic Deformation of Planar Curves Interntionl Journl of Mthemtics nd Mthemticl Sciences Volume, Article ID 9, pges doi:.55//9 Reserch Article Hrmonic Deformtion of Plnr Curves Eleutherius Symeonidis Mthemtisch-Geogrphische Fkultät, Ktholische

More information

MTH 505: Number Theory Spring 2017

MTH 505: Number Theory Spring 2017 MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c

More information

Research Article On Hermite-Hadamard Type Inequalities for Functions Whose Second Derivatives Absolute Values Are s-convex

Research Article On Hermite-Hadamard Type Inequalities for Functions Whose Second Derivatives Absolute Values Are s-convex ISRN Applied Mthemtics, Article ID 8958, 4 pges http://dx.doi.org/.55/4/8958 Reserch Article On Hermite-Hdmrd Type Inequlities for Functions Whose Second Derivtives Absolute Vlues Are s-convex Feixing

More information

set is not closed under matrix [ multiplication, ] and does not form a group.

set is not closed under matrix [ multiplication, ] and does not form a group. Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed

More information

A Critical Path Problem Using Intuitionistic. Trapezoidal Fuzzy Number

A Critical Path Problem Using Intuitionistic. Trapezoidal Fuzzy Number pplied Mthemticl Sciences, Vol. 8, 0, no. 5, 555-56 HIKRI Ltd, www.m-hikri.com http://dx.doi.org/0.988/ms.0.9 Criticl Pth Prolem Using Intuitionistic Trpezoidl Fuzzy Numer P. Jygowri Deprtment of Mthemtics

More information

On the degree of regularity of generalized van der Waerden triples

On the degree of regularity of generalized van der Waerden triples On the degree of regulrity of generlized vn der Werden triples Jcob Fox Msschusetts Institute of Technology, Cmbridge, MA 02139, USA Rdoš Rdoičić Deprtment of Mthemtics, Rutgers, The Stte University of

More information

1. Extend QR downwards to meet the x-axis at U(6, 0). y

1. Extend QR downwards to meet the x-axis at U(6, 0). y In the digrm, two stright lines re to be drwn through so tht the lines divide the figure OPQRST into pieces of equl re Find the sum of the slopes of the lines R(6, ) S(, ) T(, 0) Determine ll liner functions

More information

A New Solution to the Intersection Problem of Mendelsohn Triple Systems. Rachel Watson

A New Solution to the Intersection Problem of Mendelsohn Triple Systems. Rachel Watson A New Solution to the Intersection Prolem of Mendelsohn Triple Systems y Rchel Wtson A thesis sumitted to the Grdute Fculty of Auurn University in prtil fulfillment of the requirements for the Degree of

More information

Random subgroups of a free group

Random subgroups of a free group Rndom sugroups of free group Frédérique Bssino LIPN - Lortoire d Informtique de Pris Nord, Université Pris 13 - CNRS Joint work with Armndo Mrtino, Cyril Nicud, Enric Ventur et Pscl Weil LIX My, 2015 Introduction

More information

Solutions to Homework 6. (b) (This was not part of Exercise 1, but should have been) Let A and B be groups with A B. Then B A.

Solutions to Homework 6. (b) (This was not part of Exercise 1, but should have been) Let A and B be groups with A B. Then B A. MTH 4- Astrct Alger II S7 Solutions to Homework 6 Exercise () Let A, B n C e groups with A B n B C Show tht A C () (This ws not prt of Exercise, ut shoul hve een) Let A n B e groups with A B Then B A ()

More information

First Midterm Examination

First 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 information

Algebraic systems Semi groups and monoids Groups. Subgroups and homomorphisms Cosets Lagrange s theorem. Ring & Fields (Definitions and examples)

Algebraic systems Semi groups and monoids Groups. Subgroups and homomorphisms Cosets Lagrange s theorem. Ring & Fields (Definitions and examples) Prepred y Dr. A.R.VIJAYALAKSHMI Algeric systems Semi groups nd monoids Groups Sugroups nd homomorphms Cosets Lgrnge s theorem Ring & Fields (Definitions nd exmples Stndrd Nottions. N :Set of ll nturl numers.

More information

Talen en Automaten Test 1, Mon 7 th Dec, h45 17h30

Talen en Automaten Test 1, Mon 7 th Dec, h45 17h30 Tlen en Automten Test 1, Mon 7 th Dec, 2015 15h45 17h30 This test consists of four exercises over 5 pges. Explin your pproch, nd write your nswer to ech exercise on seprte pge. You cn score mximum of 100

More information

On a Method to Compute the Determinant of a 4 4 Matrix

On a Method to Compute the Determinant of a 4 4 Matrix Interntionl Journl of Scientific nd Innovtive Mthemticl Reserch (IJSIMR) Volume 5 Issue 4 2017 PP 1-5 ISSN 27-307X (Print) & ISSN 27-3142 (Online) DOI: http://dxdoiorg/1020431/27-31420504001 wwwrcjournlsorg

More information

REPRESENTATION THEORY OF PSL 2 (q)

REPRESENTATION THEORY OF PSL 2 (q) REPRESENTATION THEORY OF PSL (q) YAQIAO LI Following re notes from book [1]. The im is to show the qusirndomness of PSL (q), i.e., the group hs no low dimensionl representtion. 1. Representtion Theory

More information

Some circular summation formulas for theta functions

Some circular summation formulas for theta functions Ci et l. Boundr Vlue Prolems 013, 013:59 R E S E A R C H Open Access Some circulr summtion formuls for thet functions Yi Ci, Si Chen nd Qiu-Ming Luo * * Correspondence: luomth007@163.com Deprtment of Mthemtics,

More information

Research Article Some Normality Criteria of Meromorphic Functions

Research Article Some Normality Criteria of Meromorphic Functions Hindwi Publishing Corportion Journl of Inequlities nd Applictions Volume 2010, Article ID 926302, 10 pges doi:10.1155/2010/926302 Reserch Article Some Normlity Criteri of Meromorphic Functions Junfeng

More information

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A. 378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),

More information

Research Article Determinant Representations of Polynomial Sequences of Riordan Type

Research Article Determinant Representations of Polynomial Sequences of Riordan Type Discrete Mthemtics Volume 213, Article ID 734836, 6 pges http://dxdoiorg/11155/213/734836 Reserch Article Determinnt Representtions of Polynomil Sequences of Riordn Type Sheng-ling Yng nd Si-nn Zheng Deprtment

More information

Convert the NFA into DFA

Convert the NFA into DFA Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:

More information

Geometric Sequences. Geometric Sequence a sequence whose consecutive terms have a common ratio.

Geometric Sequences. Geometric Sequence a sequence whose consecutive terms have a common ratio. Geometric Sequences Geometric Sequence sequence whose consecutive terms hve common rtio. Geometric Sequence A sequence is geometric if the rtios of consecutive terms re the sme. 2 3 4... 2 3 The number

More information

MATH 573 FINAL EXAM. May 30, 2007

MATH 573 FINAL EXAM. May 30, 2007 MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.

More information

Research Article On Existence and Uniqueness of Solutions of a Nonlinear Integral Equation

Research Article On Existence and Uniqueness of Solutions of a Nonlinear Integral Equation Journl of Applied Mthemtics Volume 2011, Article ID 743923, 7 pges doi:10.1155/2011/743923 Reserch Article On Existence nd Uniqueness of Solutions of Nonliner Integrl Eqution M. Eshghi Gordji, 1 H. Bghni,

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

Math 4310 Solutions to homework 1 Due 9/1/16

Math 4310 Solutions to homework 1 Due 9/1/16 Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1

More information

Binding Number and Connected (g, f + 1)-Factors in Graphs

Binding Number and Connected (g, f + 1)-Factors in Graphs Binding Number nd Connected (g, f + 1)-Fctors in Grphs Jinsheng Ci, Guizhen Liu, nd Jinfeng Hou School of Mthemtics nd system science, Shndong University, Jinn 50100, P.R.Chin helthci@163.com Abstrct.

More information

Chapter 6 Techniques of Integration

Chapter 6 Techniques of Integration MA Techniques of Integrtion Asst.Prof.Dr.Suprnee Liswdi Chpter 6 Techniques of Integrtion Recll: Some importnt integrls tht we hve lernt so fr. Tle of Integrls n+ n d = + C n + e d = e + C ( n ) d = ln

More information

CM10196 Topic 4: Functions and Relations

CM10196 Topic 4: Functions and Relations CM096 Topic 4: Functions nd Reltions Guy McCusker W. Functions nd reltions Perhps the most widely used notion in ll of mthemtics is tht of function. Informlly, function is n opertion which tkes n input

More information

Quadratic Forms. Quadratic Forms

Quadratic 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 information

Decomposition of terms in Lucas sequences

Decomposition of terms in Lucas sequences Journl of Logic & Anlysis 1:4 009 1 3 ISSN 1759-9008 1 Decomposition of terms in Lucs sequences ABDELMADJID BOUDAOUD Let P, Q be non-zero integers such tht D = P 4Q is different from zero. The sequences

More information

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.

Lecture 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 information

Chapter 14. Matrix Representations of Linear Transformations

Chapter 14. Matrix Representations of Linear Transformations Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn

More information

More on Construction of Surfaces

More on Construction of Surfaces More on Construction of Surfces Weihu Hong Mingshen Wu Nthn Borchelt 3 Deprtment of Mthemtics Clyton Stte University Morrow GA 3060 Deprtment of Mthemtics Sttistics nd Computer Science University of Wisconsin-Stou

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

The Shortest Confidence Interval for the Mean of a Normal Distribution

The Shortest Confidence Interval for the Mean of a Normal Distribution Interntionl Journl of Sttistics nd Proility; Vol. 7, No. 2; Mrch 208 ISSN 927-7032 E-ISSN 927-7040 Pulished y Cndin Center of Science nd Eduction The Shortest Confidence Intervl for the Men of Norml Distriution

More information

New Expansion and Infinite Series

New Expansion and Infinite Series Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University

More information

Research Article Composite Gauss-Legendre Formulas for Solving Fuzzy Integration

Research Article Composite Gauss-Legendre Formulas for Solving Fuzzy Integration Hindwi Pulishing Corportion Mthemticl Prolems in Engineering, Article ID 873498, 7 pges http://dx.doi.org/0.55/04/873498 Reserch Article Composite Guss-Legendre Formuls for Solving Fuzzy Integrtion Xioin

More information

Lecture 08: Feb. 08, 2019

Lecture 08: Feb. 08, 2019 4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny

More information

Linear Systems with Constant Coefficients

Linear Systems with Constant Coefficients Liner Systems with Constnt Coefficients 4-3-05 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system

More information

Formal languages, automata, and theory of computation

Formal languages, automata, and theory of computation Mälrdlen University TEN1 DVA337 2015 School of Innovtion, Design nd Engineering Forml lnguges, utomt, nd theory of computtion Thursdy, Novemer 5, 14:10-18:30 Techer: Dniel Hedin, phone 021-107052 The exm

More information

Computing with finite semigroups: part I

Computing with finite semigroups: part I Computing with finite semigroups: prt I J. D. Mitchell School of Mthemtics nd Sttistics, University of St Andrews Novemer 20th, 2015 J. D. Mitchell (St Andrews) Novemer 20th, 2015 1 / 34 Wht is this tlk

More information

Worked out examples Finite Automata

Worked out examples Finite Automata Worked out exmples Finite Automt Exmple Design Finite Stte Automton which reds inry string nd ccepts only those tht end with. Since we re in the topic of Non Deterministic Finite Automt (NFA), we will

More information

Model Reduction of Finite State Machines by Contraction

Model Reduction of Finite State Machines by Contraction Model Reduction of Finite Stte Mchines y Contrction Alessndro Giu Dip. di Ingegneri Elettric ed Elettronic, Università di Cgliri, Pizz d Armi, 09123 Cgliri, Itly Phone: +39-070-675-5892 Fx: +39-070-675-5900

More information

Research Article On New Inequalities via Riemann-Liouville Fractional Integration

Research Article On New Inequalities via Riemann-Liouville Fractional Integration Abstrct nd Applied Anlysis Volume 202, Article ID 428983, 0 pges doi:0.55/202/428983 Reserch Article On New Inequlities vi Riemnn-Liouville Frctionl Integrtion Mehmet Zeki Sriky nd Hsn Ogunmez 2 Deprtment

More information

Quadratic reciprocity

Quadratic reciprocity Qudrtic recirocity Frncisc Bozgn Los Angeles Mth Circle Octoer 8, 01 1 Qudrtic Recirocity nd Legendre Symol In the eginning of this lecture, we recll some sic knowledge out modulr rithmetic: Definition

More information

Zero-Sum Magic Graphs and Their Null Sets

Zero-Sum Magic Graphs and Their Null Sets Zero-Sum Mgic Grphs nd Their Null Sets Ebrhim Slehi Deprtment of Mthemticl Sciences University of Nevd Ls Vegs Ls Vegs, NV 89154-4020. ebrhim.slehi@unlv.edu Abstrct For ny h N, grph G = (V, E) is sid to

More information

CS 330 Formal Methods and Models

CS 330 Formal Methods and Models CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 2 1. Prove ((( p q) q) p) is tutology () (3pts) y truth tle. p q p q

More information

AQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system

AQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system Complex Numbers Section 1: Introduction to Complex Numbers Notes nd Exmples These notes contin subsections on The number system Adding nd subtrcting complex numbers Multiplying complex numbers Complex

More information

Nondeterminism and Nodeterministic Automata

Nondeterminism and Nodeterministic Automata Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely

More information

Finite Automata-cont d

Finite Automata-cont d Automt Theory nd Forml Lnguges Professor Leslie Lnder Lecture # 6 Finite Automt-cont d The Pumping Lemm WEB SITE: http://ingwe.inghmton.edu/ ~lnder/cs573.html Septemer 18, 2000 Exmple 1 Consider L = {ww

More information

Realistic Method for Solving Fully Intuitionistic Fuzzy. Transportation Problems

Realistic Method for Solving Fully Intuitionistic Fuzzy. Transportation Problems Applied Mthemticl Sciences, Vol 8, 201, no 11, 6-69 HKAR Ltd, wwwm-hikricom http://dxdoiorg/10988/ms20176 Relistic Method for Solving Fully ntuitionistic Fuzzy Trnsporttion Problems P Pndin Deprtment of

More information

1B40 Practical Skills

1B40 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 information

Integral points on the rational curve

Integral points on the rational curve Integrl points on the rtionl curve y x bx c x ;, b, c integers. Konstntine Zeltor Mthemtics University of Wisconsin - Mrinette 750 W. Byshore Street Mrinette, WI 5443-453 Also: Konstntine Zeltor P.O. Box

More information

Multiplying integers EXERCISE 2B INDIVIDUAL PATHWAYS. -6 ì 4 = -6 ì 0 = 4 ì 0 = -6 ì 3 = -5 ì -3 = 4 ì 3 = 4 ì 2 = 4 ì 1 = -5 ì -2 = -6 ì 2 = -6 ì 1 =

Multiplying integers EXERCISE 2B INDIVIDUAL PATHWAYS. -6 ì 4 = -6 ì 0 = 4 ì 0 = -6 ì 3 = -5 ì -3 = 4 ì 3 = 4 ì 2 = 4 ì 1 = -5 ì -2 = -6 ì 2 = -6 ì 1 = EXERCISE B INDIVIDUAL PATHWAYS Activity -B- Integer multipliction doc-69 Activity -B- More integer multipliction doc-698 Activity -B- Advnced integer multipliction doc-699 Multiplying integers FLUENCY

More information

Lecture 3: Curves in Calculus. Table of contents

Lecture 3: Curves in Calculus. Table of contents Mth 348 Fll 7 Lecture 3: Curves in Clculus Disclimer. As we hve textook, this lecture note is for guidnce nd supplement only. It should not e relied on when prepring for exms. In this lecture we set up

More information

Nil Elements and Even Square Rings

Nil Elements and Even Square Rings Interntionl Journl of Alger Vol. 7 no. - 7 HIKAI Ltd www.-hikri.co http://dx.doi.org/.988/ij.7.75 Nil Eleents nd Even Squre ings S. K. Pndey Deprtent of Mthetics Srdr Ptel University of Police Security

More information

WENJUN LIU AND QUÔ C ANH NGÔ

WENJUN LIU AND QUÔ C ANH NGÔ AN OSTROWSKI-GRÜSS TYPE INEQUALITY ON TIME SCALES WENJUN LIU AND QUÔ C ANH NGÔ Astrct. In this pper we derive new inequlity of Ostrowski-Grüss type on time scles nd thus unify corresponding continuous

More information

2. VECTORS AND MATRICES IN 3 DIMENSIONS

2. VECTORS AND MATRICES IN 3 DIMENSIONS 2 VECTORS AND MATRICES IN 3 DIMENSIONS 21 Extending the Theory of 2-dimensionl Vectors x A point in 3-dimensionl spce cn e represented y column vector of the form y z z-xis y-xis z x y x-xis Most of the

More information

1.2. Linear Variable Coefficient Equations. y + b "! = a y + b " Remark: The case b = 0 and a non-constant can be solved with the same idea as above.

1.2. Linear Variable Coefficient Equations. y + b ! = a y + b  Remark: The case b = 0 and a non-constant can be solved with the same idea as above. 1 12 Liner Vrible Coefficient Equtions Section Objective(s): Review: Constnt Coefficient Equtions Solving Vrible Coefficient Equtions The Integrting Fctor Method The Bernoulli Eqution 121 Review: Constnt

More information

Czechoslovak Mathematical Journal, 55 (130) (2005), , Abbotsford. 1. Introduction

Czechoslovak Mathematical Journal, 55 (130) (2005), , Abbotsford. 1. Introduction Czechoslovk Mthemticl Journl, 55 (130) (2005), 933 940 ESTIMATES OF THE REMAINDER IN TAYLOR S THEOREM USING THE HENSTOCK-KURZWEIL INTEGRAL, Abbotsford (Received Jnury 22, 2003) Abstrct. When rel-vlued

More information

5. (±±) Λ = fw j w is string of even lengthg [ 00 = f11,00g 7. (11 [ 00)± Λ = fw j w egins with either 11 or 00g 8. (0 [ ffl)1 Λ = 01 Λ [ 1 Λ 9.

5. (±±) Λ = fw j w is string of even lengthg [ 00 = f11,00g 7. (11 [ 00)± Λ = fw j w egins with either 11 or 00g 8. (0 [ ffl)1 Λ = 01 Λ [ 1 Λ 9. Regulr Expressions, Pumping Lemm, Right Liner Grmmrs Ling 106 Mrch 25, 2002 1 Regulr Expressions A regulr expression descries or genertes lnguge: it is kind of shorthnd for listing the memers of lnguge.

More information

The asymptotic behavior of the real roots of Fibonacci-like polynomials

The asymptotic behavior of the real roots of Fibonacci-like polynomials Act Acdemie Pedgogice Agriensis, Sectio Mthemtice, 4. 997) pp. 55 6 The symptotic behvior of the rel roots of Fiboncci-like polynomils FERENC MÁTYÁS Abstrct. The Fiboncci-like polynomils G n x) re defined

More information

Kronecker-Jacobi symbol and Quadratic Reciprocity. Q b /Q p

Kronecker-Jacobi symbol and Quadratic Reciprocity. Q b /Q p Kronecker-Jcoi symol nd Qudrtic Recirocity Let Q e the field of rtionl numers, nd let Q, 0. For ositive rime integer, the Artin symol Q /Q hs the vlue 1 if Q is the slitting field of in Q, 0 if is rmified

More information

#A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z

#A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z #A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z Kurt Girstmir Institut für Mthemtik, Universität Innsruck, Innsruck, Austri kurt.girstmir@uik.c.t Received: 10/4/16, Accepted: 7/3/17, Pulished:

More information