QUASIGROUP AUTOMORPHISMS AND THE NORTON-STEIN COMPLEX

Size: px
Start display at page:

Download "QUASIGROUP AUTOMORPHISMS AND THE NORTON-STEIN COMPLEX"

Transcription

1 PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volum 138, Numr 9, Sptmr 2010, Pgs S (10) Articl lctroniclly pulishd on April 29, 2010 QUASIGROUP AUTOMORPHISMS AND THE NORTON-STEIN COMPLEX BRENT L. KERBY AND JONATHAN D. H. SMITH (Communictd y Jonthn I. Hll) Astrct. Suppos tht d>1 is th lrgst powr of two tht divids th ordr of finit qusigroup Q. It thn follows tht ch utomorphism of Q must contin cycl of lngth not divisil y d in its disjoint cycl dcomposition. Th proof is otind y considring th ction inducd y th utomorphism on crtin orintl surfc originlly dscrid in mor rstrictd contxt y Norton nd Stin. 1. Introduction For n utomorphism of finit qusigroup (or Ltin squr) Q, th multist of cycl lngths in th disjoint cycl dcomposition of th utomorphism is clld th cycl structur of th utomorphism. It is thn nturl to pos th following qustion: Givn positiv intgr n, wht r th possil cycl structurs of utomorphisms of qusigroups of ordr n? Th qustion ws ddrssd in [2] for smll vlus of n nd in [1] for th spcil cs of utomorphisms hving only on nontrivil cycl. Th gnrl cs rmins unsolvd, ut in this ppr w us mthods from lgric topology to rsolv som of th mor difficult css. Algric topology normlly procds y functoril ssocition of lgric ojcts to topologicl spcs. W rvrs this procdur in 2 y constructing n orintl surfc S Q for ch finit qusigroup Q, such tht th ssocition Q S Q is functoril (Thorm 2.3). In 3 w ndow th surfc with th structur of CW-complx. This clrifis nd xtnds construction of Norton nd Stin [6] tht ws limitd to th cs of idmpotnt qusigroups. Using our construction, w prsnt somwht simplifid proof of rsult of Stin [7, Th. 1.1]: Corollry 3.4. Lt Q finit qusigroup, with Q 2 mod 4. Thn th utomorphism group of Q dos not ct trnsitivly. In 4, w stt nd prov our min rsult, which dpnds on lmm stlishd in 5. Th proof of th lmm uss monodromy tchniqu dting ck to Nilsn [5]. Th min rsult is s follows: Rcivd y th ditors Novmr 11, Mthmtics Sujct Clssifiction. Primry 20N05, 05B15. Ky words nd phrss. Ltin squr, qusigroup, surfc, monodromy c 2010 Amricn Mthmticl Socity This is fr offprint providd to th uthor y th pulishr. Copyright rstrictions my pply.

2 3080 B.L. KERBY AND J.D.H. SMITH Thorm 4.2. If 2 l (with l>0) is th lrgst powr of two dividing th ordr of finit qusigroup Q, thn th disjoint cycl dcomposition of ch utomorphism of Q must contin cycl whos lngth is not divisil y 2 l. Som indiction of th scop of this rsult is otind y considring Flcón s dscription [2] of th possil cycl structurs of utotopis of qusigroups Q with Q 11. In tht work, thr potntil cycl structurs of utomorphisms could only ruld out y n xhustiv computr srch. Ths wr 2 3 (i.., cycl structur consisting of thr disjoint trnspositions) for qusigroups of ordr 6, nd nd 2 5 for qusigroups of ordr 10. All ths css r now foriddn y Thorm 4.2 (with l 1). 2. Construction of th Norton-Stin surfc Lt Q qusigroup of ordr n. ThnQ is dtrmind y its (trnry) multipliction tl T Q {(,, c) Q 3 c}. For ch tripl t (,, c) int Q, construct n quiltrl tringl whos vrtics will lld,, ndc, circumnvigting th tringl in th countr-clockwis dirction, nd whos dgs will lld (, ) 0,(, c) 1,(c, ) 2,sshowninFigur 1. c (c, ) 2 (, c) 1 (, ) 0 Figur 1. A sic tringl. Th disjoint union of ths n 2 tringls forms topologicl spc, suspc of th Euclidn pln, which w will dnot y P Q. Not tht y dfinition, ch tringl contins thr distinct dgs, vn though th vrtx lls,, ndc my not ll distinct. An dg with ll of th form (, ) i will clld dgnrt dg, whil th tringl corrsponding to tripl of th form (,, ) will clld dgnrt tringl. Exmpl 2.1. Considr th cyclic group Q of ordr 3. Writ its usul multipliction tl s Q This is fr offprint providd to th uthor y th pulishr. Copyright rstrictions my pply.

3 QUASIGROUP AUTOMORPHISMS 3081 Th corrsponding spc P Q is shown in Figur 2. Figur 2. Th spc P Q for th cyclic group Q of ordr 3. For convninc, w hv omittd th full dg lls (, ) i, instd mrking ch dg (, ) i with 0, 1, or 2 slshs ccording s i 0, 1, or 2, rspctivly. If n>0 thr will mny vrtics of P Q with th sm ll. Howvr, th qusigroup condition nsurs tht for ch, Q nd i {0, 1, 2} thr is uniqu dg with th ll (, ) i. Likwis, thr is uniqu dg with th ll (, ) i. Thus for ch,, ndi w my dfin function (th so-clld psting mp) which mps th dg (, ) i isomtriclly onto th dg (, ) i, th img procding clockwis s w procd countr-clockwis in th domin, so tht th vrtx lld is mppd onto th othr vrtx lld, nd th vrtx lld is mppd onto th othr vrtx lld. If w idntify points which corrspond undr th psting mp, thn w otin topologicl quotint spc of P Q which w cll th Norton-Stin surfc of Q nd dnot y S Q. W will omit th proof tht S Q is (usully disconnctd) surfc, sinc this fct is wll known for spcs constructd y psting polygons togthr in such mnnr (s,.g., [4]). Th only issu hr is tht, in th cs of dgnrt dg (, ) i, th dg is pstd onto itslf with opposit orinttion. Topologiclly, this simply collpss tringl into digon formd y th two rmining dgs (s Figur 3). A dgnrt tringl (,, ) collpss furthr from digon into sphr. (S Figur 4, whr th procss is rokn down into two stps.) Th rsulting quotint spc will still surfc. Sinc th dgs com in pirs which hv opposit orinttion undr th psting mps, it follows tht th Norton-Stin surfc is orintl (gin s,.g., [4] for dtils). Exmpl 2.2. For Q th cyclic group of ordr 3, Figur 5 shows th spc rsulting from P Q ftr pplying nough psting mps so tht th spc flls into 3 closd This is fr offprint providd to th uthor y th pulishr. Copyright rstrictions my pply.

4 3082 B.L. KERBY AND J.D.H. SMITH c c Figur 3. Collps to digon. Figur 4. Collps from digon to topologicl sphr. polygons, ch dg of which is pird which nothr dg (possily itslf) on th smpolygon.fromthisitisvidntthts Q consists of 3 disconnctd sphrs. Figur 5. Th spc S Q for th cyclic group Q of ordr 3. Th functoril ntur of this construction of th Norton-Stin surfc my dscrid s follows: Thorm 2.3. A homomorphism ψ : Q 1 Q 2 of qusigroups inducs continuous mp ψ : S Q1 S Q2 on th corrsponding Norton-Stin surfcs. This corrspondnc dtrmins functor from th ctgory of finit qusigroups nd homomorphisms to th ctgory of surfcs nd continuous mps. Proof. First, ψ dtrmins mp ψ : P Q1 P Q2 y snding ch tringl (,, c) of P Q1 isomtriclly onto th corrsponding tringl (ψ(),ψ(),ψ(c)) of P Q2,such This is fr offprint providd to th uthor y th pulishr. Copyright rstrictions my pply.

5 QUASIGROUP AUTOMORPHISMS 3083 tht th vrtics lld,, ndc mp to th vrtics lld ψ(), ψ(), nd ψ(c), rspctivly. Thn ψ mps ch dg (, ) i isomtriclly onto th dg (ψ(),ψ()) i. It follows tht if f 1 is th psting mp twn two dgs (, ) i nd (, ) i of P Q1,ndx, y P Q1 r such tht f 1 (x) f 1 (y), thn w lso hv f 2 (ψ(x)) f 2 (ψ(y)), whr f 2 is th psting mp twn th dgs (ψ(),ψ()) i nd (ψ(),ψ()) i of P Q2.Thusψinducs wll-dfind continuous mp ψ from th quotint spc S Q1 to th quotint spc S Q2. Tht this corrspondnc dtrmins functor is strightforwrd to vrify. Corollry 2.4. For n utomorphism ψ of finit qusigroup Q, th ordrs of ψ nd ψ r qul. Proof. Suppos tht ψ nd ψ hv rspctiv ordrs n nd m. Thnsincψ n 1, Thorm 2.3 implis ψ n 1. Hnc m n, nd in prticulr m<. On th othr hnd, for ch lmnt q of Q, choosvrtxx q in S Q with ll q. Now ψ m (x q )x q,soψ m (q) q. Sinc th qulity ψ m (q) q holds for ch lmnt q of Q, whvψ m 1ndthusn m. 3. Th Norton-Stin complx nd som pplictions W now giv S Q th structur of CW-complx. Th 0-clls r dfind to th imgs of th vrtics of P Q. Th 1-clls r th imgs of th nondgnrt dgs, nd 2-cll is givn y th img of th intrior of tringl of P Q togthr with ny dgnrt dgs of th tringl. With this ddd structur, w cll S Q th Norton-Stin complx of Q. W ssign th sm lls to th 0-clls of S Q s th corrsponding vrtics of P Q. This is wll-dfind sinc only vrtics with th sm ll r idntifid y th psting mps. Givn nondgnrt dg (, ) i of P Q, w ssign th ll {, } i to th corrsponding 1-cll in S Q. Not tht if n>0, S Q will not simplicil complx, sinc it is possil tht two distinct 2-clls my incidnt with th sm thr 0-clls, nd som 2-clls will incidnt with only two 0-clls nd 1-clls (if th corrsponding tringl contins dgnrt dg). In th cs of dgnrt tringl (,, ), th corrsponding 2-cll is incidnt with only on 0-cll nd no 1-clls. Although only vrtics of P Q with th sm lls r idntifid in S Q,itis notncssrilythcsthtll vrtics with th sm lls r idntifid. Th numr of distinct vrtics of S Q with th ll q is dnotd y Φ(q). It is clr tht Φ is invrint undr isomorphisms. Thus if ψ : Q 1 Q 2 is n isomorphism of qusigroups, thn Φ(ψ(q)) Φ(q). Th numr Z Q q Q Φ(q) is thn n invrint of th qusigroup Q. WsthtZ Q is simply th numr of vrtics in th Norton-Stin complx of Q. Th following rsult is thn immdit. Thorm 3.1. For finit qusigroup Q, th Eulr chrctristic of S Q is χ Z Q 3n(n 1)/2+n 2. This lds us to th following thorm, provd y Norton nd Stin [6] in th spcil cs of idmpotnt qusigroups. This is fr offprint providd to th uthor y th pulishr. Copyright rstrictions my pply.

6 3084 B.L. KERBY AND J.D.H. SMITH Thorm 3.2. For qusigroup Q of ordr n, (3.1) Z Q n(n +1)/2 mod 2. Proof. W hv Z Q 3n(n 1)/2+n 2 n(n 1)/2+n n(n +1)/2 mod 2 y Thorm 3.1, sinc th Eulr chrctristic of th orintl surfc S Q is vn. Rmrk 3.3. Th formul (3.1) diffrs from tht of [6, Th. II], cus our dfinition of Z Q includs th vrtics which r ssocitd with th dgnrt tringls (,, ). As shown y th following corollry, vn th smingly miniscul informtion out th Norton-Stin complx providd y Thorm 3.2 cn ld to powrful conclusions out th ssocitd qusigroup. Corollry 3.4 ([7]). Lt Q finit qusigroup, with Q 2 mod 4. Thn th utomorphism group of Q dos not ct trnsitivly. Proof. Suppos tht Q hd trnsitiv utomorphism group. Thn thr would constnt c such tht Φ(q) c for ll q Q. Hnc Z Q q Q Φ(q) c Q 0 mod 2. Howvr, if Q 4k + 2 for som nturl numr k, Thorm 3.2 implis Z Q (2k + 1)(4k +3) 1 mod 2. Rmrk 3.5. () Stin s originl proof of Corollry 3.4 rquird n initil rduction to th cs of idmpotnt qusigroups. () Stin [8, Th. 9.9] osrvd tht for ch positiv intgr n not congrunt to 2 modulo 4, thr is distriutiv qusigroup of ordr n with trnsitiv utomorphism group (compr Fit s rviw of [3]): If n fctors into powrs of distinct prims p 1,p 2,...,p k s p 1 qusigroup k j1 1 p p k k, n xmpl is givn y th dirct product ( GF(p j j ), j) with x j y α j x +(1 α j )y, whrα j is con- ) {0, 1}. stnt ritrrily chosn from GF(p j j Th sm tchniqu s in th proof of Corollry 3.4 srvs to giv th following spcil cs of our min rsult. Corollry 3.6. Lt ψ n utomorphism of qusigroup Q, whr Q 2 mod 4. Thn th disjoint cycl dcomposition of ψ contins cycl of odd lngth. Proof. If ll th cycls of ψ hv vn lngth, thn th lmnts of Q fll into orits of vn lngth undr ψ. Th function Φ is constnt on ch orit. This implis tht Z Q Φ(q) 0 mod 2, q Q gin contrry to th impliction Z Q 1 mod 2 of Thorm 3.2. As mntiond in th introduction, thr r thr impossil cycl structurs of utomorphisms which hd to ruld out y xhustiv computr srch in [2]: 2 3, ,nd2 5. All thr of ths css r now foriddn y Corollry 3.6. Howvr, th mor lmntry tchniqus of this sction r not cpl of liminting such cycl structurs s 4 3 (for qusigroups of ordr 12) or 4 5 (for qusigroups of ordr 20). Furthr progrss rquirs th full gnrlity of our min rsult, dscrid in This is fr offprint providd to th uthor y th pulishr. Copyright rstrictions my pply.

7 QUASIGROUP AUTOMORPHISMS 3085 th nxt sction. This ntils considrly dpr ppliction of th Norton-Stin complx. 4. Th min rsult Givn n utomorphism ψ of finit qusigroup Q, Thorm 2.3 yilds continuous utomorphism ψ of th Norton-Stin surfc S Q. Th group ψ gnrtd y ψ thn cts y prmuting th connctd componnts of th surfc S Q. W my thus stt th following lmm. Lmm 4.1. Lt ψ n utomorphism of finit qusigroup Q, nd suppos tht th disjoint cycl dcomposition of ψ consists ntirly of cycls of lngth 2. Suppos tht connctd componnt W of th Norton-Stin surfc S Q is fixd stwis y ψ. Th Eulr chrctristic of W is thn divisil y 2. Th proof of Lmm 4.1, givn in th nxt sction, is t th cor of our min rsult. Hr, w stt th min rsult nd show how it follows from Lmm 4.1. Thorm 4.2. If 2 l (with l>0) is th lrgst powr of two dividing th ordr of finit qusigroup Q, thn th disjoint cycl dcomposition of ch utomorphism of Q must contin cycl whos lngth is not divisil y 2 l. Proof. Suppos tht ll th cycls of n utomorphism ψ hv lngth divisil y 2 l. First, w clim tht it suffics to rstrict ttntion to th cs whr ψ consists of cycls ll of lngth prcisly 2 l. Lt c 1,...,c r th cycl lngths of ψ, nd st c lcm(c 1,...,c r ). Writ c 2 k with k odd. By rplcing ψ with its powr ψ k, w my ssum tht ch cycl of ψ hs lngth powr of two, ch cycl hving lngth t lst 2 l. Sinc 2 l is th lrgst powr of two dividing Q nd th cycl lngths dd to Q, it follows tht ψ must hv n odd numr of cycls of lngth 2 l. Thstoffixdpointsof ψ 2l forms suqusigroup H of Q, onwhichψ cts s n utomorphism consisting of n odd numr of cycls ll of lngth prcisly 2 l,sotht2 l is th lrgst powr of two dividing th ordr of H. Rplcing Q y H nd ψ y ψ H, this provs th clim. Sinc th orits of ψ prtition Q into orits of lngth 2 l, it follows tht Z Q q Q Φ(q) is divisil y 2l. Hnc y Thorm 3.1 th lrgst powr of 2 dividing th Eulr chrctristic of S Q is 2 l1. W will otin contrdiction y showing tht th Eulr chrctristic of S Q is ctully divisil y 2 l. Aswhvsn, ψ cts y prmuting th connctd componnts of S Q.LtW such componnt of S Q. Its stilizr in ψ is gnrtd y ψ 2 for som l. So th orit of W undr ψ consists of 2 componnts, ch with idnticl Eulr chrctristic. Sinc ψ 2 is n utomorphism of Q consisting of cycls of lngth 2 l, Lmm 4.1 implis tht W hs Eulr chrctristic divisil y 2 l. It follows tht th union of th componnts in th orit of W hs Eulr chrctristic divisil y 2 l. Hnc S Q itslf hs Eulr chrctristic divisil y 2 l, th dsird contrdiction. 5. Proof of th lmm In th proof of Lmm 4.1, w spciliz tchniqus usd y Nilsn in [5, 1 4]. Lt ψ n utomorphism of finit qusigroup Q, nd suppos tht th disjoint cycl dcomposition of ψ consists ntirly of cycls of lngth 2. Furthr, suppos tht W is connctd componnt of S Q which is invrint undr ψ.st This is fr offprint providd to th uthor y th pulishr. Copyright rstrictions my pply.

8 3086 B.L. KERBY AND J.D.H. SMITH G ψ. Not tht G cts on W y prmuting its points. By Corollry 2.4, w hv G ψ ψ 2,sothtchG-orit on W is finit, of lngth dividing 2. Mor prcis informtion on th orit lngths is givn y th following: Lmm 5.1. Considr th ction of G on th surfc W. () Ech intrior point of 2-cll lis in G-orit of lngth 2. () Ech 0-cll lis in G-orit of lngth 2. (c) Ech point x on 1-cll lis in G-orit of siz 2,with (5.1) 1. Th lowr ound 1 in (5.1) cn only ttind if x is th midpoint of 1-cll. Proof. (): Suppos tht som powr ψ k fixs n intrior point x of som 2-cll (u, v, w). Sinc ψ mps 2-clls to 2-clls, ψ k must fix th 2-cll (u, v, w) stwis. By th construction of ψ k from Thorm 2.3, it follows tht ( ψ k (u),ψ k (v),ψ k (w) ) (u, v, w). In prticulr ψ k (u) u, which implis 2 k. (): If ψ k mps 0-cll u to itslf, thn in prticulr ψ k mps x to vrtx with th sm ll s x. Ifx hs ll q, thn w must hv ψ k (q) q, ndso2 k. (c): Suppos x is point on 1-cll {u, v} i,ndthtψ (x) k x. Thnsincψ mps 1-clls to 1-clls, ψ k must mp th dg {u, v} i to itslf: {ψ k (u),ψ k (v)} i {u, v} i. Hnc ψ k ithr fixs u nd v, or swps thm. In ithr cs, w hv ψ 2k (u) u, so2 1 k. If th fixd point x of ψ k is not th midpoint of th dg {u, v} i,thnψ k cnnot swp u nd v. Thusψ k (u) u nd 2 k in this cs. Dfinition 5.2. Whn th midpoint x of 1-cll lis on G-orit of miniml lngth 2 1, th point x is dscrid s rnch point. Undr th ction of G, th rnch points fll into orits of siz 2 1. Lt s th (possily zro) numr of such orits, so tht thr r 2 1 s rnch points ltogthr. Choos rprsnttiv rnch points x 1,...,x s,onfromch orit. Now, slct disjoint opn discs U 1,...,U s contining x 1,...,x s rspctivly, choosing th U i sufficintly smll so tht th 2 1 s imgs ψ (U k i ) r ll disjoint for 0 k<2 1 nd 1 i s. W rmov ll of ths 2 1 s discs from W nd cll th rsulting spc W 0. Thus W 0 is n orintl surfc with oundry, hving 2 1 s oundry curvs. Lt M th quotint spc W/G of W dtrmind y idntifying points which li in th sm G-orit. Lt π : W M th quotint mp. Th imgs of th discs U 1,...,U s undr π r rmovd from M, ndwcll th rsulting spc M 0. This spc M 0 is lso n orintl surfc with oundry hving s oundry curvs. Th spc W 0 is 2 -fold covring spc of M 0, th rstriction of π to W 0 ing covringmp. Iff :[0, 1] M 0 is ny closd loop in M 0 sd t som point m of M 0,nduis point of W 0 such tht π(u) m, thnf lifts to uniqu pth f :[0, 1] W 0 in W 0 with f(0) u. Sinc th ndpoint of this pth stisfis π( f(1)) m, it follows tht f(1) ψ μ(f,u) (u) for som intgr μ(f,u) modulo 2. Lmm 5.3. Thr is uniqu intgr μ(f) modulo 2 such tht μ(f) μ(f,v) for ll v π 1 {m}. This is fr offprint providd to th uthor y th pulishr. Copyright rstrictions my pply.

9 QUASIGROUP AUTOMORPHISMS 3087 Proof. Suppos v π 1 {m}, syv ψ (u). l Sinc ψ l f is th lift of f topth in W 0 strting from v, whv ( ψ μ(f,v) (v) ψ l f ) ( ) (1) ψ l f(1) ( ) ψ l ψ μ(f,u) (u) ψ μ(f,u) ( ψ l (u) ) ψ μ(f,u) (v), whnc μ(f,v) μ(f,u) y Lmm 5.1(). Dfinition 5.4. Th intgr μ(f) modulo 2 of Lmm 5.3 is clld th monodromy numr of th loop f in M 0. Th monodromy numr μ(f) dpnds only on th homotopy clss of th loop f. Furthrmor, for th conctntion f g of two loops f,g sd t m in M, w hv μ(f g) μ(f)+μ(g). Hncwmyconsidrμ s homomorphism from th fundmntl group π 1 (M 0,m)ofM 0 into Z/2 Z. Considr point m on on of th s oundry curvs of M 0.Ltγ loop strting from m tht follows onc round th oundry curv in th positiv dirction. Thr r 2 points of W 0 which mp to m. On th othr hnd, π 1 (γ([0, 1])) is th disjoint union of 2 1 oundry curvs of W 0, which r prmutd trnsitivly y G. Thus ch such oundry curv must contin prcisly two points mpping to m, nd ths two points r intrchngd y ψ 21. This implis μ(γ) 2 1. Now fix n ritrry point m of M 0.Ltγ 1,...,γ s dnot loops tht rspctivly follow onc round ch of th s oundry curvs of M 0 in th positiv dirction. Lt δ 1,...,δ s pths from m to γ 1 (0),...,γ s (0), rspctivly. St γ i δ1 i γ i δ i for 1 i s. Thn μ(γ i )μ(γ) 21 for 1 i s, sincthloopsγ i nd γ i r homotopic. Lt g th gnus of M 0. Thn th fundmntl group π 1 (M 0,m) is gnrtd y crtin loops α 1,β 1,...,α g,β g, togthr with th loops γ 1,...,γ s, sujct only to th rltion (5.2) t 1 t 2 t g γ 1γ 2 γ s 1 with commuttors t i α i β i α 1 i β 1 i. If w pply μ to (5.2), w otin g s μ(t i )+ μ(γ j ) 0 mod 2. i1 j1 Now μ(t i )μ(α i )+μ(β i ) μ(α i ) μ(β i )0for1 i g, ndμ(γ i )21 for 1 j s. Thus 2 1 s 0 mod 2, nd so s is vn. Th Eulr chrctristics of W, W 0,ndM 0 r rltd s follows: χ(w ) 2 1 s χ(w 0 )2 χ(m 0 ). Sinc s is vn, this implis tht 2 χ(w ), s dsird. Acknowldgmnts Th first uthor would lik to thnk Brin Rushton nd Stphn P. Humphris for usful convrstions on th topic of this ppr. This is fr offprint providd to th uthor y th pulishr. Copyright rstrictions my pply.

10 3088 B.L. KERBY AND J.D.H. SMITH Rfrncs [1] D. Brynt, M. Buchnn nd I.M. Wnlss, Th spctrum for qusigroups with cyclic utomorphisms nd dditionl symmtris, Discrt Mth. 309 (2009), MR (2010:20122) [2] R.M. Flcón, Cycl structurs of utotopisms of th Ltin squrs of ordr up to 11, to ppr in Ars Comintori. rxiv: v2 [mth.co], [3] B. Fischr, Distriutiv Qusigruppn ndlichr Ordnung, Mth. Z. 83 (1964), MR (28:4055) [4] J.R. Munkrs, Topology, Prntic-Hll, Englwood Cliffs, NJ, [5] J. Nilsn, Di Struktur priodischr Trnsformtionn von Flächn, Kgl. Dnsk Vidnskrns Slsk., Mth.-fys. Mddllsr 15 (1937), 1 77, trnsltd s Th structur of priodic surfc trnsformtions, pp in Jko Nilsn: Collctd Mthmticl Pprs,Vol.2, Birkhäusr, Boston, MA, MR (88:01070) [6] D.A. Norton nd S.K. Stin, An intgr ssocitd with Ltin squrs, Proc. Amr. Mth. Soc. 7 (1956), MR (17:1043f) [7] S.K. Stin, Homognous qusigroups, Pc. J. Mth. 14 (1964), MR (30:1206) [8] S.K. Stin, On th foundtions of qusigroups, Trns.Amr.Mth.Soc.85 (1957), MR (20:922) Dprtmnt of Mthmtics, Brighm Young Univrsity, Provo, Uth E-mil ddrss: kry@mth.yu.du Currnt ddrss: Dprtmnt of Mthmtics, Univrsity of Uth, Slt Lk City, Uth E-mil ddrss: kry@mth.uth.du Dprtmnt of Mthmtics, Iow Stt Univrsity, Ams, Iow E-mil ddrss: jdhsmith@istt.du URL: This is fr offprint providd to th uthor y th pulishr. Copyright rstrictions my pply.

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x) Chptr 7 INTEGRALS 7. Ovrviw 7.. Lt d d F () f (). Thn, w writ f ( ) d F () + C. Ths intgrls r clld indfinit intgrls or gnrl intgrls, C is clld constnt of intgrtion. All ths intgrls diffr y constnt. 7..

More information

TOPIC 5: INTEGRATION

TOPIC 5: INTEGRATION TOPIC 5: INTEGRATION. Th indfinit intgrl In mny rspcts, th oprtion of intgrtion tht w r studying hr is th invrs oprtion of drivtion. Dfinition.. Th function F is n ntidrivtiv (or primitiv) of th function

More information

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, * CmSc 365 Thory of Computtion Finit Stt Automt nd Rgulr Exprssions (Chptr 2, Sction 2.3) ALPHABET oprtions: U, conctntion, * otin otin Strings Form Rgulr xprssions dscri Closd undr U, conctntion nd * (if

More information

Last time: introduced our first computational model the DFA.

Last time: introduced our first computational model the DFA. Lctur 7 Homwork #7: 2.2.1, 2.2.2, 2.2.3 (hnd in c nd d), Misc: Givn: M, NFA Prov: (q,xy) * (p,y) iff (q,x) * (p,) (follow proof don in clss tody) Lst tim: introducd our first computtionl modl th DFA. Tody

More information

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata CSE303 - Introduction to th Thory of Computing Smpl Solutions for Exrciss on Finit Automt Exrcis 2.1.1 A dtrministic finit utomton M ccpts th mpty string (i.., L(M)) if nd only if its initil stt is finl

More information

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture: Lctur 11 Wvs in Priodic Potntils Tody: 1. Invrs lttic dfinition in 1D.. rphicl rprsnttion of priodic nd -priodic functions using th -xis nd invrs lttic vctors. 3. Sris solutions to th priodic potntil Hmiltonin

More information

Minimum Spanning Trees

Minimum Spanning Trees Minimum Spnning Trs Minimum Spnning Trs Problm A town hs st of houss nd st of rods A rod conncts nd only houss A rod conncting houss u nd v hs rpir cost w(u, v) Gol: Rpir nough (nd no mor) rods such tht:

More information

Instructions for Section 1

Instructions for Section 1 Instructions for Sction 1 Choos th rspons tht is corrct for th qustion. A corrct nswr scors 1, n incorrct nswr scors 0. Mrks will not b dductd for incorrct nswrs. You should ttmpt vry qustion. No mrks

More information

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

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

More information

Weighted Matching and Linear Programming

Weighted Matching and Linear Programming Wightd Mtching nd Linr Progrmming Jonthn Turnr Mrch 19, 01 W v sn tht mximum siz mtchings cn b found in gnrl grphs using ugmnting pths. In principl, this sm pproch cn b pplid to mximum wight mtchings.

More information

COMP108 Algorithmic Foundations

COMP108 Algorithmic Foundations Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht

More information

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016 Wintr 2016 COMP-250: Introduction to Computr Scinc Lctur 23, April 5, 2016 Commnt out input siz 2) Writ ny lgorithm tht runs in tim Θ(n 2 log 2 n) in wors cs. Explin why this is its running tim. I don

More information

Week 3: Connected Subgraphs

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

More information

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

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

More information

Walk Like a Mathematician Learning Task:

Walk Like a Mathematician Learning Task: Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics

More information

MERIDIAN SURFACE OF WEINGARTEN TYPE IN 4-DIMENSIONAL EUCLIDEAN SPACE E 4 arxiv: v1 [math.dg] 14 May 2013

MERIDIAN SURFACE OF WEINGARTEN TYPE IN 4-DIMENSIONAL EUCLIDEAN SPACE E 4 arxiv: v1 [math.dg] 14 May 2013 MERIDIAN SURFACE OF WEINGARTEN TYPE IN 4-DIMENSIONAL EUCLIDEAN SPACE E 4 rxiv:13053155v1 [mthdg] 14 My 2013 Astrct In this ppr, w study mridin surfcs of Wingrtn typ in Euclidn 4-spc E 4 W giv th nccssry

More information

Derangements and Applications

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

More information

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes. Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right

More information

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan LOCUS 58 SOLVED EXAMPLES Empl Lt F n F th foci of n llips with ccntricit. For n point P on th llips, prov tht tn PF F tn PF F Assum th llips to, n lt P th point (, sin ). P(, sin ) F F F = (-, 0) F = (,

More information

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

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

More information

Linear Algebra Existence of the determinant. Expansion according to a row.

Linear Algebra Existence of the determinant. Expansion according to a row. Lir Algbr 2270 1 Existc of th dtrmit. Expsio ccordig to row. W dfi th dtrmit for 1 1 mtrics s dt([]) = (1) It is sy chck tht it stisfis D1)-D3). For y othr w dfi th dtrmit s follows. Assumig th dtrmit

More information

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1 Prctic qustions W now tht th prmtr p is dirctl rltd to th mplitud; thrfor, w cn find tht p. cos d [ sin ] sin sin Not: Evn though ou might not now how to find th prmtr in prt, it is lws dvisl to procd

More information

DFA (Deterministic Finite Automata) q a

DFA (Deterministic Finite Automata) q a Big pictur All lngugs Dcidl Turing mchins NP P Contxt-fr Contxt-fr grmmrs, push-down utomt Rgulr Automt, non-dtrministic utomt, rgulr xprssions DFA (Dtrministic Finit Automt) 0 q 0 0 0 0 q DFA (Dtrministic

More information

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion

More information

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

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

More information

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

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

More information

Section 3: Antiderivatives of Formulas

Section 3: Antiderivatives of Formulas Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin

More information

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES

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

More information

Notes on Finite Automata Department of Computer Science Professor Goldberg Textbooks: Introduction to the Theory of Computation by Michael Sipser

Notes on Finite Automata Department of Computer Science Professor Goldberg Textbooks: Introduction to the Theory of Computation by Michael Sipser Nots on Finit Automt Dprtmnt of Computr Scinc Profssor Goldrg Txtooks: Introduction to th Thory of Computtion y Michl Sipsr Elmnts of th Thory of Computtion y H. Lwis nd C. Ppdimitriou Ths nots contin

More information

Multi-Section Coupled Line Couplers

Multi-Section Coupled Line Couplers /0/009 MultiSction Coupld Lin Couplrs /8 Multi-Sction Coupld Lin Couplrs W cn dd multipl coupld lins in sris to incrs couplr ndwidth. Figur 7.5 (p. 6) An N-sction coupld lin l W typiclly dsign th couplr

More information

Garnir Polynomial and their Properties

Garnir Polynomial and their Properties Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,

More information

CONIC SECTIONS. MODULE-IV Co-ordinate Geometry OBJECTIVES. Conic Sections

CONIC SECTIONS. MODULE-IV Co-ordinate Geometry OBJECTIVES. Conic Sections Conic Sctions 16 MODULE-IV Co-ordint CONIC SECTIONS Whil cutting crrot ou might hv noticd diffrnt shps shown th dgs of th cut. Anlticll ou m cut it in thr diffrnt ws, nml (i) (ii) (iii) Cut is prlll to

More information

The Equitable Dominating Graph

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

More information

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

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

More information

Formal Concept Analysis

Formal Concept Analysis Forml Conpt Anlysis Conpt intnts s losd sts Closur Systms nd Implitions 4 Closur Systms 0.06.005 Nxt-Closur ws dvlopd y B. Gntr (984). Lt M = {,..., n}. A M is ltilly smllr thn B M, if B A if th smllst

More information

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

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

More information

Basic Polyhedral theory

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

More information

Lecture 4. Conic section

Lecture 4. Conic section Lctur 4 Conic sction Conic sctions r locus of points whr distncs from fixd point nd fixd lin r in constnt rtio. Conic sctions in D r curvs which r locus of points whor position vctor r stisfis r r. whr

More information

This Week. Computer Graphics. Introduction. Introduction. Graphics Maths by Example. Graphics Maths by Example

This Week. Computer Graphics. Introduction. Introduction. Graphics Maths by Example. Graphics Maths by Example This Wk Computr Grphics Vctors nd Oprtions Vctor Arithmtic Gomtric Concpts Points, Lins nd Plns Eploiting Dot Products CSC 470 Computr Grphics 1 CSC 470 Computr Grphics 2 Introduction Introduction Wh do

More information

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

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

More information

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7 CIVL / -D Boundr Vlu Prolms - Rctngulr Elmnts / RECANGULAR ELEMENS - In som pplictions, it m mor dsirl to us n lmntl rprsnttion of th domin tht hs four sids, ithr rctngulr or qudriltrl in shp. Considr

More information

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2 Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny

More information

(Upside-Down o Direct Rotation) β - Numbers

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

More information

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o

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

Searching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list.

Searching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list. 3 3 4 8 6 3 3 4 8 6 3 3 4 8 6 () (d) 3 Sarching Linkd Lists Sarching Linkd Lists Sarching Linkd Lists ssum th list is sortd, but is stord in a linkd list. an w us binary sarch? omparisons? Work? What if

More information

Ch 1.2: Solutions of Some Differential Equations

Ch 1.2: Solutions of Some Differential Equations Ch 1.2: Solutions of Som Diffrntil Equtions Rcll th fr fll nd owl/mic diffrntil qutions: v 9.8.2v, p.5 p 45 Ths qutions hv th gnrl form y' = y - b W cn us mthods of clculus to solv diffrntil qutions of

More information

Figure 1: Closed surface, surface with boundary, or not a surface?

Figure 1: Closed surface, surface with boundary, or not a surface? QUESTION 1 (10 marks) Two o th topological spacs shown in Figur 1 ar closd suracs, two ar suracs with boundary, and two ar not suracs. Dtrmin which is which. You ar not rquird to justiy your answr, but,

More information

Combinatorial Networks Week 1, March 11-12

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

More information

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

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1. Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y

More information

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008 Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is

More information

Limits Indeterminate Forms and L Hospital s Rule

Limits Indeterminate Forms and L Hospital s Rule Limits Indtrmint Forms nd L Hospitl s Rul I Indtrmint Form o th Tp W hv prviousl studid its with th indtrmint orm s shown in th ollowin mpls: Empl : Empl : tn [Not: W us th ivn it ] Empl : 8 h 8 [Not:

More information

1 Introduction to Modulo 7 Arithmetic

1 Introduction to Modulo 7 Arithmetic 1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w

More information

Square of Hamilton cycle in a random graph

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

More information

EEO 401 Digital Signal Processing Prof. Mark Fowler

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

More information

CBSE 2015 FOREIGN EXAMINATION

CBSE 2015 FOREIGN EXAMINATION CBSE 05 FOREIGN EXAMINATION (Sris SSO Cod No 65//F, 65//F, 65//F : Forign Rgion) Not tht ll th sts hv sm qustions Onl thir squnc of pprnc is diffrnt M Mrks : 00 Tim Allowd : Hours SECTION A Q0 Find th

More information

0.1. Exercise 1: the distances between four points in a graph

0.1. Exercise 1: the distances between four points in a graph Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in

More information

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

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

More information

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s? MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth

More information

Finite Automata. d: Q S Q. Finite automaton is M=(Q, S, d, q 0, F) Ex: an FA that accepts all odd-length strings of zeros: q 0 q 1. q i. q k.

Finite Automata. d: Q S Q. Finite automaton is M=(Q, S, d, q 0, F) Ex: an FA that accepts all odd-length strings of zeros: q 0 q 1. q i. q k. Finit Automt Bsic id: FA is mchin tht chngs stts whil procssing symols, on t tim. Finit st of stts: Q = {q 0, q 1, q 3,..., q k } Trnsition function: Initil stt: Finl stts: d: Q S Q q 0 Q F Q Finit utomton

More information

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018 CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs

More information

CS 361 Meeting 12 10/3/18

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

More information

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

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

More information

SCHUR S THEOREM REU SUMMER 2005

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

More information

Einstein Equations for Tetrad Fields

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

More information

PH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations.

PH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations. Dy : Mondy 5 inuts. Ovrviw of th PH47 wsit (syllus, ssignnts tc.). Coupld oscilltions W gin with sss coupld y Hook's Lw springs nd find th possil longitudinl) otion of such syst. W ll xtnd this to finit

More information

Mathematics. Mathematics 3. hsn.uk.net. Higher HSN23000

Mathematics. Mathematics 3. hsn.uk.net. Higher HSN23000 Highr Mthmtics UNIT Mthmtics HSN000 This documnt ws producd spcilly for th HSN.uk.nt wbsit, nd w rquir tht ny copis or drivtiv works ttribut th work to Highr Still Nots. For mor dtils bout th copyright

More information

SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH.

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

More information

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt

More information

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem) 12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr

More information

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9 Lctur contnts Bloch thorm -vctor Brillouin zon Almost fr-lctron modl Bnds ffctiv mss Hols Trnsltionl symmtry: Bloch thorm On-lctron Schrödingr qution ch stt cn ccommo up to lctrons: If Vr is priodic function:

More information

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl

More information

However, many atoms can combine to form particular molecules, e.g. Chlorine (Cl) and Sodium (Na) atoms form NaCl molecules.

However, many atoms can combine to form particular molecules, e.g. Chlorine (Cl) and Sodium (Na) atoms form NaCl molecules. Lctur 6 Titl: Fundmntls of th Quntum Thory of molcul formtion Pg- In th lst modul, w hv discussd out th tomic structur nd tomic physics to undrstnd th spctrum of toms. Howvr, mny toms cn comin to form

More information

Mutually Independent Hamiltonian Cycles of Pancake Networks

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

More information

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

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

More information

A Dynamic-Programming Heuristic for Regular Grid-Graph Partitioning

A Dynamic-Programming Heuristic for Regular Grid-Graph Partitioning A Dynmic-Progrmming Huristic for Rgulr Grid-Grph Prtitioning W.W. Donldson nd R.R. Myr Dprtmnt of Computr Scincs, Univrsity of Wisconsin - Mdison, WI Octobr 27, 2000 Abstrct Prvious rsrchrs hv dmonstrtd

More information

Continuous Random Variables: Basics

Continuous Random Variables: Basics Continuous Rndom Vrils: Bsics Brlin Chn Dprtmnt o Computr Scinc & Inormtion Enginring Ntionl Tiwn Norml Univrsit Rrnc: - D.. Brtss, J. N. Tsitsilis, Introduction to roilit, Sctions 3.-3.3 Continuous Rndom

More information

On the irreducibility of some polynomials in two variables

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

More information

The Matrix Exponential

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

More information

Theoretical Study on the While Drilling Electromagnetic Signal Transmission of Horizontal Well

Theoretical Study on the While Drilling Electromagnetic Signal Transmission of Horizontal Well 7 nd ntrntionl Confrnc on Softwr, Multimdi nd Communiction Enginring (SMCE 7) SBN: 978--6595-458-5 Thorticl Study on th Whil Drilling Elctromgntic Signl Trnsmission of Horizontl Wll Y-huo FAN,,*, Zi-ping

More information

Present state Next state Q + M N

Present state Next state Q + M N Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I

More information

CLONES IN 3-CONNECTED FRAME MATROIDS

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

More information

Higher order derivatives

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

More information

CONTINUITY AND DIFFERENTIABILITY

CONTINUITY AND DIFFERENTIABILITY MCD CONTINUITY AND DIFFERENTIABILITY NCERT Solvd mpls upto th sction 5 (Introduction) nd 5 (Continuity) : Empl : Chck th continuity of th function f givn by f() = + t = Empl : Emin whthr th function f

More information

The graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the

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

More information

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

The Matrix Exponential

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

More information

Lie Groups HW7. Wang Shuai. November 2015

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

More information

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x,

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x, Clculus for Businss nd Socil Scincs - Prof D Yun Finl Em Rviw vrsion 5/9/7 Chck wbsit for ny postd typos nd updts Pls rport ny typos This rviw sht contins summris of nw topics only (This rviw sht dos hv

More information

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths. How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0

More information

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

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

More information

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f

More information

REPRESENTATIONS OF LIE GROUPS AND LIE ALGEBRAS

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

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS VSRT MEMO #05 MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS 01886 Fbrury 3, 009 Tlphon: 781-981-507 Fx: 781-981-0590 To: VSRT Group From: Aln E.E. Rogrs Subjct: Simplifid

More information

Section 11.6: Directional Derivatives and the Gradient Vector

Section 11.6: Directional Derivatives and the Gradient Vector Sction.6: Dirctional Drivativs and th Gradint Vctor Practic HW rom Stwart Ttbook not to hand in p. 778 # -4 p. 799 # 4-5 7 9 9 35 37 odd Th Dirctional Drivativ Rcall that a b Slop o th tangnt lin to th

More information

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013 CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or

More information

1 Minimum Cut Problem

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

More information

( ) Geometric Operations and Morphing. Geometric Transformation. Forward v.s. Inverse Mapping. I (x,y ) Image Processing - Lesson 4 IDC-CG 1

( ) Geometric Operations and Morphing. Geometric Transformation. Forward v.s. Inverse Mapping. I (x,y ) Image Processing - Lesson 4 IDC-CG 1 Img Procssing - Lsson 4 Gomtric Oprtions nd Morphing Gomtric Trnsformtion Oprtions dpnd on Pil s Coordints. Contt fr. Indpndnt of pil vlus. f f (, ) (, ) ( f (, ), f ( ) ) I(, ) I', (,) (, ) I(,) I (,

More information

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued... Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th

More information