New and Improved Spanning Ratios for Yao Graphs

Size: px
Start display at page:

Download "New and Improved Spanning Ratios for Yao Graphs"

Transcription

1 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 Renssen Shool of Computer Siene Crleton University nre@g.ss.rleton. Prosenjit Bose Shool of Computer Siene Crleton University jit@ss.rleton. Wh Loon Keng Deprtment of Computer Siene Lfyette College kengw@lfyette.eu Mirel Dmin Deprtment of Computing Sienes Villnov University mirel.min@villnov.eu Joseph O Rourke Deprtment of Computer Siene Smith College orourke@s.smith.eu Perouz Tslkin Sner Veronshot Shool of Siene n Shool of Computer Siene Engineering Crleton University Amerin University of sner@g.ss.rleton. Armeni perouz.tslkin@ul..e Ge Xi Deprtment of Computer Siene Lfyette College gexi@s.lfyette.eu ABSTRACT For set of points in the plne n fixe integer k > 0, the Yo grph Y k prtitions the spe roun eh point into k equingulr ones of ngle θ = 2π/k, n onnets eh point to nerest neighor in eh one. It is known for ll Yo grphs, with the sole exeption of Y 5, whether or not they re geometri spnners. In this pper we lose this gp y showing tht for o k 5, the spnning rtio of Y k is t most 1/(1 2 sin(3θ/8)), whih gives the first onstnt upper oun for Y 5, n is n improvement over the previous oun of 1/(1 2 sin(θ/2)) for o k 7. We further reue the upper oun on the spnning rtio for Y 5 from 10.9 to , whih flls slightly elow the lower oun of 3.79 estlishe for the spnning rtio of Θ 5 (Θ-grphs iffer from Yo grphs only in the wy they selet the losest neighor in eh one). This is the first suh seprtion etween Yo n Θ-grph with the sme Reserh supporte in prt y NSERC. Reserh supporte y NSF grnt CCF Permission to mke igitl or hr opies of ll or prt of this work for personl or lssroom use is grnte without fee provie tht opies re not me or istriute for profit or ommeril vntge n tht opies er this notie n the full ittion on the first pge. Copyrights for omponents of this work owne y others thn the uthor(s) must e honore. Astrting with reit is permitte. To opy otherwise, or repulish, to post on servers or to reistriute to lists, requires prior speifi permission n/or fee. Request permissions from Permissions@m.org. SoCG 14, June 8 11, 2014, Kyoto, Jpn. Copyright is hel y the owner/uthor(s). Pulition rights liense to ACM. ACM /14/06...$ numer of ones. We lso give lower oun of 2.87 on the spnning rtio of Y 5. Finlly, we revisit the Y 6 grph, whih plys prtiulrly importnt role s the trnsition etween the grphs (k > 6) for whih simple inutive proofs re known, n the grphs (k 6) whose est spnning rtios hve een estlishe y omplex rguments. Here we reue the known spnning rtio of Y 6 from 17.6 to 5.8, getting loser to the spnning rtio of 2 estlishe for Θ INTRODUCTION The omplete Eulien grph efine on point set S in the plne is the grph with vertex set S n eges onneting eh pir of points in S, where eh ege xy hs s weight the Eulien istne xy etween its enpoints x n y. Although this grph is useful in mny ifferent ontexts, its min isvntge is tht it hs qurti numer of eges. As suh, muh effort hs gone into the evelopment of vrious methos for onstruting grphs tht pproximte the omplete Eulien grph. Wht oes it men to pproximte this grph? One stnr pproh is to onstrut spnning sugrph with fewer eges (typilly liner) with the itionl property tht every ege e of the omplete Eulien grph is pproximte y pth in the sugrph whose weight is not muh more thn the weight of e. This gives rise to the notion of t-spnner. A t-spnner of the omplete Eulien grph is spnning sugrph with the property tht for eh pir of verties x n y, the weight of shortest pth in the sugrph etween x n y is t most t 1 times xy. The spnning rtio is the smllest t for whih the sugrph is t-spnner. Spn-

2 ners fin mny pplitions, suh s pproximting shortest pths or minimum spnning trees. For omprehensive overview of geometri spnners n their pplitions, we refer the reer to the ook y Nrsimhn n Smi [12]. One of the simplest wys of onstruting t-spnner is to first prtition the plne roun eh vertex x into fixe numer of ones 1 n then eges onneting x to losest vertex in eh one. Intuition suggests tht this woul yiel grph whose spnning rtio epens on the numer of ones. Inee, this is one of the first pproximtions of the omplete Eulien grph, referre to s Yo grphs in the literture, introue inepenently y Flinhugh n Jones [11] n Yo [13]. We enote the Yo grph y Y k where k is the numer of ones, eh hving ngle θ = 2π/k. Yo use these grphs to simplify omputtion of the Eulien minimum spnning tree. Flinhugh n Jones stuie their grph theoreti properties. Neither of them tully prove tht they re t-spnners. To the est of our knowlege, the first proof tht Yo grphs re spnners ws given y Althöfer et l. [1]. They showe tht for every t > 1, there exists k suh tht Y k is t-spnner. It ppers tht some form of this result ws known erlier, s Clrkson [8] lrey remrke in 1987 tht Y 12 is spnner, leit without proviing proof or referene. Bose et l. [6] provie more speifi oun on the spnning rtio, y showing tht for k > 8, Y k is geometri spnner with spnning rtio t most 1/(os θ sin θ). This ws lter strengthene to show tht for k > 6, Y k is 1/(1 2 sin(θ/2))-spnner [4]. Dmin n Ruonis [9] showe tht Y 6 is spnner, n Bose et l. [5] showe tht Y 4 is 663-spnner. For k < 4, El Moll [10] showe tht there is no onstnt t suh tht Y k is t-spnner. This leves open only the question of whether Y 5 is onstnt spnner. In this pper we lose this gp y showing tht for o k 5, the spnning rtio of Y k is t most 1/(1 2 sin(3θ/8)). This gives the first onstnt upper oun for Y 5 n implies tht Y k is onstnt spnner for ll k 4. For o k 7, our result lso improves on the previous oun of 1/(1 2 sin(θ/2)). A more reful nlysis llows us to reue the upper oun on the spnning rtio of Y 5 from 10.9 to We lso give lower oun of 2.87 on the spnning rtio of Y 5. This omplements reent result on the spnning rtio of Θ 5, whih iffers from Y 5 only in the istne mesure it uses to selet the losest neighor in eh one: inste of Eulien istne, it projets eh vertex on the isetor of the one n selets the vertex with the losest projetion. Bose et l. [7] showe tht Θ 5 hs spnning rtio in the intervl [3.79, 9.96]. Beuse our upper oun of 3.74 on the spnning rtio of Y 5 is slightly lower thn the lower oun of 3.79 on the spnning rtio of Θ 5, this result estlishes the first seprtion etween the spnning rtio of Yo n Θ-grphs. For ll other k 4, it is unler whih of Θ k or Y k hs etter spnning rtio. Finlly, we revisit the Y 6 grph, whih plys prtiulrly importnt role s the trnsition etween the grphs (k > 6) for whih simple inutive proofs re known, n the grphs (k 6) whose est spnning rtios re estlishe y omplex rguments. Here we reue the known spnning rtio of Y 6 from to 5.8, thus moving towr the spnning rtio of 2 estlishe for Θ 6 [3]. In ontrst to Y 5, we lso present 1 The orienttion of the ones is the sme for ll verties. lower oun of 2 on the spnning rtio of Y 6, showing tht it n never improve upon Θ 6 in this regr. 2. SPANNING RATIO OF Y k, FOR ODD k In this setion we stuy the spnning properties of the Yo grphs Y k efine on plne point set S y n o numer of ones k 5, eh of ngle θ = 2π/k. For k = 5 in prtiulr, this is the first result showing tht Y 5 is onstnt spnner. For o vlues k > 5, we improve the urrently known oun on the spnning rtio of Y k. We strt with few efinitions. For fixe k, let Q i() e the hlf-open one of ngle 2π/k with pex, inluing the ngle rnge [i, i + 1) 2π/k, for i = 0,..., k 1, where ngles re mesure ounterlokwise from the positive x-xis. The irete grph Y k inlues extly one irete ege from to losest point in Q i(), for eh i = 0,..., k 1. If there re severl eqully-losest points within Q i(), then ties re roken ritrrily. The grph Y k is the unirete version of Y k. For ny two points, S, let p(, ) enote the length of shortest pth in Y k from to. α Figure 1: If α is smll, there is lose reltion etween n. Lemm 1. Given three points,, n, suh tht n α < π, then (1 2 sin(α/2)). Proof. Let e the point on suh tht = (see Fig. 1). Sine forms n isoseles tringle, = 2 sin( /2) 2 sin(α/2). Now, y the tringle inequlity, + 2 sin(α/2) + = (1 2 sin(α/2)). Theorem 2. For ny o integer k 5, Y k hs spnning rtio t most t = 1/(1 2 sin(3θ/8)). Proof. Let, S e n ritrry pir of points. We show tht there is pth in Y k from to no longer thn t. For simpliity, let Q() enote the one with pex tht ontins, n let Q() enote the one with pex tht ontins. Rotte the point set S suh tht the isetor of Q() is in the iretion of the positive y-xis, s epite in Fig. 2. Assume without loss of generlity tht lies to the right of this isetor; the se when lies to the left of this isetor is symmetri. Let α e the ngle forme y the segment with the isetor of Q(), n let β e the ngle forme y with the isetor of Q(). Sine k is o, the isetor of Q() is

3 α Figure 2: Sine opposite ones re not symmetri, either α or β is smll. prllel to the right ounry of Q(). Hene, we hve tht α = θ/2 β. Assume without loss of generlity tht α is the smller of these two ngles (if not, we exhnge the roles of n ). It follows tht α θ/4. Our proof is y inution on the istne. In the se se is miniml mong ll istnes etween pirs of points, whih mens tht there is no point Q() tht is stritly loser to thn. Therefore either Y k, in whih se our proof for the se se is finishe, or there is point Q() suh tht = n Y k. In this ltter se, sine α θ/4 n k 5, the ngle etween n is t most θ/2 + α 3θ/4 3/4 (2π/5) = 3π/10. This is less thn π/3, whih implies tht <. This ontrits our ssumption tht is miniml. It follows tht Y k n the se se hols. For the inutive step, let Q() e suh tht Y k. If oinies with, then p(, ) = n the proof is finishe. So ssume tht. Beuse is the losest vertex to in this one, n euse θ/2+α 3θ/4, we n pply Lem. 1 to erive (1 2 sin(3θ/8)) = /t, whih is stritly less thn. Thus we n use the inutive hypothesis on to etermine pth etween n of length ( p(, ) + t + t ) = t. t Applying this result to Y 5 yiels spnning rtio of 1/(1 2 sin(3π/20)) This is the first known upper oun on the spnning rtio of Y 5 n fully settles the question of whih Yo grphs re spnners. Corollry 3. The grph Y k is spnner if n only if k 4. Next we lower the upper oun on the spnning rtio of Y 5 y tking loser look t ll fesile onfigurtions. Theorem 4. The grph Y 5 hs spnning rtio t most Here we lso use inution on the pirwise istnes etween pir of points in S. Consier the sme onfigurtion use in the proof of Thm. 2: Q() n Q() re points in S, n we seek short pth from n ; the isetor of Q() is ligne with the positive y-xis, n β lies to the right of this isetor; α n β re ngles s in Fig. 2, with α β. The ses where is miniml (se se) or Y 5 re s isusse in the proof of Thm. 2. So let Q() n Q() e in S suh tht Y 5 n Y5, n let φ =, n ψ = (see Fig. 3). Now, inste of pplying Lem. 1 for the mximum vlue of φ (s in the proof of Thm. 2), we pply Lem. 1 only for vlues φ θ or ψ θ, for some threshol ngle θ (to e etermine lter). These ses yiel spnning rtio of t 1/(1 2 sin(θ/2)). We hnle the remining ses ifferently, so for the reminer of the proof, we ssume tht φ > θ n ψ > θ. We ompute n ext vlue of θ shortly, ut for now we only nee tht θ/2 < θ < 3θ/4. This implies tht neither nor n lie to the right of, s this woul mke the orresponing ngle smller thn θ/2. First onsier the se where n interset. In this se, inste of iretly pplying n inutive rgument to either or, we oun the istne n use inution to show tht + t + t. To erive this oun, onsier the point suh tht = θ n = n the nloguously efine point (see Fig. 3). Let s e the intersetion point etween n. When n interset, the istne n e inrese y rotting towrs n towrs. Sine oth φ n ψ must e lrger thn θ, the worst se ours when φ = ψ = θ, leving n on the ounry of s. As is the longest sie of this tringle, it follows tht <. Using the ft tht the tringles s n s re similr n isoseles, we n ompute : = 2 s os θ = 2( s ) os θ ( = 2 2 os θ = (2 os θ 1) ) os θ Rell tht our im is to use inution on to otin short pth from to. We now ompute the spnning rtio t require for the inequlity +t + t to hol. By the inequlity ove, we hve tht + t + + t(2 os θ 1) +. This ltter term is oune ove y t for ny t 1/(1 os θ). So fr we erive two onstrints on t n θ: t 1/(1 2 sin(θ/2)) n t 1/(1 os θ). Beuse sin θ is inresing n os θ is eresing for ll vlues of θ uner onsiertion, we minimize t y hoosing θ suh tht 1/(1 2 sin(θ/2)) = 1/(1 os θ). This yiels θ = ros ( 3 1 ) 0.75 n t = Now onsier wht hppens when one of or is short, uner some notion of short pture y the following lemm. Lemm 5. Let e tringle with ngle α = n longest sie. Let λ > 1 e rel onstnt. Then 2λ2 os α 2λ implies tht +λ λ. λ 2 1 Proof. The first inequlity ove implies λ > 1/ os α, otherwise woul e non-positive. By the lw of osines, = os α. By sustituting this in the inequlity + λ λ, we see tht it only hols if 2λ2 os α 2λ, s stte y the lemm. λ 2 1

4 ψ s θ ψ φ θ φ () () () Figure 3: () Two verties of Y 5 with their losest verties. () The worst-se sitution when n ross. () The rottion to mximize when n o not ross. The only se left to onsier is when n re oth long, ut they o not interset. In this se, we gin seek to oun the istne. If we n show tht (2 os θ 1), we n pply the sme rgument s for the interseting se n we re one. Let e the point on the extension of with =, n let e the nloguous point on the extension of (see Fig. 3). If oes not interset, we n rotte wy from y inresing ψ. Similrly, if oes not interset, we n rotte wy from y inresing φ. Thus, the istne is mximize when φ + ψ is mximl, whih in our ontext hppens when φ + ψ = 3θ/2 = 3π/5. Note tht in most ses, rotting this fr moves the orresponing vertex pst the ounry of the one. But sine we re only trying to fin n upper oun, this is not prolem. Now let e the point on the line through with = 2t 2 os φ 2t, n let e the point on the line through with = 2t2 os ψ 2t. If lies on, Lem. 5 tells us tht + t t, whih is extly wht we nee. The only iffiulty is tht the lotion of hnge uring the rottion. But sine the rottion preserve n only inrese, the inequlity must hol for the onfigurtion efore the rottion s well. The sme rgument pplies for the se when lies on. The sitution where n lie on n, respetively, is hnle y the following lemm. s Proof. Assume without loss of generlity tht n = 1. Then 3π/10 3π/5 θ n θ 3π/10. Let e the point on the extension of with =, n let e the nloguous point on the extension of. Let s e the intersetion of n. Let e the point on the line through with = 2t2 os 2t, n let e the point on the line through with = 2t2 os 2t (see Fig. 4). Let 1 = 2t2 n 2 = 1. We erive sin(3π/5) (fter some lultions) Let s s = 1 sin, (1) = 1 sin(3π/5 ), (2) = 2 os(3π/5 ), (3) = 2 os. (4) x 1 = s sin = sin( + ) 2t2 os 2t, t 2 1 (5) x 2 = sin s = 1 sin( + ), (6) y 1 = s sin = sin( + ) 2t2 os 2t, t 2 1 (7) y 2 = s = 1 sin sin( + ). (8) Note tht the vlues of x 1 n y 1 oul e negtive if or lie pst s. Sustituting 1, 2, n (1) - (4) in the equlities ove yiels Figure 4: Illustrtion of Lem. 6 Lemm 6. Let,,, S. Let = n = suh tht > θ, > θ, n + = 3π/5. Let t = If 2t 2 os 2t n 2t2 os 2t, then (2 os θ 1). x 1 = 2 os(3π/5 ) + 1 sin, (9) x 2 = 2 os(3π/5 ), (10) y 1 = 2 os 1 sin(3π/5 ), (11) y 2 = 2 os. (12) Rell tht 1 = 2t2, 2 = 1 sin(3π/5), n 3π/10 3π/5 θ. We verify the following:

5 2 x 1 = 2 2 sin(3π/5 ) + 1 os > 1.1 sin(3π/10) os(3π/5 θ) > 0, 2 x 2 = 2 sin(3π/5 ) > 0, 2 2 y 1 = 2 sin + 1 os(3π/5 ) 2 > 1.1 sin(3π/5 θ) os(3π/10) > 0, 2 y 2 = 2 sin > 0. 2 Therefore, y plugging in = 3π/10 or = 3π/5 θ s the lower- or upper-oun of into (9) - (12), we n verify the following rnges: 2 os(3π/10) + 1 sin(3π/10) x1, 2 os θ + 1 sin(3π/5 θ) x1, 2 os(3π/10) x2 2 os(3π/10) 1 sin(3π/10) y1, 2 os(3π/5 θ) 1 sin θ y1, 2 os(3π/10) y2, 2 os(3π/5 θ) y2. 2 os θ, (13) Speifilly, we n verify tht ( ) x 1 mx x2, y1, y 2, (14) whih implies (x 1 x 2 ) = x 1 x 2 > 0. By simply plugging in = 3π/10 into (5) n (6), we verify tht (x 1 x 2) > 0 when = 3π/10 n hene x 1 > x 2 for ll [3π/10, 3π/5 θ]. Similrly, we hve x 2 > 0 when = 3π/10, n hene y (13), x 2 > 0 for ll [3π/10, 3π/5 θ]. These together yiel x 1 > x 2 > 0. By the tringle inequlity, By (14), s + s = x 1 + y 1 = x 1 + y 1, s + s = x 1 + y 2 = x 1 + y 2, s + s = x 2 + y 1 x 1 + y 1, s + s = x 2 + y 2 x 1 + y 2. (x 1 + y 1 ) (x 1 + y 2 ) (x1) (x1) (y1) 0, (y2) 0. By plugging in = 3π/5 θ into (5), (7), n (8), one n esily verify tht x 1 + y 1 2 os θ 1 n x 1 + y 2 2 os θ 1 when is mximize. Therefore mx(x 1+ y 1, x 1+ y 2 ) 2 os θ 1 for ll [3π/10, 3π/5 θ], n hene mx(,,, ) 2 os θ 1 s require. This ompletes the proof for the upper oun. A proof estlishing the following lower oun n e foun in the full version of this pper [2]. Theorem 7. Y 5 hs spnning rtio t lest SPANNING RATIO OF Y 6 In this setion we fix k = 6 n show tht, for ny pir of points, S, p(, ) 5.8. We lso estlish lower oun of 2 for the spnning rtio of Y 6. Our proof is inutive n it relies on two simple lemms, whih we introue next. Let, S n let Y 6 e the ege from within the one tht inlues. The next two lemms will e relevnt in the ontext where we seek to oun p(, ) y pplying the inution hypothesis to p(, ). The si geometry is illustrte in Fig. 5. α x s h 1 Figure 5: Nottion for tringle. Here the imensions hve een normlize so tht = 1. Lemm 8. [Tringle] Let e lele s in Fig. 5, with, <, x = n s =. The rtio s/x is equl to some funtion t tht epens on α n β: r r s = t(α, β) = os(β/2) x os(α + β/2). (15) Proof. Normlize the tringle so tht = 1; this oes not lter the quntity we seek to ompute, s/x. Let = r to simplify nottion. Then x = 1 r n x 0 euse r = = 1. Note tht eh of the ngles n is stritly less thn π/2, euse n. Thus the projetion of onto is interior to the segment. Computing the ltitue h of in two wys yiels s sin α = r sin β. Also projetions onto yiel s os α + r os β = 1. Solving these two equtions simultneously yiels expressions for r n s s funtions of α n β: r = sin α sin α os β + os α sin β, s = sin β sin α os β + os α sin β Now we n ompute s/x = s/(1 r) s funtion of α n β. This simplifies to s lime. s x = os(β/2) os(α + β/2) β

6 The following lemm erives n upper oun on the funtion t(α, β) from Lem. 8, whih will e use in Thm. 10 to erive n optiml vlue for. Lemm 9. Let,, S stisfy the onitions of Lem. 8, n let t(α, β) e s efine in (15). Let (0, π/3) e fixe positive ngle. If α π/3, or β π/3, then t(α, β) t(π/3, π/3 ) = os(π/6 /2). sin(/2) Proof. The erivtive of t(α, β) with respet to α is t sin α + sin(α + β) = > 0. α 1 + os(2α + β) This mens tht, for fixe β vlue, t(α, β) rehes its mximum when α is mximum. Similrly, the erivtive of t(α, β) with respet to β is t β = sin α 2 os(α + β/2) > 0. 2 So for fixe vlue α vlue, t(α, β) rehes its mximum when β is mximum. Beuse, β. The sum of these two ngles is π α, therefore β π/2 α/2. This long with the erivtions ove implies tht, for fixe vlue α π/3, t(α, β) t(α, π/2 α/2) t(π/3, π/3 + /2) (we sustitute α = π/3 in this ltter inequlity). Next we evlute t(π/3, π/3 ) os(π/6 /2) sin(3/2) = t(π/3, π/3 + /2) os(π/6 + /2) sin(/2) > 1. It follows tht t(π/3, π/3 ) is mximl. We re now rey to prove the min result of this setion. Theorem 10. Y 6 hs spnning rtio t most 5.8. This result follows from the following lemm, with the vrile sustitute y the quntity 0 = tht minimizes t(). (It n e esily verifie tht t() t(0.324) n t(0.324) < 5.8.) Lemm 11. Let (0, π/9) e stritly positive rel vlue. The grph Y 6 hs spnning rtio oune ove y { } os(π/6 /2) 2 t = t() = mx,. (16) sin(/2) 1 sin(2) sin(π/6+2) Proof. The proof is y inution on the pirwise istne etween pirs of points, S. Without loss of generlity let Q 0(). Bse se. We show tht, if is miniml, then Y 6 n so p(, ) =. If Y 6, then the lemm hols. So ssume tht Y 6; we will erive ontrition. Beuse Y6, there must e nother point Q 0() suh tht Y6 n =. Let α 1 n α 2 e the ngles tht n mke with the horizontl respetively. Beuse oth α 1, α 2 [0, π/3), neessrily α 1 α 2 < π/3. Thus < =, ontriting the ssumption tht is miniml. So in ft it must e tht Y 6, n the lemm is estlishe. Min ie of the inutive step. It hs lrey een estlishe tht Y 7 is spnner [4]; the setor ngles for Y 7 re 2π/7. The min ie of our inutive proof is to prtition the π/3-setors of Y 6 into peripherl ones of ngle, for some fixe (0, π/9), leving entrl setor of ngle π/3 2. (The -ones re the she regions in Fig. 6.) When n ege of Y 6 flls insie the entrl setor, inution will pply, euse n ege within the entrl setor mkes efinite progress towr the gol in tht setor (s it oes in Y 7), ensuring tht the remining istne to e overe is stritly smller thn the originl. This ie is pture y the flowing lemm. Lemm 12. [Inution Step] Let,, S suh tht n lie in the sme one with pex, n Y 6. Let α = n β =. If either α < π/3 or β < π/3, then we my use inution on p(, ) to onlue tht p(, ) t. Proof. This onfigurtion is epite in Fig. 5. Beuse Y6 n n lie in the sme one with pex, we hve tht. Beuse t lest one of α or β is stritly smller thn π/3, we hve tht <. Thus the onitions of Lem. 8 re stisfie, so we n use Lem. 8 to oun in terms of x = : sine /x < t, < tx. Beuse <, we my pply inution to oun p(, ): p(, ) t. Hene p(, ) + p(, ) tx + t = t(x + ) = t. We will heneforth use the symol Inut s shorthn for pplying Lem. 12 to tringle equivlent to tht in Fig. 5. Lem. 12 leves out Y 6 eges flling within the -ones, tht oul oneivly not mke progress towr the gol. For exmple, following one ege of n equilterl tringle leves one extly s fr wy from the other orner s t the strt. However, we will see tht when ll relevnt eges of Y 6 fll with the -ones ner π/3, the restrite geometri struture ensures tht progress towr the gol is inee me, n gin inution pplies. Inutive step. The inutive step proof first hnles the ses where eges of Y 6 irete from or from fll in the entrl portion of the relevnt setors, n so stisfy Lem. 9, n so Lem. 12 pplies. Rell tht Q 0() y our ssumption. If Y 6, then p(, ) = n we re finishe. Assuming otherwise, there must e point Q 0() suh tht Y 6 n. For the reminer of the proof, we re in this sitution, with Y 6 n. The proof now prtitions into three prts: (1) when only Q 0() is relevnt n les to Inut ; (2) when Q 2() les to Inut ; (3) when we fll into speil sitution, for whih inution lso pplies, ut for ifferent resons. (1) The Q 0 () setor. Consier s previously illustrte in Fig. 5. If either or is not in one of the -ones of Q 0(), then α = < π/3 : Inut.

7 β Figure 6: The -ones re she. () n in the sme -one. () n in ifferent -ones. () Q 0() n Q 2(). Here β is smll. Now ssume tht oth n lie in -ones of Q 0(). If they oth lie within the sme -one (Fig. 6), then gin α is smll: Inut. So without loss of generlity let lie in the lower -one, n in the upper -one of Q 0(); see Fig. 6. We nnot pply inution in this sitution euse the rtio s/x in Lem. 8 hs no upper oun. (2) The Q 2 () setor. Now we onsier Q 2(), the setor with pex t iming to the left of, n ssume tht Q 2(). Refer to Fig. 6. The se / Q 2() will e isusse lter (speil sitution). Beuse my suten n ngle s lrge s t with the horizontl, the upper 2-one of Q 2() eomes the relevnt region. If is not in the upper 2-one of Q 2() (s epite in Fig. 6), then stisfies Lem. 9 with β < π/3 : Inut. Note tht this onlusion follows even if is in the smll region outsie of n elow Q 2(): the ngle β t is then very smll. Assume now tht is in the upper 2-one of Q 2(). Let Q 2() e the point suh tht Y 6. We now onsier possile lotions for. If =, then p(, ) + 2, n we re finishe. So ssume heneforth tht is istint from. If is not in the upper -one of Q 0() (Fig. 7), then stisfies Lem. 9 with the roles of n reverse: tkes step towr, with the ngle t stisfying < π/3 : Inut. If is not in the upper 2-one of Q 2() (Fig. 7), then stisfies Lem. 9 gin with the roles of n reverse n this time the ngle t oune wy from π/3, < π/3 : Inut. Assume now tht is in the intersetion region etween the upper -one of Q 0() n the upper 2-one of Q 2(). Rell tht we re in the sitution where lies in the sme region, so it is lose to. See Fig. 7. This suggests the strtegy of following n, onnete y p(, ). We show tht in ft <, so the inutive hypothesis n e pplie to p(, ). More preisely, we show the following result. Lemm 13. Let,,, S e s in Fig. 7, with Y 6,, Q 0() n, Q 2(). If oth n lie ove the lower rys ouning the upper 2-ones of Q 0() n Q 2(), then for ny 0 π/9, sin(2). (17) sin(π/6 + 2) Note tht lies in the intersetion region etween the upper 2-ones of Q 0() n Q 2(), euse Q 0() Q 2() (y the sttement of the lemm). However, Lem. 13 oes not restrit the lotion of to the sme region. Inee, my lie either elow or ove the upper ry ouning Q 0(), s long s it stisfies the onition. (This onition must hol euse, re in the sme setor Q 2(), n Y6.) To keep the flow of our min proof uninterrupte, we efer proof of Lem. 13 to Setion 4.1. By Lem. 13 we hve <. Thus we n use the inution hypothesis to show tht p(, ) t. We know tht euse oth n re in Q 0() n Y 6. We lso know tht euse oth n re in Q 2() n Y 6. Let u n i e the upper n lower intersetion points etween the rys ouning Q 2() n the upper ry of Q 0(), s in Fig. 7. Note tht ui is equilterl, n euse lies in this tringle, we hve u = i. It follows tht. So in this sitution (illustrte in Fig. 7), we hve: p(, ) + p(, ) p(, ) 2 + t sin(2) 2 + t sin(π/6 + 2) t. Here we hve pplie Lem. 13 to oun. Note tht the ltter inequlity ove is true for the vlue of t from (16). (3) Speil sitution. The only se left to isuss is the one in whih lies in the upper -one of Q 0() n to the right of the upper ry of Q 2(). This sitution is epite in Fig. 8. Next onsier Q 4(). Beuse Q 4(), there exists z Y 6, with z Q 4() n z. Clerly z Q 0() Q 5(). Note tht the isk setor D 0(, ) Q 0() with enter n rius must e empty, euse Y 6. Cse 3(). If z Q 0(), then z lies in the lower -one of Q 0() n to the right of D 0(, ), lose to. See Fig. 8. In this se we show tht the quntity on the right sie of inequlity (17) is loose upper oun on z, n tht similr inutive rguments hol here s well. Let the irumferene of D 0(, ) interset the right ry of Q 4() n the lower ry of Q 0() t points z n, respetively. Refer to

8 u 2 2 i Figure 7: () not in the upper -one of Q 0(): is smll. () not in the upper 2-one of Q 2(): is smll. () Lem. 13: <. D (,) 0 () z 60 o 60 o D (,) 0 Figure 8: Cse / Q 2(), z Q 0(): Lem. 13 pplies on. Fig. 8. Let e the ngle forme y with the upper ry of Q 0(). Then z = n z = /2. This implies tht oth n z lie in the intersetion region etween the lower -one of Q 0() n the right /2-one of Q 4(). Thus,,, z S stisfy the onitions of Lem. 13, with the roles of n reverse: z sin(2)/ sin(π/6 + 2). Arguments similr to the ones use for the se epite in Fig. 10 show tht z. This long with (euse Y 6) n the ove inequlity imply p(, ) + z + p(z, ) 2 + t z t for ny t stisfying the onitions stte y this lemm. 2 e u z v D (, ) 0 D (u, u ) 4 () i j D (u, u ) 4 () u z v () f 2 D (, ) 0 Figure 9: Cse / Q 2() n z Q 5() () z left of uv () z right of uv. z Cse 3(). Assume now tht z / Q 0(). Then z Q 5(), s epite in Fig. 9. In this se z lies in the isk setor D 4(, ) (euse z ) n elow the horizontl through (euse D 0(, ) is empty). This implies tht there exists e Y6, with e Q 5() n e z. Similrly, there exists f Y 6, with f Q 3() n f z. If e lies ove the lower 2-one of Q 5(), then e π/3, whih les to Inut n settles this se. Similrly, if f lies ove the lower -one of Q 3(), then f π/3, whih gin les to Inut. Otherwise, we show tht the following lemm hols. Lemm 14. Let,,, z S e in the onfigurtion epite in Fig. 9, with, z Y 6. Let e, f Y 6, with e in the lower 2-one of Q 5() n f in the lower -one of Q 3(). Then t lest one of the following is true: () e Q 3(), or () f Q 5(). We efer proof of Lem. 14 to Setion 4.2. Lem. 14 gurntees tht, if onition () hols, then e my not ross the lower ry ouning Q 3(). This se reues to one of the ses epite in Figs. 7 n 10, with e plying the role of n the pth pssing uner rther thn ove. Beuse e oes not ross the lower ry ouning Q 3(), the speil sitution epite in Fig. 8 (with e plying the role of ) my not our in this se. Similrly, onition () from Lem. 14 reues to one of the ses epite in Figs. 7 n 10, with the roles of n reverse n with f plying the role of ; the speil sitution epite in Fig. 8 (with f plying the role of ) my not our in this se. Hving exhuste ll ses, we onlue the proof. A proof estlishing the following lower oun n e foun in the full version of the pper [2]. Theorem 15. Y 6 hs spnning rtio t lest DEFERRED PROOFS 4.1 Proof of Lemm 13 Lemm 13. Let,,, S e s in Fig. 10, with Y 6,, Q 0() n, Q 2(). If oth n lie ove the lower rys ouning the upper 2-ones of Q 0() n Q 2(), then for ny 0 π/9, sin(2) sin(π/6 + 2)

9 Proof. Let u n v e the top n ottom points of the intersetion qurilterl R etween the upper 2-ones of Q 0() n Q 2(). See Fig. 10. Then R. For ny π/9, the ngles opposite to the igonl uv of R re oune elow y 5π/9, therefore uv is the imeter of R. u v () u 2 j i R Figure 10: Lem. 13: () uv is minimum when = 0. () uv. Assume first tht R s well. In this se, the quntity is oune ove y the length uv of the imeter of R. Let e the ngle forme y with the horizontl. We show tht uv is mximize when = 0. Set oorinte system with the origin t. Sle the point set S so tht = 1. Then the oorintes of re (os, sin ). The point u is t the intersetion of the two lines pssing through n with slopes tn π/3 n tn π/3 respetively, given y y = 3x n y = 3(x os ) + sin. Solving for x n y gives the oorintes of u 3 os + sin 3 os + sin x u = 2, y u =. 3 2 Similrly, the point v is t the intersetion of two lines given y y = tn(π/3 2)x n y = tn(π/3 2)(x os ) + sin. Solving for x n y gives the oorintes of v x v = y v = tn(π/3 2) os + sin, 2 tn(π/3 2) tn(π/3 2) os + sin. 2 We n now ompute uv = (x u x v) 2 + (y u y v) 2 s Figure 11: Lem. 13. The erivtive of uv with respet to, for, [0, π/9]. v () 2 funtion of n. The erivtive of this funtion with respet to is represente s grph in Fig. 11 for, [0, π/9]. Note tht this funtion is negtive on the given intervl, therefore uv inreses s ereses. Thus uv is mximum when = 0. We now set = 0 n ompute uv 3/2 ot(2 + π/6)/2 = sin(2)/ sin(2 + π/6) s lime. Assume now tht / R, so lies ove the upper ry ouning Q 0(). Let i e the intersetion point etween the upper ry ouning Q 0() n the lower ry ouning the upper 2-one of Q 2(). Then must lie outsie the isk D 2(, i ), euse lies outsie this isk (y ssumption) n (euse Y 6). Refer to Fig. 10. Let j e the intersetion point etween the lower ry ouning the upper 2-one of Q 2() n the irumferene of D 2(, u ). Then oth n lie in the strip elimite y D 2(, i ), D 2(, j ) n the two rys ouning the upper 2-one of Q 2(). Thus is no greter thn the imeter of this strip, whih we show to e no greter thn the imeter of R. For this, it suffies to show tht mx{ ui, uj, ij } uv. Beuse ui is n ege of R, ui is lerly no greter thn the imeter uv of R. Next we show tht uj uv. From the isoseles tringle uj we erive ujv = π/2. Angle uvj is exterior to uv, therefore uvj = vu + 2 π/6 + 2 (note tht vu = π/6 when is horizontl, otherwise vu < π/6). It follows tht ujv uvj for ny π/9. This long with the lw of sines pplie to ujv yiels uj uv. It remins to show tht ij < uv. We will in ft show tht ij < uj, whih long with the onlusion ove tht uj uv, yiels ij < uv. Angle uij is exterior to ui, therefore π/3 uij π/ Erlier we showe tht ujv = π/2 7π/18, for ny π/9. It follows tht iuj π (7π/18+π/3) = 5π/18 is the smllest ngle of uij, therefore ij < uv. This ompletes the proof. 4.2 Proof of Lemm 14 Lemm 14. Let,,, z S e in the onfigurtion epite in Fig. 9, with, z Y 6. Let e, f Y 6, with e in the lower 2-one of Q 5() n f in the lower -one of Q 3(). Then t lest one of the following is true: () e Q 3() () f Q 5() Proof. We efine four intersetion points u, v, i n j s follows: u is t the intersetion etween the top rys of Q 0() n Q 2(); v is t the intersetion etween the isetor of u n the ounry of the isk setor D 4(u, u ); i is the foot of the perpeniulr from on the lower ry of Q 3(); n j is the foot of the perpeniulr from on the lower ry of Q 5(). Refer to Fig. 9. Note tht e i implies onition (), n f j implies onition (). We show tht the first hols if z lies to the left of or on uv, n the ltter hols if z lies to the right of or on uv (n so t lest one of the two onitions hols). We first show tht z D 4(u, u ). This follows immeitely from the inequlity uz + < z + u (whih n e erive using the tringle inequlity twie on the tringles inue y the igonls of uz), n the ft tht z (euse z Y 6). It follows tht uz < u, therefore z D 4(u, u ).

10 Conition (). Assume tht z lies to the left of uv (s in Fig. 9). Beuse z D 4(u, u ) is elow the horizontl through, zv is otuse n therefore z v (equlity hols when z oinies with v). Also e z, euse z n e re in the sme setor Q 5() n e Y 6. It follows tht e v. We now show tht v i, whih implies e i, thus settling this se. Let [0, ] e the ngle forme y with the horizontl through. Then i = π/3 n i = sin(π/3 ). The lw of sines pplie to uv tells us tht v sin π/6 = u sin uv = uv sin uv. Note tht uv = u u, euse v lies on the irumferene of D(u, u ) n lies outsie of this isk. This long with the ltter equlity ove yiels uv uv. The sum of these two ngles is 5π/6 (rell tht uv is the isetor of u), therefore uv 5π/12. Also note tht uv < π/2, euse v lies stritly elow the horizontl through (otherwise my not exist). It follows tht sin uv sin 5π/12. Sustituting this in the equlity ove yiels v u sin π/6/ sin 5π/12. The lw of sines pplie to tringle u yiels u = sin(π/3 + )/ sin π/3, whih sustitute in the previous equlity yiels sin(π/3 + ) sin π/6 v sin π/3 sin 5π/12. Thus the inequlity v i hols for ny stisfying sin(π/3 + ) sin π/6 sin π/3 sin 5π/12 sin(π/3 ). It n e esily verifie tht this inequlity hols for ny 23π/180, n in prtiulr for the vlues restrite y Lem. 11. Conition (). Assume now tht z lies to the right of uv (s in Fig. 9). In this se f z v. We now show tht v j, whih implies f j, thus settling this se. From the right tringle j with ngle j = π/3 +, we erive j = sin(π/3 + ). Next we erive n upper oun on v. From the isoseles tringle vu, hving ngle vu = π/6, we erive v = 2 u sin π/12. The lw of sines pplie to tringle u gives us u = sin(π/3 )/ sin π/3, whih sustitute in the previous equlity yiels v = 2 sin(π/3 ) sin π/12/ sin π/3. Thus the inequlity v j hols for ny vlue stisfying 2 sin(π/3 ) sin π/12 sin π/3 sin(π/3 + ). It n e verifie tht this inequlity hols for ny π/3, n in prtiulr for the vlues restrite y Lem REFERENCES [1] I. Althöfer, G. Ds, D. Dokin, D. Joseph, n J. Sores. On sprse spnners of weighte grphs. Disrete & Computtionl Geometry, 9(1):81 100, [2] L. Br, P. Bose, M. Dmin, R. Fgererg, W. L. Keng, J. O Rourke, A. vn Renssen, P. Tslkin, S. Veronshot, n G. Xi. New n improve spnning rtios for Yo grphs. ArXiv e-prints, rxiv: [s.cg]. [3] N. Bonihon, C. Gvoille, N. Hnusse, n D. Ilinks. Connetions etween thet-grphs, Deluny tringultions, n orthogonl surfes. In Proeeings of the 36th Interntionl Workshop on Grph-Theoreti Conepts in Computer Siene (WG 2010), volume 6410 of Leture Notes in Computer Siene, pges , [4] P. Bose, M. Dmin, K. Douïe, J. O Rourke, B. Semone, M. Smi, n S. Wuhrer. π/2-ngle Yo grphs re spnners. ArXiv e-prints, rxiv: [s.cg]. [5] P. Bose, M. Dmin, K. Douïe, J. O Rourke, B. Semone, M. Smi, n S. Wuhrer. π/2-ngle Yo grphs re spnners. Interntionl Journl of Computtionl Geometry & Applitions, 22(1):61 82, [6] P. Bose, A. Mheshwri, G. Nrsimhn, M. Smi, n N. Zeh. Approximting geometri ottlenek shortest pths. Computtionl Geometry. Theory n Applitions, 29(3): , [7] P. Bose, P. Morin, A. vn Renssen, n S. Veronshot. The θ 5-grph is spnner. In Proeeings of the 39th Interntionl Workshop on Grph-Theoreti Conepts in Computer Siene (WG 2013), pges , [8] K. L. Clrkson. Approximtion lgorithms for shortest pth motion plnning. In Proeeings of the 19th ACM Symposium on the Theory of Computing (STOC 1987), pges 56 65, [9] M. Dmin n K. Ruonis. Yo grphs spn thet grphs. Disrete Mthemtis, Algorithms n Applitions, 4(02): , [10] N. M. El Moll. Yo spnners for wireless ho networks. PhD thesis, Villnov University, [11] B. E. Flinhugh n L. K. Jones. Strong onnetivity in iretionl nerest-neighor grphs. SIAM Journl on Algeri n Disrete Methos, 2(4): , [12] G. Nrsimhn n M. Smi. Geometri Spnner Networks. Cmrige University Press, [13] A. C. C. Yo. On onstruting minimum spnning trees in k-imensionl spes n relte prolems. SIAM Journl on Computing, 11(4): , 1982.

September 30, :24 WSPC/Guidelines Y4Spanner

September 30, :24 WSPC/Guidelines Y4Spanner Septemer 30, 2011 12: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,

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

( ) { } [ ] { } [ ) { } ( ] { }

( ) { } [ ] { } [ ) { } ( ] { } Mth 65 Prelulus Review Properties of Inequlities 1. > nd > >. > + > +. > nd > 0 > 4. > nd < 0 < Asolute Vlue, if 0, if < 0 Properties of Asolute Vlue > 0 1. < < > or

More information

SIMPLE NONLINEAR GRAPHS

SIMPLE NONLINEAR GRAPHS S i m p l e N o n l i n e r G r p h s SIMPLE NONLINEAR GRAPHS www.mthletis.om.u Simple SIMPLE Nonliner NONLINEAR Grphs GRAPHS Liner equtions hve the form = m+ where the power of (n ) is lws. The re lle

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

Chapter 4 State-Space Planning

Chapter 4 State-Space Planning Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different

More information

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

In right-angled triangles the square on the side subtending the right angle is equal to the squares on the sides containing the right angle.

In right-angled triangles the square on the side subtending the right angle is equal to the squares on the sides containing the right angle. Mth 3329-Uniform Geometries Leture 06 1. Review of trigonometry While we re looking t Eulid s Elements, I d like to look t some si trigonometry. Figure 1. The Pythgoren theorem sttes tht if = 90, then

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

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

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

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

m m m m m m m m P m P m ( ) m m P( ) ( ). The o-ordinte of the point P( ) dividing the line segment joining the two points ( ) nd ( ) eternll in the r

m m m m m m m m P m P m ( ) m m P( ) ( ). The o-ordinte of the point P( ) dividing the line segment joining the two points ( ) nd ( ) eternll in the r CO-ORDINTE GEOMETR II I Qudrnt Qudrnt (-.+) (++) X X - - - 0 - III IV Qudrnt - Qudrnt (--) - (+-) Region CRTESIN CO-ORDINTE SSTEM : Retngulr Co-ordinte Sstem : Let X' OX nd 'O e two mutull perpendiulr

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

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

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

SECTION A STUDENT MATERIAL. Part 1. What and Why.?

SECTION A STUDENT MATERIAL. Part 1. What and Why.? SECTION A STUDENT MATERIAL Prt Wht nd Wh.? Student Mteril Prt Prolem n > 0 n > 0 Is the onverse true? Prolem If n is even then n is even. If n is even then n is even. Wht nd Wh? Eploring Pure Mths Are

More information

Momentum and Energy Review

Momentum and Energy Review Momentum n Energy Review Nme: Dte: 1. A 0.0600-kilogrm ll trveling t 60.0 meters per seon hits onrete wll. Wht spee must 0.0100-kilogrm ullet hve in orer to hit the wll with the sme mgnitue of momentum

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

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

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005 RLETON UNIVERSIT eprtment of Eletronis ELE 2607 Swithing iruits erury 28, 05; 0 pm.0 Prolems n Most Solutions, Set, 2005 Jn. 2, #8 n #0; Simplify, Prove Prolem. #8 Simplify + + + Reue to four letters (literls).

More information

Proving the Pythagorean Theorem

Proving the Pythagorean Theorem Proving the Pythgoren Theorem W. Bline Dowler June 30, 2010 Astrt Most people re fmilir with the formul 2 + 2 = 2. However, in most ses, this ws presented in lssroom s n solute with no ttempt t proof or

More information

T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions.

T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions. Rel Vribles, Fll 2014 Problem set 5 Solution suggestions Exerise 1. Let f be bsolutely ontinuous on [, b] Show tht nd T b (f) P b (f) f (x) dx [f ] +. Conlude tht if f is in AC then it is the differene

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

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

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

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

2.4 Linear Inequalities and Interval Notation

2.4 Linear Inequalities and Interval Notation .4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or

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

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

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

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

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

Review of Gaussian Quadrature method

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

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

50 AMC Lectures Problem Book 2 (36) Substitution Method

50 AMC Lectures Problem Book 2 (36) Substitution Method 0 AMC Letures Prolem Book Sustitution Metho PROBLEMS Prolem : Solve for rel : 9 + 99 + 9 = Prolem : Solve for rel : 0 9 8 8 Prolem : Show tht if 8 Prolem : Show tht + + if rel numers,, n stisf + + = Prolem

More 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

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

2.1 ANGLES AND THEIR MEASURE. y I

2.1 ANGLES AND THEIR MEASURE. y I .1 ANGLES AND THEIR MEASURE Given two interseting lines or line segments, the mount of rottion out the point of intersetion (the vertex) required to ring one into orrespondene with the other is lled the

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

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

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 5 Supplement Greedy Algorithms Cont d Minimizing lteness Ching (NOT overed in leture) Adm Smith 9/8/10 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov,

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

The vertex leafage of chordal graphs

The vertex leafage of chordal graphs The vertex lefge of horl grphs Steven Chplik, Jurj Stho b Deprtment of Physis n Computer Siene, Wilfri Lurier University, 75 University Ave. West, Wterloo, Ontrio N2L 3C5, Cn b DIMAP n Mthemtis Institute,

More 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

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

More 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

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

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

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

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

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

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

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then Slrs-7.2-ADV-.7 Improper Definite Integrls 27.. D.dox Pge of Improper Definite Integrls Before we strt the min topi we present relevnt lger nd it review. See Appendix J for more lger review. Inequlities:

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