September 30, :24 WSPC/Guidelines Y4Spanner

Size: px
Start display at page:

Download "September 30, :24 WSPC/Guidelines Y4Spanner"

Transcription

1 Septemer 30, :24 WSPC/Guielines Y4Spnner Interntionl Journl of Computtionl Geometry & Applitions Worl Sientifi Pulishing Compny π/2-angle YAO GAPHS AE SPANNES POSENJIT BOSE Shool of Computer Siene, Crleton University Ottw, Cn MIELA DAMIAN Deprtment of Computer Siene, Villnov University Villnov, USA KAIM DOUÏEB Shool of Computer Siene, Crleton University Ottw, Cn JOSEPH O OUKE Deprtment of Computer Siene, Smith College Northmpton, USA orourke@s.smith.eu BEN SEAMONE Shool of Mthemtis n Sttistis, Crleton University Ottw, Cn semone@onnet.rleton. MICHIEL SMID Shool of Computer Siene, Crleton University Ottw, Cn mihiel@ss.rleton. STEFANIE WUHE Institute for Informtion Tehnology, Ntionl eserh Counil Ottw, Cn stefnie.wuhrer@nr-nr.g. We show tht the Yo grph Y 4 in the L 2 metri is spnner with streth ftor 8 2( ). Enroute to this, we lso show tht the Yo grph Y4 in the L metri is plne spnner with streth ftor 8. Keywors: Yo grph; Y4; spnner. 1

2 Septemer 30, :24 WSPC/Guielines Y4Spnner 2 Bose, Dmin, Douïe, O ourke, Semone, Smi n Wuhrer 1. Introution Let V e finite set of points in the plne n let G = (V, E) e the omplete Eulien grph on V. We will refer to the points in V s noes, to istinguish them from other points in the plne. The Yo grph 8 with n integer prmeter k > 0, enote Y k, is efine s follows. Any k eqully-seprte rys strting t the origin efine k ones. Pik set of ritrry, ut fixe ones. Trnslte the ones to eh noe u V. In eh one with pex u, pik shortest ege uv, if there is one, n to Y k the irete ege uv. Ties re roken ritrrily. Note tht the Yo grph iffers from the Θ-grph in how the shortest ege is hosen. While the Yo grph hooses the shortest ege in terms of the Eulien istne, the Θ-grph hooses the ege whose projetion on the isetor of the one is shortest. Most of the time we ignore the iretion of n ege uv; we refer to the irete version uv of uv only when its origin (u) is importnt n unler from the ontext. We will istinguish etween Y k, the Yo grph in the Eulien L 2 metri, n Yk, the Yo grph in the L metri. Unlike Y k however, in onstruting Yk ties re roken y lwys seleting the most ounterlokwise ege; the reson for this hoie will eome ler in Setion 2. The length of pth is the sum of the lengths of its onstituent eges. For given sugrph H G n fixe t 1, H is lle t-spnner for G if, for ny two noes u, v V, the shortest pth in H from u to v is no longer thn t times the length uv of uv. The vlue t is lle the iltion or the streth ftor of H. If t is onstnt, then H is lle length spnner, or simply spnner. The lss of grphs Y k hs een muh stuie. Bose et l. 2 showe tht, for k 1 9, Y k is spnner with streth ftor. In ef. 1 we improve the streth os 2π k sin 2π k ftor n showe tht, in ft, Y k is spnner for ny k 7. eently, Dmin n uonis 4 showe tht Y 6 is 17.7-spnner. Moll 6 showe tht Y 2 n Y 3 re not spnners, n tht Y 4 is spnner with streth ftor 4(2 + 2), for the speil se when the noes in V re in onvex position (see lso ef. 3 ). The uthors onjeture tht Y 4 is spnner for ritrry point sets. In this pper, we settle their onjeture n prove tht Y 4 is spnner with streth ftor 8 2( ). The pper is orgnize s follows. In Setion 2, we prove tht the grph Y4 is spnner with streth ftor 8. In Setion 3 we estlish severl properties for the grph Y 4. Finlly, in Setion 4, we use the properties of Setion 3 to prove tht, for every ege in Y4, there exists pth etween n in Y 4 not muh longer thn the Eulien istne etween n. By omining this with the result of Setion 2, we onlue tht Y 4 is spnner. 2. Y 4 in the L Metri In this setion we fous on Y4, whih hs nier struture ompre to Y 4. First we prove tht Y4 is plne grph. Then we use this property to show tht Y4 is n 8-spnner. To e more preise, we prove tht for ny two noes n, the grph Y4 ontins pth etween n whose length (in the L -metri) is t

3 Septemer 30, :24 WSPC/Guielines Y4Spnner π/2-angle Yo Grphs re Spnners 3 most 8. We nee few efinitions. We sy tht two eges n properly ross (or ross, for short) if they shre point other thn n enpoint (,, or ); we sy tht n interset if they shre point (either n interior point or n enpoint). Q () 1 P () 1 Q () 2 S(,) Q () Q () 3 4 () () j Fig. 1. () Definitions: Q i (), P i () n S(, ). () Lemm 1: n nnot ross. Throughout the pper, we will use the following nottion: for eh noe V, x() is the x-oorinte of n y() is the y-oorinte of ; Q 1 (), Q 2 (), Q 3 () n Q 4 () re the four qurnts t, epite in Fig. 1; eh qurnt is hlf-open n hlf-lose, inluing ll points on the lokwise ounry xis (with respet to the qurnt isetor through ), n exluing ll points on the ounterlokwise ounry xis; P i () is the pth tht strts t n follows the irete Yo eges in qurnt Q i ; P i (, ) is the supth of P i () tht strts t noe n ens t noe ; is the L istne etween n, efine s mx{ x() x(), y() y() }; sp(, ) is shortest pth in Y4 etween n ; S(, ) is the open squre with orner whose ounry ontins ; n S(, ) is the ounry of S(, ). These efinitions re epite in Fig. 1. Lemm 1. Y 4 is plne grph. Proof. The proof is y ontrition. Assume the opposite. Then there re two eges, Y4 tht ross eh other. Sine Y4, S(, ) must e empty of noes in V, n similrly for S(, ). Let j e the intersetion point etween n. Then j S(, ) S(, ), mening tht S(, ) n S(, ) must overlp. However, neither squre my ontin,, or. It follows tht S(, ) n S(, ) oinie, mening tht n lie on S(, ) (see Fig. 1). Sine intersets, n must lie on opposite sies of. Thus either or lies ounterlokwise from. Assume without loss of generlity tht lies ounterlokwise from ; the other se is ientil. Beuse S(, ) oinies with S(, ), we hve tht =. In this se however, Y4 woul rek the tie etween n y seleting the most ounterlokwise ege, whih is. This ontrits tht Y 4.

4 Septemer 30, :24 WSPC/Guielines Y4Spnner 4 Bose, Dmin, Douïe, O ourke, Semone, Smi n Wuhrer Theorem 1. Y 4 is n 8-spnner in the L metri. Proof. We show tht, for ny pir of points, V, sp(, ) < 8. The proof is y inution on the pirwise L -istne etween the points in V. Assume without loss of generlity tht Q 1 (), n = x() x() (i.e., lies elow the igonl of S(, ) inient to ). Consier the se in whih is losest (in the L metri) pir of points in V. This is the se se for our inution. If Y4, then sp(, ) =. Otherwise, there must e Y4, with =. ell tht Y4 reks ties y lwys seleting the most ounterlokwise ege, so must e ounterlokwise of. Also rell tht Q 1 () oes not inlue the vertil oorinte xis through, therefore lies stritly to the right of. It follows tht < (see Fig. 2), ontrition. S i r j i A e j r i A A () () () () r i e A (e) j Fig. 2. () Bse se. () empty () non-empty, P r P 2 () = {j} () non-empty, P r P 2 () =, e ove r (e) non-empty, P r P 2 () =, e elow r. Assume now tht the inutive hypothesis hols for ll pirs of points loser (in the L metri) thn. If Y4, then sp(, ) = n the proof is finishe. If / Y4, then the squre S(, ) must e nonempty. Let A e the retngle s in Fig. 2, where n re prllel to the igonls of S(, ). If A is nonempty, then we n use inution to prove tht sp(, ) 8 s follows. Pik A ritrry. Then + = x() x() + x() x() =, n y the inutive hypothesis sp(, ) sp(, ) is pth in Y4 no longer thn = 8 ; here represents the ontention opertor. Assume now tht A is empty. Let e t the intersetion etween the line supporting n the vertil line through (see Fig. 2). We isuss two ses, epening on whether is empty of points or not. Cse 1: is empty of points. Let P 1 (). We show tht P 4 () nnot ontin n ege rossing. Assume the opposite, n let st P 4 () ross. Note tht st P 4 () lso implies st P 4 (s), whih long with the ft tht st rosses, implies tht s is either vertilly ligne, or to the left of.. Sine is empty, s must lie ove n t elow. It follows tht n t re in the sme qurnt

5 Septemer 30, :24 WSPC/Guielines Y4Spnner π/2-angle Yo Grphs re Spnners 5 Q 4 (s) (rell tht this qurnt inlues the ownwr ry from s). Furthermore, st y(s) y(t) > y(s) y() = s, ontriting the ft tht st Y4. We hve estlishe tht P 4 () oes not ross, whih implies tht P 4 () must exit S(, ) through its right ege. Also note tht P 2 () nnot ross, euse is empty of points, n ny point left of is L -frther from thn. It follows tht P 2 () exits S(, ) through its top ege. This together with the ft tht P 4 () exits S(, ) through its right ege, implies tht P 4 () n P 2 () must meet in point i P 4 () P 2 () (see Fig. 2). Now note tht P 4 (, i) P 2 (, i) x() x() + y() y() < 2. Thus we hve tht sp(, ) P 4 (, i) P 2 (, i) < + 2 = 3. Cse 2: is nonempty. In this se, we seek short pth from to tht oes not ross to the unersie of, to voi osillting pths tht ross ritrrily mny times. Let r e the rightmost point tht lies insie. Arguments similr to the ones use in Cse 1 show tht P 3 (r) nnot ross n therefore it must meet P 1 () in point i. Then P r = P 1 (, i) P 3 (r, i) is pth in Y4 of length P r < x() x(r) + y() y(r) < + 2 = 3. (1) The term 2 in the inequlity ove results from the ft tht y() y(r) y() y() 2. Consier first the simpler sitution in whih P 2 () meets P r in point j P 2 () P r (see Fig. 2). Let P r (, j) e the supth of P r extening etween n j. Then P r (, j) P 2 (, j) is pth in Y4 from to, therefore sp(, ) P r (, j) P 2 (, j) < 2 y(j) y() + 5. Consier now the se when P 2 () oes not interset P r. We rgue tht, in this se, Q 1 (r) my not e empty. Assume the opposite. Then no ege st P 2 () my ross Q 1 (r). This is euse, for ny suh ege, sr < st, ontriting st Y4. This implies tht P 2 () intersets P r, gin ontrition to our ssumption. This estlishes tht Q 1 (r) is nonempty. Let r P 1 (r). The ft tht P 2 () oes not interset P r implies tht lies to the left of. The ft tht r is the rightmost point in implies tht lies outsie (see Fig. 2). It lso implies tht P 4 () shres no points with. This long with rguments similr to the ones use in se 1 show tht P 4 () n P 2 () meet in point j P 4 () P 2 (). Thus we hve foun pth P = P 1 (, i) P 3 (r, i) r P 4 (, j) P 2 (, j). (2) extening from to in Y 4. If r = x() x(r), then r < x() x() =, n the pth P hs length P 2 y() y() + < 7. (3) In the ove, we use the ft tht y() y() = y() y(r) + y(r) y() < + 2. Suppose now tht r = y() y(r). (4)

6 Septemer 30, :24 WSPC/Guielines Y4Spnner 6 Bose, Dmin, Douïe, O ourke, Semone, Smi n Wuhrer In this se, it is unler whether the pth P efine y (2) is short, sine r n e ritrrily long ompre to. Let e e the lokwise neighor of long the pth P (e n my oinie). Then e lies elow, n either e P 4 (), or e P 2 (e) (or oth). If e lies ove r, or t the sme level s r (i.e., e Q 1 (r), s in Fig. 2), then y(e) y(r) < y() y(r). (5) Sine r P 1 (r) n e is in the sme qurnt of r s, we hve r re. This long with inequlities (4) n (5) implies re > y(e) y(r), whih in turn implies re = x(e) x(r), n so r. Then inequlity (3) pplies here s well, showing tht P < 7. If e lies elow r (s in Fig. 2e), then e y() y(e) y() y(r) = r. (6) Assume first tht e P 2 (e), or e = x(e) x(). In either se, e er < 2. This long with inequlity (6) shows tht r < 2. Sustituting this upper oun in (2), we get P 2 y() y() + 2 < 8. Assume now tht e P 2 (e), n e = y(e) y(). Then ee P 2 (e) nnot go ove (otherwise e < ee, ontriting ee P 2 (e)). This long with the ft e P 4 () implies tht P 2 (e) intersets P r in point k. eefine P = P r (, k) P 2 (e, k) P 4 (e, j) P 2 (, j). Then P is pth in Y4 from to of length P 2 y(r) y() + 5. This theorem will e employe in Setion Y 4 in the L 2 Metri In this setion we estlish si properties of Y 4. The ultimte gol of this setion is to show tht, if two eges in Y 4 ross, there is short pth etween their enpoints (Lemm 8). We egin with few efinitions. Let Q(, ) enote the infinite qurnt with origin t tht ontins. For pir of noes, V, efine reursively irete pth P( ) from to in Y 4 s follows. If =, then P( ) = null. If, there must exist Y 4 tht lies in Q(, ). In this se, efine P( ) = P( ). ell tht represents the ontention opertor. This efinition is illustrte in Fig. 3. Fisher et l. 5 show tht P( ) is well efine n lies entirely insie the squre entere t whose ounry ontins. For ny pth P n ny pir of noes, P, let P [, ] e the supth of P from to. Let (, ) e the lose xis-ligne retngle with igonl (we permit (, ) to e egenerte retngle, when is either horizontl or vertil). For fixe pir of noes, V, efine pth P ( ) s follows. Let e V e the first noe long P( ) tht is not stritly interior to (, ). Then

7 Septemer 30, :24 WSPC/Guielines Y4Spnner π/2-angle Yo Grphs re Spnners 7 Q () 2 y Q () 1 (,) x Q(, ) Q () Q () 3 4 () h () P ( ) e Fig. 3. Definitions. () Q(, ) n P( ). () P ( ). P ( ) is the supth of P( ) tht extens etween n e. In other wors, P ( ) is the pth tht follows the Y 4 eges pointing towrs, trunte s soon s it rehes or leves (, ). Formlly, P ( ) = P( )[, e]. This efinition is illustrte in Fig. 3. Our proofs will mke use of the following two propositions. Proposition 1. The sum of the lengths of rossing igonls of non-egenerte (neessrily onvex) qurilterl is stritly greter thn the sum of the lengths of either pir of opposite sies: + > + + > +. This n e prove y prtitioning the igonls into two piees eh t their intersetion point, n then pplying the tringle inequlity twie. Proposition 2. For ny tringle, the following inequlities hol: < 2 + 2, if < π/2 2 = 2 + 2, if = π/2 > 2 + 2, if > π/2 This proposition follows immeitely from the Lw of Cosines pplie to tringle. Lemm 2. For eh pir of noes, V, P ( ) 2. (7) Furthermore, eh ege of P ( ) is no longer thn. Proof. Let e one of the two orners of (, ), other thn n. Let e P ( ) e the lst ege on P ( ), whih neessrily intersets (, )

8 Septemer 30, :24 WSPC/Guielines Y4Spnner 8 Bose, Dmin, Douïe, O ourke, Semone, Smi n Wuhrer (note tht it is possile tht e = ). efer to Fig. 3. Then e, otherwise e oul not e in Y4. Sine lies in the retngle with igonl, we hve tht, n similrly for eh ege on P ( ). This estlishes the ltter lim of the lemm. For the first lim of the lemm, let p = P ( )[, ]. Sine e, we hve tht P ( ) p. Sine p lies entirely insie (, ) n onsists of eges pointing towrs, we hve tht p is n xy-monotone pth (i.e., ny line prllel to oorinte xis intersets p in t most one point). It follows tht p +, whih is oune ove y 2. j Fig. 4. Lemm 3: if n ross, they nnot oth e in Y 4. Lemm 3. Let,,, V e four isjoint noes suh tht, Y 4, Q i () n Q i (), for some i {1, 2, 3, 4}. Then n nnot ross. Proof. We my ssume without loss of generlity tht i = 1 n is to the left of. The proof is y ontrition. Assume tht n ross eh other. Let j e the intersetion point etween n (see Fig. 4). Sine j Q 1 () Q 1 (), it follows tht Q 1 () n Q 1 (). Thus, euse otherwise, nnot e in Y 4. By Proposition 1 pplie to the qurilterl, + < +. This long with implies tht <, ontriting tht Y 4. The next four lemms (4 7) eh onern pir of rossing Y 4 eges, ulminting (in Lemm 8) in the onlusion tht there is short pth in Y 4 etween pir of enpoints of those eges. We hoose to efer the proofs of lemms 4 6 to the ppenix, for etter unerstning of the logil flow of our nlysis. Lemm 4. Let,, n e four isjoint noes in V suh tht, Y 4, n rosses. Then (i) the rtio etween the shortest sie n the longer igonl of the qurilterl is no greter thn 1/ 2, n (ii) the shortest sie of the qurilterl is stritly shorter thn either igonl. Lemm 5. Let,,, e four istint noes in V, with Q 1 (), suh tht (i) Q1 () n Q 2 () re in Y 4 n ross eh other, n (ii) is shortest

9 Septemer 30, :24 WSPC/Guielines Y4Spnner π/2-angle Yo Grphs re Spnners 9 sie of qurilterl. Then P ( ) n P ( ) hve nonempty intersetion. Lemm 6. Let,,, e four istint noes in V, with Q 1 (), suh tht (i) Q1 () n Q 3 () re in Y 4 n ross eh other, n (ii) is shortest sie of qurilterl. Then P ( ) oes not ross. The next lemm relies on ll of Lemms 2 6. Lemm 7. Let,,, V e four istint noes suh tht Y 4 rosses Y4, n let xy e shortest sie of the qurilterl. Then there exist two pths P x n P y in Y 4, where P x hs x s n enpoint n P y hs y s n enpoint, with the following properties: (i) P x n P y hve nonempty intersetion. (ii) P x + P y 3 2 xy. (iii) Eh ege on P x P y is no longer thn xy. Proof. Assume without loss of generlity tht Q 1 (). We isuss the following exhustive ses: (1) Q 1 (), n Q 1 (). In this se, n nnot ross eh other (y Lemm 3), so this se is finishe. x x () y () () () (e) P (y ) y P ( y) Fig. 5. Lemm 7: (, ) Q 1 () () Q 2 () () Q 4 (). (2) Q 1 (), n Q 2 (), s in Fig. 5. Sine Y 4,. Sine rosses, n, Q 2 (). Sine Y 4,. These long

10 Septemer 30, :24 WSPC/Guielines Y4Spnner 10 Bose, Dmin, Douïe, O ourke, Semone, Smi n Wuhrer with Lemm 4 imply tht n re the only nites for shortest ege of. Assume first tht is shortest ege of. By Lemm 3, P = P ( ) oes not ross, euse P Q 2 () n Q 2 () re in the qurnts of ientil inies. It follows from Lemm 5 tht P n P = P ( ) hve nonempty intersetion. Furthermore, y Lemm 2, P 2 n P 2, n no ege on these pths is longer thn, proving the lemm true for this se. Consier now the se when is shortest ege of (see Fig. 5). Note tht is elow (otherwise, Q 2 () n > ) n, therefore, Q 1 (). By Lemm 3, P = P ( ) oes not ross, euse P Q 1 () n Q 1 (). If P = P ( ) oes not ross, then P n P hve nonempty intersetion, proving the lemm true for this se. Otherwise, there exists xy P ( ) tht rosses (see Fig. 5). Define P = P ( ) P (y ) P = P ( y). By Lemm 3, P (y ) oes not ross, euse they re oth in qurnt Q 2. Then P n P must hve nonempty intersetion. We now show tht P n P stisfy onitions (i) n (iii) of the lemm. Proposition 1 pplie on the qurilterl xy tells us tht x + y < xy +. We lso hve tht x, sine Y 4 n x is in the sme qurnt of s. This long with the inequlity ove implies y < xy. Beuse xy P ( ), y Lemm 2 we hve tht xy, whih long with the previous inequlity shows tht y <. This long with Lemm 2 shows tht onition (iii) of the lemm is stisfie. Furthermore, P (y ) y 2 n P ( y) y 2. It follows tht P + P 3 2. (3) Q 1 (), n Q 3 (), s in Fig. 5. Then mx{, }, n y Lemm 4 is not shortest ege of. The se when is shortest ege of is settle y Lemms 3 n 2: Lemm 3 tells us tht P = P ( ) oes not ross, (euse they re oth in Q 1,) n P = P ( ) oes not ross (euse they re oth in Q 3 ). It follows tht P n P hve nonempty intersetion. Furthermore, Lemm 2 gurntees tht P n P stisfy onitions (ii) n (iii) of the lemm. Consier now the se when is shortest ege of ; the se when is shortest is symmetri. By Lemm 6, P ( ) oes not ross. If P ( ) oes not ross, then this se is settle: P = P ( ) n P = P ( ) stisfy the three onitions of the lemm. Otherwise, let xy P ( ) e the ege rossing. Arguments similr to the ones use in se 1 ove show tht P = P ( ) P (y ) n P = P ( y) re two pths tht stisfy the onitions of the lemm. (4) Q 1 (), n Q 4 (), s in Fig. 5. Note tht horizontl refletion of Fig. 5, followe y rottion of π/2, epits se ientil to se (2), Fig. 5, whih hs lrey een settle.

11 Septemer 30, :24 WSPC/Guielines Y4Spnner π/2-angle Yo Grphs re Spnners 11 (5) Q 2 (), s in Fig. 5. Note tht Fig. 5 rotte y π/2 epits se ientil to se (2), Fig. 5 (with the roles of n swithe), whih hs lrey een settle. (6) Q 3 (). Then it must e tht Q 1 (), otherwise nnot ross. By Lemm 3 however, n my not ross, unless one of them is not in Y 4. (7) Q 4 (). By Lemm 3, my not lie in Q 1 (), therefore must e in Q 2 (), s in Fig. 5e. Note tht vertil refletion of Fig. 5e epits se ientil to se (2), Fig. 5 (with the roles of n swithe), so this se is settle s well. We re now rey to estlish the min lemm of this setion, showing tht there is short pth etween the enpoints of two interseting eges in Y 4. Lemm 8. Let,,, V e four istint noes suh tht Y 4 rosses Y4, n let xy e shortest sie of the qurilterl. Then Y 4 ontins pth p(x, y) onneting x n y, of length p(x, y) xy. Furthermore, no ege on p(x, y) is longer thn xy. Proof. Let P x n P y e the two pths whose existene in Y 4 is gurntee y Lemm 7. By onition (iii) of Lemm 7, no ege on P x n P y is longer thn xy. By onition (i) of Lemm 7, P x n P y hve nonempty intersetion. If P x n P y shre noe u V, then the pth p(x, y) = P x [x, u] P y [y, u] is pth from x to y in Y 4 no longer thn 3 2 xy ; the length restrition follows from gurntee (ii) of Lemm 7. Otherwise, let P x n P y e two eges rossing eh other. Let x y e shortest sie of the qurilterl, with x P x n y P y. Lemm 7 tells us tht xy n xy. These long with Lemm 4 imply tht x y xy / 2. (8) This enles us to erive reursive formul for omputing pth p(x, y) Y 4 s follows: { x, if x = y p(x, y) = (9) P x [x, x ] P y [y, y ] p(x, y ), if x y. Next we use inution on the length of xy to prove the lim of the lemm. The se se orrespons to x = y. In this se p(x, y) egenertes to point n p(x, y) = 0. To prove the inutive step, pik shortest sie xy of qurilterl, with, Y 4 rossing eh other, n ssume tht the lemm hols for ll suh sies shorter thn xy. Let p(x, y) e the pth etermine reursively s in (9). By the inutive hypothesis, we hve tht p(x, y ) ontins no eges longer thn x y xy, n p(x, y ) x y 6 2 xy. (10) 2

12 Septemer 30, :24 WSPC/Guielines Y4Spnner 12 Bose, Dmin, Douïe, O ourke, Semone, Smi n Wuhrer This ltter inequlity follows from (8). Also rell tht no ege on P x n P y is longer thn xy, whih together with formul (9) n the rguments ove, implies tht no ege on p(x, y) is longer thn xy. Sustituting inequlities 10 n (ii) from Lemm 7 in formul (9) yiels This ompletes the proof. p(x, y) ( ) xy = xy. 4. Y 4 n Y 4 The finl step of our nlysis is to prove tht every iniviul ege of Y 4 is spnne y short pth in Y 4. This, long with the result of Theorem 1, estlishes tht Y 4 is spnner. Fix n ege Y 4. Cll n ege or pth t-short (with respet to ) if its length is within onstnt ftor t of. In our proof tht is spnne y t-short pth in Y 4, we will mke use of the following three sttements (prove in the Appenix). S1 If xy is t-short, then P (x y), n therefore its reverse, P 1 (x y) re t 2-short y Lemm 2. S2 If xy Y 4 is t 1 -short n zw Y 4 is t 2 -short, n if xy intersets zw, Lemm 4(ii) n Lemm 8 show tht there is t 3 -short pth etween ny two of the enpoints of these eges, with t 3 = t 1 + t 2 + 3(2 + 2) mx(t 1, t 2 ). S3 If p(x, y) is t 1 -short pth n p(z, w) is t 2 -short pth n these two pths interset, then y S2 there is t 3 -short pth P etween ny two of the enpoints of these pths, with t 3 = t 1 + t 2 + 3(2 + 2) mx(t 1, t 2 ). Lemm 9. Fix n ege Y 4. There is pth p(, ) Y 4 etween n, of length p(, ) t, for t = Proof. For the ske of lrity, we only prove here tht there is short pth p(, ) etween n, n n efer the lultion of the tul streth ftor t to the Appenix. We refer to n ege or pth s short if its length is within onstnt ftor of. Assume without loss of generlity tht Q 1 (). If Y 4, then p(, ) = n the proof is finishe. So ssume the opposite, n let e the ege in Y 4 tht lies in Q 1 (); sine Q 1 () is nonempty, exists. Beuse Y 4 n is in the sme qurnt of s, we hve tht (i) < 2 (ii). (11) Inequlity (ii) ove follows immeitely from the Lw of Cosines, whih implies tht 2 < (euse the ngle forme y n is stritly less thn π/2), n the ft tht. Thus oth n re short. An this

13 Septemer 30, :24 WSPC/Guielines Y4Spnner π/2-angle Yo Grphs re Spnners 13 in turn implies tht P ( ) is short y S1. We next fous on P ( ). For simpliity, we ssume tht is ounterlokwise of ; the sitution when lies lokwise of is symmetril. Let / (, ) e the other enpoint of P ( ). We istinguish three ses. P ( ) e P ( ) s P ( ) P ( ) () () P (e ) P ( ) x r e () Fig. 6. Lemm 9: () Cse 1: P ( ) n hve nonempty intersetion. () Cse 2: P ( ) n hve n empty intersetion. () Cse 3: P ( ) n hve non-empty intersetion. Cse 1: P ( ) n interset (see Fig. 6). Then y S3 there is short pth p(, ) etween n. Cse 2: P ( ) n o not interset, n P ( ) n o not interset (see Fig. 6). Note tht euse is the enpoint of the short pth P ( ), the tringle inequlity on implies tht is short, n therefore P ( ) is short, y S1. We onsier two ses: (i) P ( ) intersets. Then y S3 there is short pth p(, ). So p(, ) = p(, ) P 1 ( ) is short. (ii) P ( ) oes not interset. Then P ( ) must interset P ( ) P ( ). Next we estlish tht is short. Let e e the lst ege of P ( ), n so inient to (note tht e n my oinie). Beuse P ( ) oes not interset, n re in the sme qurnt for e. It follows tht e e n e < π/2. These oservtions long with Proposition 2 for e imply tht 2 < e 2 + e 2 2 e 2 < 2 2 (this ltter inequlity uses the ft tht e > π/2, whih implies tht e < ). It follows tht 2 2 (y (11)ii). (12) Thus is short, n y S1 we hve tht P ( ) is short. Sine P ( ) intersets the short pth P ( ) P ( ), there is y S3 short pth

14 Septemer 30, :24 WSPC/Guielines Y4Spnner 14 Bose, Dmin, Douïe, O ourke, Semone, Smi n Wuhrer p(, ), n so is short. p(, ) = p(, ) Cse 3: P ( ) n o not interset, n P ( ) intersets (see Fig. 6). If P ( ) intersets t, then p(, ) = P ( ) P ( ) is short. So ssume otherwise, in whih se there is n ege e P ( ) tht rosses. Then Q 1 (), e Q 3 () Q 4 (), n e n re in the sme qurnt for. Note however tht e nnot lie in Q 3 (), sine in tht se e > π/2, whih woul imply e >, whih in turn woul imply e / Y 4. So it must e tht e Q 4 (). Next we show tht P (e ) oes not ross. Assume the opposite, n let rs P (e ) ross. Then r Q 4 (), s Q 1 () Q 2 (), n s n re in the sme qurnt for r. Arguments similr to the ones ove show tht s / Q 2 (), so s must lie in Q 1 (). Let δ e the L istne from to. Let x e the projetion of r on the horizontl line through. Then rs rx + δ rx + x > r (y the tringle inequlity) Beuse n s re in the sme qurnt for r, the inequlity ove ontrits rs Y4. We hve estlishe tht P (e ) oes not ross. Then P ( e) must interset P = e P (e ). Note tht e is short euse it is in the short pth P ( ). Thus e is short (euse e < i + ei < + e, where i is the intersetion point etween n e), n so P ( e) n P (e ) re short, y S1. Then the short pth P ( e) intersets either e or P (e ), eh of whih is short, n y S3 there is short pth p(, e). Then p(, ) = p(, e) P 1 ( ) P 1 ( ) is short. Strightforwr lultions etile in the ppenix show tht, in eh of these ses, the streth ftor for p(, ) oes not exee Our min result follows immeitely from Theorem 1 n Lemm 9: Theorem 2. Y 4 is t-spnner, for t 8 2( ). 5. Conlusion Our results settle long-stning open prolem, sking whether Y 4 is spnner or not. We nswer this question positively, n estlish loose streth ftor of 8 2( ). Fining tighter streth ftors for oth Y4 n Y 4 remin interesting open prolems. Estlishing whether or not Y 5 is spnner is lso open.

15 Septemer 30, :24 WSPC/Guielines Y4Spnner π/2-angle Yo Grphs re Spnners 15 Aknowlegements. We thnk the reviewers for their reful reing n useful omments. The first uthor ws supporte y NSEC. The seon uthor ws supporte in prt y NSF grnt CCF n y Villnov s Center of Exellene in Enterprise Tehnology. eferenes 1. P. Bose, M. Dmin, K. Douïe, J. O ourke, B. Semone, M. Smi n S. Wuhrer, π/2-angle Yo Grphs re Spnners, Tehnil eport (2010) rxiv: v1. 2. P. Bose, A. Mheshwri, G. Nrsimhn, M. Smi n N. Zeh, Approximting geometri ottlenek shortest pths, Computtionl Geometry: Theory n Applitions (2004) 29: M. Dmin, N. Moll n V. Piniu, Spnner properties of π/2-ngle Yo grphs, in Pro. of the 25th Europen Workshop on Computtionl Geometry (Mrh 2009) pp M. Dmin n K. uonis, Yo grphs spn Thet grphs, in Pro. of the 4th Annul Interntionl Conferene on Comintoril Optimiztion n Applitions (Deemer 2010) pp M. Fisher, T. Lukovszki n M. Ziegler, Geometri serhing in wlkthrough nimtions with wek spnners in rel time, in Pro. of the 6th Annul Europen Symposium on Algorithms (1998) pp N. Moll, Yo spnners for wireless ho networks, M.S. Thesis, Deprtment of Computer Siene, Villnov University (Deemer 2009). 7. J.W. Green, A note on the hors of onvex urve, Portuglie Mthemti (1951) 10(3): A.C.-C. Yo, On onstruting minimum spnning trees in k-imensionl spes n relte prolems, SIAM Journl on Computing (1982) 11(4):

16 Septemer 30, :24 WSPC/Guielines Y4Spnner 16 Bose, Dmin, Douïe, O ourke, Semone, Smi n Wuhrer 6. Appenix 6.1. Proof of Lemm 4 For ny noe V, let D(, r) enote the open isk entere t of rius r, n let D(, r) enote the ounry of D(, r). Proof. The first prt of the lemm is well-known ft tht hols for ny qurilterl (see ef. 7, for instne). For the seon prt of the lemm, let e the shorter of the igonls of, n ssume without loss of generlity tht Q 1 (). Imgine two isks D = D(, ) n D = D(, ), s in Fig. 7. If either or elongs to D D, then the lemm follows: shortest qurilterl ege is shorter thn. 1 1 k 2 4 i l 3 () j 3 () Fig. 7. Lemm 4 () / () 1. So suppose tht neither nor lies in D D. In this se, we use the ft tht rosses to show tht nnot e n ege in Y 4. Define the following regions (see Fig. 7): 1 = (Q 1 () Q 2 ())\(D D ) 2 = (Q 2 () Q 3 ())\(D D ) 3 = (Q 4 () Q 3 ())\(D D ) 4 = (Q 1 () Q 4 ())\(D D ). If the noe is not insie ny of the regions i, for i = {1, 2, 3, 4}, then the noes n re in the sme qurnt of s. In this se, note tht either > π/2 or > π/2, whih implies tht either or is stritly smller thn. These together show tht / Y 4. So ssume tht is in i for some i {1, 2, 3, 4}. In this sitution, the noe must lie in the region j, with j = (i + 2) mo 4 (with the unerstning tht

17 Septemer 30, :24 WSPC/Guielines Y4Spnner π/2-angle Yo Grphs re Spnners 17 0 = 4 ), euse otherwise, either (i) n re in the sme qurnt of n < or (ii) n re in the sme qurnt of n <. Either se ontrits the ft Y 4. Consier now the se 1 n 3 ; the other ses re trete similrly. Let i n j e the intersetion points etween D n the vertil line through. Similrly, let k n l e the intersetion points etween D n the vertil line through (see Fig. 7). Sine ij is imeter of D, we hve tht ij = π/2 n similrly kl = π/2. Also note tht ij = π/2, mening tht >. Similrly, kl = π/2, mening tht >. These long with the ft tht t lest one of n is in the sme qurnt for s, imply tht / Y 4. This ompletes the proof Proof of Lemm 5 Proof. The proof onsists of two prts showing tht the following lims hol: (I) Q 2 () n (II) P ( ) oes not ross. Before we prove these two lims, let us rgue tht they re suffiient to prove the lemm. Lemm 3 n lim (I) imply tht P ( ) nnot ross, euse P ( ) Q 2 () n Q 2 () re in qurnts of ientil inies. As result, P ( ) intersets the left sie of the retngle (, ). Consier the lst ege xy of the pth P ( ). If this ege rosses the right sie of (, ), then lim (II) implies tht y is in the wege oune y n the upwrs vertil ry strting t ; this further implies tht y <, ontriting the ft tht is n ege in Y 4. Therefore, xy intersets the ottom sie of (, ), n the lemm follows (see Fig. 8). To prove the first lim (I), we oserve tht the lemm ssumptions imply tht Q 1 () Q 2 (). Therefore, it suffies to prove tht is not in Q 1 (). Assume to the ontrry tht Q 1 (). Sine Q 1 (), it must e tht Q 2 (); otherwise, π/2, whih implies >, ontriting the ft tht Y 4. Let i n j e the intersetion points etween n D(, ), where i is to the left of j. Sine ij > π/2, we hve <. This, together with the ft tht n re in the sme qurnt Q 2 (), ontrits the ssumption tht is n ege in Y 4. This ompletes the proof of lim (I). Next we prove lim (II) y ontrition. Thus, we ssume tht there is n ege xy on the pth P ( ) tht rosses. Then neessrily x (, ) n y Q 1 () Q 4 (). If y Q 4 (), then xy > π/2, mening tht xy > x, ontrition to the ft tht xy Y 4. Thus, it must e tht y Q 1 (), s in Fig. 8. This implies tht y, euse Y 4. The ontrition to our ssumption tht xy rosses will e otine y proving tht xy > x. Inee, this inequlity ontrits the ft tht xy Y 4, euse oth n y re in Q 4 (x), n Y 4 woul hve pike x in ple of xy. Let δ e the istne from x to the horizontl line through. Our intermeite gol is to show tht δ / 2. (13)

18 Septemer 30, :24 WSPC/Guielines Y4Spnner 18 Bose, Dmin, Douïe, O ourke, Semone, Smi n Wuhrer δ x i j () y P ( ) () P ( ) Fig. 8. () Lemm 5: xy P ( ) nnot ross. We lim tht < π/2. Inee, if this is not the se, then <, ontriting the ft tht is n ege in Y 4. By similr rgument, n using the ft tht is n ege in Y 4, we otin the inequlity < π/2. We now onsier two ses, epening on the reltive lengths of n. (1) Assume first tht >. If π/2, then >, ontriting the ft tht is n ege in Y 4 (rell tht n re in the sme qurnt of ). Therefore, we hve < π/2. So fr we hve estlishe tht three ngles of the onvex qurilterl re ute. It follows tht the fourth one ( ) is otuse. Proposition 2 pplie to tells us tht 2 > , where the ltter inequlity follows from the ssumption tht is shortest sie of (n, therefore, ). Thus, we hve tht / 2. This long with the ft tht x (, ) implies inequlity (13). (2) Assume now tht. Let i e the intersetion point etween n the horizontl line through (refer to Fig. 8). Note tht i π/2 n i π/2 (these two ngles sum to π). This long with Proposition 2 pplie to tringle i shows tht 2 i 2 + i 2. Similrly, Proposition 2 pplie to tringle i shows tht 2 i 2 + i 2. The two inequlities ove long with our ssumption tht imply tht i i, whih in turn implies tht i /2, euse i + i =. Sine x is elow i (otherwise, x <, ontriting the ft tht is n ege in Y 4 ), we hve δ i. It follows tht δ /2. Finlly we erive ontrition using the now estlishe inequlity (13). Let j e the orthogonl projetion of x onto the vertil line through (thus j = δ).

19 Septemer 30, :24 WSPC/Guielines Y4Spnner π/2-angle Yo Grphs re Spnners 19 Note tht jy < π/2, euse y Q 4 (x). By Proposition 2 pplie to jy, we hve y 2 < j 2 + jy 2 = δ 2 + jy 2. Sine y n re in the sme qurnt of, n sine Y 4, we hve tht y. This long with the inequlity ove n (13) implies tht jy / 2 δ. By Proposition 2 pplie to xjy, we hve xy 2 > xj 2 + jy 2 xj 2 + δ 2 = xj 2 + j 2 = x 2. It follows tht xy > x, ontriting our ssumption tht xy Y Proof of Lemm 6 Proof. We first show tht / Q 3 (). Assume the opposite. Sine Q 1 () n x x y > y x y () xy > x () Fig. 9. Lemm 6: () P ( ) oes not ross. () If is not the shortest sie of, the lemm onlusion might not hol. Q 3 (), we hve tht > π/2. This implies tht <, whih long with the ft tht, Q 3 () ontrit the ft tht Y 4. Also note tht / Q 1 (), sine in tht se n oul not interset. In the following we isuss the se Q 2 (); the se Q 4 () is symmetri. A first oservtion is tht must lie elow ; otherwise < (sine > π/2), whih woul ontrit the ft tht Y 4. We now prove y ontrition tht there is no ege in P ( ) rossing. Assume the ontrry, n let xy P ( ) e suh n ege. Then neessrily x (, ) n xy Q 4 (x). Note tht y nnot lie elow ; otherwise x < xy (sine xy > π/2), whih woul ontrit the ft tht xy Y 4. Also y must lie outsie D(, ) Q(, ), otherwise oul not e in Y 4. These together show tht y sits to the right of. See Fig. 9. Then the following inequlities regring the qurilterl xy must hol:

20 Septemer 30, :24 WSPC/Guielines Y4Spnner 20 Bose, Dmin, Douïe, O ourke, Semone, Smi n Wuhrer (i) y >, ue to the ft tht y > π/2. (ii) x ( x = if x n oinie). If x n re istint, the inequlity x > follows from the ft tht x (sine x is outsie D(, )), n Proposition 1 pplie to the qurilterl x: + x < x + Inequlities (i) n (ii) show tht y n x re longer thn sies of the qurilterl, n so they must e longer thn the shortest sie of, whih y ssumption (ii) of the lemm is : min{ x, y } x (this ltter inequlity follows from the ft tht x (, )). Also note tht y, sine Y 4 n y lies in the sme qurnt of s. The ft tht oth igonls of xy re in Y 4 enles us to pply Lemm 4(ii) to onlue tht y is not shortest sie of the qurilterl xy. Thus x is shortest sie of the qurilterl xy, n we n use Lemm 4(ii) to lim tht x < min{ xy, } xy. This ontrits our ssumption tht xy Y 4. Fig. 9() shows tht the lim of the lemm might e flse without ssumption (ii) Clultions for the streth ftor of p(, ) in Lemm 9 We strt y omputing the streth ftor of the short pths lime y sttements S2 n S3. S2 If xy Y 4 n zw Y 4 re short, n if xy intersets zw, then there is short pth P etween ny two of the enpoints of these eges, of length P xy + zw + 3(2 + 2) mx{ xy, zw }. (14) This upper oun n e erive s follows. Let ij e shortest sie of the qurilterl xzyw. By Lemm 8, Y 4 ontins pth p(i, j) no longer thn 6( 2+1) ij. By Lemm 4, ij mx{ xy, zw }/ 2. These together with the ft tht P xy + zw + p(i, j) yiel inequlity (14). S3 Here we prove tighter version of this sttement: If p(x, y) n p(z, w) re short pths tht interset, then there is short pth P etween ny two of the enpoints of these pths, of length P p(x, y) + p(z, w) + 3(2 + 2) mx{ xy, zw }. (15) This follows immeitely from S2 n the ft tht no ege of p(x, y) p(z, w) is longer thn mx{ xy, zw } (y Lemm 8). Cse 1: P ( ) n interset. Then y S3 we hve

21 Septemer 30, :24 WSPC/Guielines Y4Spnner π/2-angle Yo Grphs re Spnners 21 p(, ) P (, ) + + 3(2 + 2) mx{, } (2 + 2) 2 (y (7), (11)ii) = 3( ) 3( ) (y (11)i). Cse 2(i): P ( ) n o not interset; P ( ) n o not interset; n P ( ) intersets. By S3, there is short pth p(, ) of length p(, ) P (, ) + + 3(2 + 2) mx{, } (2 + 2) mx{, } (y (7)). (16) Next we estlish n upper oun on. By the tringle inequlity, < + 3 (y (12)). (17) Sustituting this inequlity in (16) yiels p(, ) ( ). (18) Thus p(, ) = p(, ) P 1 ( ) is pth in Y 4 of length p(, ) p(, ) + 2 (y (7)) p(, ) + 2 (y (11)ii) ( ) (y (18)) ( ) (y (11)i). Cse 2(ii): P ( ) n o not interset; P ( ) n o not interset; n P ( ) oes not interset. Then P ( ) must interset P ( ) P ( ). By S3 there is short pth p(, ) of length p(, ) P ( ) + P ( ) + P ( ) + 3(2 + 2) mx{,, } ( + + ) 2 + 3(2 + 2) mx{,, } (y (7)). Inequlities (11)ii, (12) n (17) imply tht mx{,, } 3. Sustituting in the ove, we get p(, ) ( ) 2 + 9(2 + 2) ( ) (y (11)i). Thus p(, ) = p(, ) is pth in Y 4 from to of length p(, ) ( ) ( ) (y (11)i).

22 Septemer 30, :24 WSPC/Guielines Y4Spnner 22 Bose, Dmin, Douïe, O ourke, Semone, Smi n Wuhrer Cse 3: P ( ) n o not interset, n P ( ) intersets. If P ( ) intersets t, then p(, ) = P ( ) P ( ) is lerly short n oes not exee the spnning rtio of the lemm. Otherwise, there is n ege e P ( ) tht rosses, n P ( e) intersets e P (e ) (s estlishe in the proof of Lemm 9). If P ( e) intersets e, then y S3 there is short pth p(, e) of length p(, e) P ( e) + e + 3(2 + 2) mx{ e, e } (19) Otherwise, if P ( e) intersets P (e ), then y S3 there is short pth p(, e) of length p(, e) P ( e) + P (e ) + 3(2 + 2) e (20) A loose upper oun on e n e otine y employing Proposition 1 to the qurilterl e: e + < + e < +. Sustituting the upper oun for from (17) yiels e < (21) By Lemm 2, e (sine e P ( )), whih long with (17) implies Sustituting inequlities (7), (21) n (22) in (19) yiels e 3. (22) p(, e) ( ). Sustituting inequlities (7) n (21) in (20) gives p(, e) ( ), whih is looser upper oun tht pplies to oth ses. Then p(, ) = p(, e) P 1 is pth from to of length ( ) P 1 ( ) p(, ) ( ) (y (23), (17), (11)) = ( ).

New and Improved Spanning Ratios for Yao Graphs

New and Improved Spanning Ratios for Yao Graphs New n Improve Spnning Rtios for Yo Grphs Luis Br Déprtement Informtique Université Lire e Bruxelles lrfl@ul..e Rolf Fgererg Deprtment of Computer Siene University of Southern Denmrk rolf@im.su.k Anré vn

More information

CS 491G Combinatorial Optimization Lecture Notes

CS 491G Combinatorial Optimization Lecture Notes CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

More information

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into

More information

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite! Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:

More information

Monochromatic Plane Matchings in Bicolored Point Set

Monochromatic Plane Matchings in Bicolored Point Set CCCG 2017, Ottw, Ontrio, July 26 28, 2017 Monohromti Plne Mthings in Biolore Point Set A. Krim Au-Affsh Sujoy Bhore Pz Crmi Astrt Motivte y networks interply, we stuy the prolem of omputing monohromti

More information

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion

More information

CIT 596 Theory of Computation 1. Graphs and Digraphs

CIT 596 Theory of Computation 1. Graphs and Digraphs CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege

More information

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106 8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly

More information

Proportions: A ratio is the quotient of two numbers. For example, 2 3

Proportions: A ratio is the quotient of two numbers. For example, 2 3 Proportions: rtio is the quotient of two numers. For exmple, 2 3 is rtio of 2 n 3. n equlity of two rtios is proportion. For exmple, 3 7 = 15 is proportion. 45 If two sets of numers (none of whih is 0)

More information

Lecture 4: Graph Theory and the Four-Color Theorem

Lecture 4: Graph Theory and the Four-Color Theorem CCS Disrete II Professor: Pri Brtlett Leture 4: Grph Theory n the Four-Color Theorem Week 4 UCSB 2015 Through the rest of this lss, we re going to refer frequently to things lle grphs! If you hen t seen

More information

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if

More information

SEMI-EXCIRCLE OF QUADRILATERAL

SEMI-EXCIRCLE OF QUADRILATERAL JP Journl of Mthemtil Sienes Volume 5, Issue &, 05, Pges - 05 Ishn Pulishing House This pper is ville online t http://wwwiphsiom SEMI-EXCIRCLE OF QUADRILATERAL MASHADI, SRI GEMAWATI, HASRIATI AND HESY

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area

On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area Journl of Grph Algorithms n Applitions http://jg.info/ vol. 13, no. 2, pp. 153 177 (2009) On Clss of Plnr Grphs with Stright-Line Gri Drwings on Liner Are M. Rezul Krim 1,2 M. Siur Rhmn 1 1 Deprtment of

More information

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment

More information

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply

More information

A Study on the Properties of Rational Triangles

A Study on the Properties of Rational Triangles Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn

More information

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4 Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones

More information

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 ) Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us

More information

I 3 2 = I I 4 = 2A

I 3 2 = I I 4 = 2A ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents

More information

MCH T 111 Handout Triangle Review Page 1 of 3

MCH T 111 Handout Triangle Review Page 1 of 3 Hnout Tringle Review Pge of 3 In the stuy of sttis, it is importnt tht you e le to solve lgeri equtions n tringle prolems using trigonometry. The following is review of trigonometry sis. Right Tringle:

More information

Lecture 8: Abstract Algebra

Lecture 8: Abstract Algebra Mth 94 Professor: Pri Brtlett Leture 8: Astrt Alger Week 8 UCSB 2015 This is the eighth week of the Mthemtis Sujet Test GRE prep ourse; here, we run very rough-n-tumle review of strt lger! As lwys, this

More information

arxiv: v2 [math.co] 31 Oct 2016

arxiv: v2 [math.co] 31 Oct 2016 On exlue minors of onnetivity 2 for the lss of frme mtrois rxiv:1502.06896v2 [mth.co] 31 Ot 2016 Mtt DeVos Dryl Funk Irene Pivotto Astrt We investigte the set of exlue minors of onnetivity 2 for the lss

More information

arxiv: v1 [cs.dm] 24 Jul 2017

arxiv: v1 [cs.dm] 24 Jul 2017 Some lsses of grphs tht re not PCGs 1 rxiv:1707.07436v1 [s.dm] 24 Jul 2017 Pierluigi Biohi Angelo Monti Tizin Clmoneri Rossell Petreshi Computer Siene Deprtment, Spienz University of Rome, Itly pierluigi.iohi@gmil.om,

More information

Part I: Study the theorem statement.

Part I: Study the theorem statement. Nme 1 Nme 2 Nme 3 A STUDY OF PYTHAGORAS THEOREM Instrutions: Together in groups of 2 or 3, fill out the following worksheet. You my lift nswers from the reding, or nswer on your own. Turn in one pket for

More information

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or Multi-Grph We llow loops n multiple eges. G = (V, E.ψ)

More information

Maximum size of a minimum watching system and the graphs achieving the bound

Maximum size of a minimum watching system and the graphs achieving the bound Mximum size of minimum wthing system n the grphs hieving the oun Tille mximum un système e ontrôle minimum et les grphes tteignnt l orne Dvi Auger Irène Chron Olivier Hury Antoine Lostein 00D0 Mrs 00 Déprtement

More information

Maximizing Maximal Angles for Plane Straight-Line Graphs

Maximizing Maximal Angles for Plane Straight-Line Graphs Mximizing Mximl Angles for Plne Stright-Line Grphs Oswin Aihholzer 1, Thoms Hkl 1, Mihel Hoffmnn 2, Clemens Huemer 3, Attil Pór 4, Frniso Sntos 5, Bettin Spekmnn 6, n Birgit Vogtenhuer 1 1 Institute for

More information

Separable discrete functions: recognition and sufficient conditions

Separable discrete functions: recognition and sufficient conditions Seprle isrete funtions: reognition n suffiient onitions Enre Boros Onřej Čepek Vlimir Gurvih Novemer 21, 217 rxiv:1711.6772v1 [mth.co] 17 Nov 217 Astrt A isrete funtion of n vriles is mpping g : X 1...

More information

Solutions to Problem Set #1

Solutions to Problem Set #1 CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors

More information

2. There are an infinite number of possible triangles, all similar, with three given angles whose sum is 180.

2. There are an infinite number of possible triangles, all similar, with three given angles whose sum is 180. SECTION 8-1 11 CHAPTER 8 Setion 8 1. There re n infinite numer of possile tringles, ll similr, with three given ngles whose sum is 180. 4. If two ngles α nd β of tringle re known, the third ngle n e found

More information

Solids of Revolution

Solids of Revolution Solis of Revolution Solis of revolution re rete tking n re n revolving it roun n is of rottion. There re two methos to etermine the volume of the soli of revolution: the isk metho n the shell metho. Disk

More information

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,

More information

MATH 122, Final Exam

MATH 122, Final Exam MATH, Finl Exm Winter Nme: Setion: You must show ll of your work on the exm pper, legily n in etil, to reeive reit. A formul sheet is tthe.. (7 pts eh) Evlute the following integrls. () 3x + x x Solution.

More information

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem. 27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we

More information

Calculus Cheat Sheet. Integrals Definitions. where F( x ) is an anti-derivative of f ( x ). Fundamental Theorem of Calculus. dx = f x dx g x dx

Calculus Cheat Sheet. Integrals Definitions. where F( x ) is an anti-derivative of f ( x ). Fundamental Theorem of Calculus. dx = f x dx g x dx Clulus Chet Sheet Integrls Definitions Definite Integrl: Suppose f ( ) is ontinuous Anti-Derivtive : An nti-derivtive of f ( ) on [, ]. Divide [, ] into n suintervls of is funtion, F( ), suh tht F = f.

More information

6.5 Improper integrals

6.5 Improper integrals Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =

More information

Comparing the Pre-image and Image of a Dilation

Comparing the Pre-image and Image of a Dilation hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity

More information

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of: 22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)

More information

Section 2.1 Special Right Triangles

Section 2.1 Special Right Triangles Se..1 Speil Rigt Tringles 49 Te --90 Tringle Setion.1 Speil Rigt Tringles Te --90 tringle (or just 0-60-90) is so nme euse of its ngle mesures. Te lengts of te sies, toug, ve very speifi pttern to tem

More information

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014 S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown

More information

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t

More information

Eigenvectors and Eigenvalues

Eigenvectors and Eigenvalues MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.

More information

If the numbering is a,b,c,d 1,2,3,4, then the matrix representation is as follows:

If the numbering is a,b,c,d 1,2,3,4, then the matrix representation is as follows: Reltions. Solutions 1. ) true; ) true; ) flse; ) true; e) flse; f) true; g) flse; h) true; 2. 2 A B 3. Consier ll reltions tht o not inlue the given pir s n element. Oviously, the rest of the reltions

More information

Mathematical Proofs Table of Contents

Mathematical Proofs Table of Contents Mthemtil Proofs Tle of Contents Proof Stnr Pge(s) Are of Trpezoi 7MG. Geometry 8.0 Are of Cirle 6MG., 9 6MG. 7MG. Geometry 8.0 Volume of Right Cirulr Cyliner 6MG. 4 7MG. Geometry 8.0 Volume of Sphere Geometry

More information

CHENG Chun Chor Litwin The Hong Kong Institute of Education

CHENG Chun Chor Litwin The Hong Kong Institute of Education PE-hing Mi terntionl onferene IV: novtion of Mthemtis Tehing nd Lerning through Lesson Study- onnetion etween ssessment nd Sujet Mtter HENG hun hor Litwin The Hong Kong stitute of Edution Report on using

More information

EXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED

EXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED EXTENSION OF THE GCD STAR OF DAVID THEOREM TO MORE THAN TWO GCDS CALVIN LONG AND EDWARD KORNTVED Astrt. The GCD Str of Dvi Theorem n the numerous ppers relte to it hve lrgel een evote to shoing the equlit

More information

GM1 Consolidation Worksheet

GM1 Consolidation Worksheet Cmridge Essentils Mthemtis Core 8 GM1 Consolidtion Worksheet GM1 Consolidtion Worksheet 1 Clulte the size of eh ngle mrked y letter. Give resons for your nswers. or exmple, ngles on stright line dd up

More information

Algebra 2 Semester 1 Practice Final

Algebra 2 Semester 1 Practice Final Alger 2 Semester Prtie Finl Multiple Choie Ientify the hoie tht est ompletes the sttement or nswers the question. To whih set of numers oes the numer elong?. 2 5 integers rtionl numers irrtionl numers

More information

Logic, Set Theory and Computability [M. Coppenbarger]

Logic, Set Theory and Computability [M. Coppenbarger] 14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer

More information

STRAND I: Geometry and Trigonometry. UNIT 32 Angles, Circles and Tangents: Student Text Contents. Section Compass Bearings

STRAND I: Geometry and Trigonometry. UNIT 32 Angles, Circles and Tangents: Student Text Contents. Section Compass Bearings ME Jmi: STR I UIT 32 ngles, irles n Tngents: Stuent Tet ontents STR I: Geometry n Trigonometry Unit 32 ngles, irles n Tngents Stuent Tet ontents Setion 32.1 ompss erings 32.2 ngles n irles 1 32.3 ngles

More information

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233, Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.

More information

On the Spectra of Bipartite Directed Subgraphs of K 4

On the Spectra of Bipartite Directed Subgraphs of K 4 On the Spetr of Biprtite Direte Sugrphs of K 4 R. C. Bunge, 1 S. I. El-Znti, 1, H. J. Fry, 1 K. S. Kruss, 2 D. P. Roerts, 3 C. A. Sullivn, 4 A. A. Unsiker, 5 N. E. Witt 6 1 Illinois Stte University, Norml,

More information

Lesson 2.1 Inductive Reasoning

Lesson 2.1 Inductive Reasoning Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,

More information

Exercise sheet 6: Solutions

Exercise sheet 6: Solutions Eerise sheet 6: Solutions Cvet emptor: These re merel etended hints, rther thn omplete solutions. 1. If grph G hs hromti numer k > 1, prove tht its verte set n e prtitioned into two nonempt sets V 1 nd

More information

CS261: A Second Course in Algorithms Lecture #5: Minimum-Cost Bipartite Matching

CS261: A Second Course in Algorithms Lecture #5: Minimum-Cost Bipartite Matching CS261: A Seon Course in Algorithms Leture #5: Minimum-Cost Biprtite Mthing Tim Roughgren Jnury 19, 2016 1 Preliminries Figure 1: Exmple of iprtite grph. The eges {, } n {, } onstitute mthing. Lst leture

More information

Introduction to Olympiad Inequalities

Introduction to Olympiad Inequalities Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................

More information

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition Dt Strutures, Spring 24 L. Joskowiz Dt Strutures LEURE Humn oing Motivtion Uniquel eipherle oes Prei oes Humn oe onstrution Etensions n pplitions hpter 6.3 pp 385 392 in tetook Motivtion Suppose we wnt

More information

APPENDIX. Precalculus Review D.1. Real Numbers and the Real Number Line

APPENDIX. Precalculus Review D.1. Real Numbers and the Real Number Line APPENDIX D Preclculus Review APPENDIX D.1 Rel Numers n the Rel Numer Line Rel Numers n the Rel Numer Line Orer n Inequlities Asolute Vlue n Distnce Rel Numers n the Rel Numer Line Rel numers cn e represente

More information

Section 4.4. Green s Theorem

Section 4.4. Green s Theorem The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higher-dimensionl nlogues) with the definite integrls

More information

QUADRATIC EQUATION. Contents

QUADRATIC EQUATION. Contents QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,

More 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

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep

More information

Lesson 2.1 Inductive Reasoning

Lesson 2.1 Inductive Reasoning Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,

More information

Section 1.3 Triangles

Section 1.3 Triangles Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior

More information

Lecture 2: Cayley Graphs

Lecture 2: Cayley Graphs Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re

More information

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their

More information

2.4 Theoretical Foundations

2.4 Theoretical Foundations 2 Progrmming Lnguge Syntx 2.4 Theoretil Fountions As note in the min text, snners n prsers re se on the finite utomt n pushown utomt tht form the ottom two levels of the Chomsky lnguge hierrhy. At eh level

More information

A Primer on Continuous-time Economic Dynamics

A Primer on Continuous-time Economic Dynamics Eonomis 205A Fll 2008 K Kletzer A Primer on Continuous-time Eonomi Dnmis A Liner Differentil Eqution Sstems (i) Simplest se We egin with the simple liner first-orer ifferentil eqution The generl solution

More information

F / x everywhere in some domain containing R. Then, + ). (10.4.1)

F / x everywhere in some domain containing R. Then, + ). (10.4.1) 0.4 Green's theorem in the plne Double integrls over plne region my be trnsforme into line integrls over the bounry of the region n onversely. This is of prtil interest beuse it my simplify the evlution

More information

Geodesics on Regular Polyhedra with Endpoints at the Vertices

Geodesics on Regular Polyhedra with Endpoints at the Vertices Arnol Mth J (2016) 2:201 211 DOI 101007/s40598-016-0040-z RESEARCH CONTRIBUTION Geoesis on Regulr Polyher with Enpoints t the Verties Dmitry Fuhs 1 To Sergei Thnikov on the osion of his 60th irthy Reeive:

More information

LESSON 11: TRIANGLE FORMULAE

LESSON 11: TRIANGLE FORMULAE . THE SEMIPERIMETER OF TRINGLE LESSON : TRINGLE FORMULE In wht follows, will hve sides, nd, nd these will e opposite ngles, nd respetively. y the tringle inequlity, nd..() So ll of, & re positive rel numers.

More information

SOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVEX STOCHASTIC PROCESSES ON THE CO-ORDINATES

SOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVEX STOCHASTIC PROCESSES ON THE CO-ORDINATES Avne Mth Moels & Applitions Vol3 No 8 pp63-75 SOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVE STOCHASTIC PROCESSES ON THE CO-ORDINATES Nurgül Okur * Imt Işn Yusuf Ust 3 3 Giresun University Deprtment

More information

Particle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap

Particle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap Prtile Physis Mihelms Term 2011 Prof Mrk Thomson g X g X g g Hnout 3 : Intertion y Prtile Exhnge n QED Prof. M.A. Thomson Mihelms 2011 101 Rep Working towrs proper lultion of ey n sttering proesses lnitilly

More 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

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

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Project 6: Minigoals Towards Simplifying and Rewriting Expressions MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

More information

arxiv: v1 [cs.cg] 28 Apr 2009

arxiv: v1 [cs.cg] 28 Apr 2009 Orienttion-Constrine Retngulr Lyouts Dvi Eppstein 1 n Elen Mumfor 2 1 Deprtment of Computer Siene, University of Cliforni, Irvine, USA 2 Deprtment of Mthemtis n Computer Siene, TU Einhoven, The Netherlns

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties

More information

Identifying and Classifying 2-D Shapes

Identifying and Classifying 2-D Shapes Ientifying n Clssifying -D Shpes Wht is your sign? The shpe n olour of trffi signs let motorists know importnt informtion suh s: when to stop onstrution res. Some si shpes use in trffi signs re illustrte

More information

Section 2.3. Matrix Inverses

Section 2.3. Matrix Inverses Mtri lger Mtri nverses Setion.. Mtri nverses hree si opertions on mtries, ition, multiplition, n sutrtion, re nlogues for mtries of the sme opertions for numers. n this setion we introue the mtri nlogue

More information

SOME COPLANAR POINTS IN TETRAHEDRON

SOME COPLANAR POINTS IN TETRAHEDRON Journl of Pure n Applie Mthemtis: Avnes n Applitions Volume 16, Numer 2, 2016, Pges 109-114 Aville t http://sientifivnes.o.in DOI: http://x.oi.org/10.18642/jpm_7100121752 SOME COPLANAR POINTS IN TETRAHEDRON

More information

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into

More information

Maintaining Mathematical Proficiency

Maintaining Mathematical Proficiency Nme Dte hpter 9 Mintining Mthemtil Profiieny Simplify the epression. 1. 500. 189 3. 5 4. 4 3 5. 11 5 6. 8 Solve the proportion. 9 3 14 7. = 8. = 9. 1 7 5 4 = 4 10. 0 6 = 11. 7 4 10 = 1. 5 9 15 3 = 5 +

More information

Answers and Solutions to (Some Even Numbered) Suggested Exercises in Chapter 11 of Grimaldi s Discrete and Combinatorial Mathematics

Answers and Solutions to (Some Even Numbered) Suggested Exercises in Chapter 11 of Grimaldi s Discrete and Combinatorial Mathematics Answers n Solutions to (Some Even Numere) Suggeste Exercises in Chpter 11 o Grimli s Discrete n Comintoril Mthemtics Section 11.1 11.1.4. κ(g) = 2. Let V e = {v : v hs even numer o 1 s} n V o = {v : v

More information

The DOACROSS statement

The DOACROSS statement The DOACROSS sttement Is prllel loop similr to DOALL, ut it llows prouer-onsumer type of synhroniztion. Synhroniztion is llowe from lower to higher itertions sine it is ssume tht lower itertions re selete

More information

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e Green s Theorem. Let be the boundry of the unit squre, y, oriented ounterlokwise, nd let F be the vetor field F, y e y +, 2 y. Find F d r. Solution. Let s write P, y e y + nd Q, y 2 y, so tht F P, Q. Let

More information

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points: Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer

More information

The Ellipse. is larger than the other.

The Ellipse. is larger than the other. The Ellipse Appolonius of Perg (5 B.C.) disovered tht interseting right irulr one ll the w through with plne slnted ut is not perpendiulr to the is, the intersetion provides resulting urve (oni setion)

More information

Part 4. Integration (with Proofs)

Part 4. Integration (with Proofs) Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1

More information

Now we must transform the original model so we can use the new parameters. = S max. Recruits

Now we must transform the original model so we can use the new parameters. = S max. Recruits MODEL FOR VARIABLE RECRUITMENT (ontinue) Alterntive Prmeteriztions of the pwner-reruit Moels We n write ny moel in numerous ifferent ut equivlent forms. Uner ertin irumstnes it is onvenient to work with

More 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

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd

More information

Total score: /100 points

Total score: /100 points Points misse: Stuent's Nme: Totl sore: /100 points Est Tennessee Stte University Deprtment of Computer n Informtion Sienes CSCI 2710 (Trnoff) Disrete Strutures TEST 2 for Fll Semester, 2004 Re this efore

More information

Discrete Structures Lecture 11

Discrete Structures Lecture 11 Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.

More information

System Validation (IN4387) November 2, 2012, 14:00-17:00

System Validation (IN4387) November 2, 2012, 14:00-17:00 System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise

More information

PYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL:

PYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL: PYTHAGORAS THEOREM 1 WHAT S IN CHAPTER 1? 1 01 Squres, squre roots nd surds 1 02 Pythgors theorem 1 03 Finding the hypotenuse 1 04 Finding shorter side 1 05 Mixed prolems 1 06 Testing for right-ngled tringles

More information

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then. pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm

More information

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1) Green s Theorem Mth 3B isussion Session Week 8 Notes Februry 8 nd Mrh, 7 Very shortly fter you lerned how to integrte single-vrible funtions, you lerned the Fundmentl Theorem of lulus the wy most integrtion

More information