Homomorphisms from sparse graphs with large girth
|
|
- Joshua Simon
- 7 years ago
- Views:
Transcription
1 Homomorphisms from sparse graphs wih large girh O.V. Borodin, S.-J. Kim, A.V. Kosochka, D.B. Wes revised April, 200 Absrac We show ha a planar graph wih girh a leas 20 2 has circular chromaic number a mos 2+ 1, improving earlier resuls. This follows from a general resul esablishing homomorphisms ino special arges for graphs wih given girh and given maximum average degree. Oher applicaions concern oriened chromaic number and homomorphisms ino mixed graphs wih colored edges. Keywords: graph coloring, graph homomorphism, planar graph, circular coloring, oriened coloring, discharging, -nice graphs 1 Inroducion Circular coloring, inroduced by Vince [1], is a model for coloring he verices of graphs ha provides a more refined measure of coloring difficuly han he ordinary chromaic number. A (k, d)-coloring of a graph G is a map φ: V (G) {0,..., k 1} such ha d φ(u) φ(v) k d for every edge Parially suppored by grans and of he Russian Foundaion for Fundamenal Research and he Duch-Russian Gran NWO Parially suppored by NSF gran DMS and by INTAS gran Parially suppored by NSA gran MDA The U.S. grans supporing A.V. Kosochka and D.B. Wes require he disclaimer ha any opinions, findings, and conclusions or recommendaions expressed in his publicaion are hose of he auhor(s) and do no necessarily reflec he views of he NSF or NSA. 1
2 uv E(G); a graph having such a coloring is (k, d)-colorable. Noe ha a (k, 1)-coloring is an ordinary proper k-coloring. The circular chromaic number χ c (G) of a graph G is he infimum of k over all pairs (k, d) such ha G is (k, d)-colorable. A (k, d)-coloring is d circular in he sense ha we may view he k colors as poins on a circle, and he requiremen for (k, d)-coloring is ha he colors on adjacen verices mus be a leas d posiions apar on he circle. Zhu [15] provides a horough survey of resuls on circular chromaic number. We call χ c a refined measure of coloring because χ(g) 1 < χ c (G) χ(g) for every graph G, as proved in [1] and again in [2]. A -chromaic graph is no 2-colorable, bu if is circular chromaic number is near 2, hen i is somehow jus barely no 2-colorable. For odd cycles, χ c (C 2+1 ) = If G conains C 2+1, hen χ c (G) By he heorem of Grözsch [7], every riangle-free planar graph is -colorable. In generalizing his o circular chromaic number, we ask wha hreshold on girh is needed o force he circular chromaic number o be a mos A relaxaion for planar graphs of a conjecure of Jaeger [9] on nowhere-zero flows saes he following: Conjecure 1.1 For every posiive ineger, every planar graph wih girh a leas 4 has circular chromaic number a mos When = 1, Conjecure 1.1 reduces o Grözsch s Theorem. The conjecure is sharp if rue, as shown by DeVos [5]. The example of DeVos consiss of 4 1 pahs of lengh 2 1 wih a common endpoin, plus a cycle of lengh 4 1 hrough he verices on he opposie ends of he pahs. The graph has girh 4 1, bu i has no (2 + 1, )-coloring (he color on he cenral verex canno appear on he peripheral cycle, and wih his resricion ha cycle canno be colored). Thus he circular chromaic number exceeds Nešeřil and Zhu [12] and Galuccio, Goddyn, and Hell [6] proved ha every planar graph wih girh a leas 10 4 has circular chromaic number a mos In [6] here are also analogous bounds for all surfaces. The odd girh of a graph is he minimum lengh of is odd cycles; Klosermeyer and Zhang [10] showed ha for circular chromaic number a mos i suffices o have odd girh a leas 10 4, via he Folding Lemma. Zhu [14] improved he bound from 10 4 o 8. We furher lower his hreshold o Our resul applies in a more general seing for which we inerpre (k, d)-colorings as homomorphisms. A homomorphism from G ino H is a map φ: V (G) V (H) such ha adjacen verices in G are mapped 2
3 ino adjacen verices in H. Le H(k, d) be he circulan graph wih verex se {0,..., k 1} in which i and j are adjacen if and only if d i j k d. Every (k, d)-coloring of a graph G is a homomorphism from G ino H(k, d). We acually consider a sill more general seing ha also applies o oriened homomorphisms and o homomorphisms ino mixed graphs wih colored edges and arcs. Oher applicaions include a new upper bound on he girh of planar graphs wih oriened chromaic number greaer han 5. In paricular, we show ha for every orienaion of a planar graph wih girh a leas 1, here is a homomorphism ino some ournamen wih five verices. This was known previously for girh a leas 14 via a lenghy proof [], bu he improvemen o 1 is an easy consequence of our main heorem. Our original moivaion was he resul of Zhu on Conjecure 1.1. To see how our heorem improves his hreshold from 8 o 20 2, we firs sae he relevan special case of our heorem. For graphs wih given girh and given upper bound on he average degree of all subgraphs, we prove he exisence of homomorphisms ino special arges. For his example, we are ineresed in he arge H(2 + 1, ). Theorem 1.2 If g 6 2 and d < 2 +, hen every graph wih girh g 5 2 whose subgraphs all have average degree a mos d is (2 + 1)-colorable. Corollary 1. If G is a planar graph G wih girh a leas 20 2, hen G is (2 + 1 )-colorable. Proof. Since 20 2 > 6 2, Theorem 1.2 applies if we can show ha every subgraph of G has average degree less han 2 +. I suffices o show his 5 2 bound for G iself, since every subgraph has girh a leas as large as he girh of G. We may assume ha G is 2-conneced, since we can combine (2 + 1, )- colorings of blocks. Le n, m, f be he numbers of verices, edges, and faces in some planar embedding of G. By summing face-lenghs, he bound on girh yields f 6m/(20 2). Wih d denoing he average degree, we have m = dn/2. Using Euler s Formula, we have 2 = n m+f m( 2 1+ ). d 10 1 Since he facor in parenheses mus be posiive, we obain 10 4 < 2; ha 10 1 d is, d < The argumen of Corollary 1. holds equally well for graphs embeddable on he projecive plane. For graphs embeddable on he orus or Klein bole, i also works when he girh is sricly greaer han 20 2.
4 Secion 2 inroduces definiions and noaion and saes he main resul. In Secion, we apply he resul o graphs embedded in surfaces, o circular chromaic number, o oriened chromaic number of graphs wih large girh, and o homomorphisms of planar graphs wih colored edges. We prove he main resul in Secion 4 using a discharging argumen. 2 -Expansive s-graphs Since we are ineresed in applicaions o boh graphs and digraphs, we use a model ha incorporaes boh and is sill more general. A mixed graph is a common generalizaion of muligraphs and mulidigraphs ha allows boh ordered pairs (arcs) and unordered pairs (edges) of verices in he edge se. We augmen such a srucure by allowing a fixed coloring of he edges and arcs. Definiion. Le s denoe a pair (s 1, s 2 ) of nonnegaive inegers. An s-graph is a mixed graph wihou loops in which he arcs are colored from he se { 1,..., s 1 } and he edges are colored from he se {1,..., s 2 }, in such a way ha wo edges or wo arcs do no have he same color if hey have he same wo endpoins. In he applicaions discussed in Secion, we will only consider he cases where s is (0, 1) or (1, 0) or (0, ). A (0, 1)-graph is a simple undireced graph, and a (1, 0)-graph is an orienaion of such a graph. A (1, 2)-graph has arcs of color 1 and edges of colors 1 and 2. The noion of homomorphism exends o s-graphs; a homomorphism from an s-graph G o an s-graph H is a map from V (G) ino V (H) such ha he image of an edge or forward arc wih color c in G is an edge or forward arc wih color c in H. A walk (of lengh ) in an s-graph is a lis (v 0, e 1, v 1,..., e, v ) such ha each e i is an edge or an arc, and for each i he endpoins of e i are v i 1 and v i. The edges or arcs of a walk need no be disinc, and arcs need no be followed from ail o head. A walk wih firs verex v and las verex w is a v, w-walk. The paern of a walk of lengh is he lis (C 1,..., C ), where C i is he pair (c i, σ i ) consising of he color c i of e i and a sign σ i defined by { +, if ei is undireced or v σ i = i is he head of e i,, if v i is he ail of e i. 4
5 In paricular, he elemen ( 2, ) in he paern of a walk means ha he corresponding sep is an arc wih color 2 raversed from head o ail. For an s-graph G, he paerns of lengh are he -uples (C 1,..., C ) such ha C i = (c i, σ i ) wih c i { s 1,..., 1, 1,..., s 2 } and σ i = + if c i > 0 and σ i {+, } if c i < 0. The se of paerns is deermined by s. Definiion. An s-graph G is -nice if for all v, w V (G) (no necessarily disinc) and every paern of lengh, here is a v, w-walk wih his paern. When s = (0, 1), an s-graph G is essenially jus an undireced graph, and here is only one paern of lengh. Since v, v-walks are needed, no s-graph is 1-nice. The complee graph K n is 2-nice as a (0, 1)-graph if n. No biparie graph is -nice for any, since a v, w-walk of lengh can exis only when has he same pariy as he disance from v o w. The odd cycle C 2k+1 is 2k-nice, since from a fixed verex v every verex can be reached by a pah of even lengh a mos 2k, and such a walk can be increased o lengh 2k by repeaing edges. On he oher hand, C 2k+1 is no (2k 1)-nice, because a pah of odd lengh from a verex o iself mus raverse he full cycle, and hen is lengh is a leas 2k + 1. Remark 2.1 Every -nice s-graph is also ( + 1)-nice. Proof. Le G be a -nice s-graph; noe ha 2. Given verices v and w in G and a paern (C 1,..., C +1 ), here is a walk of lengh 1 wih paern C 1 from v o some verex u, since G is -nice. Again since G is -nice, here is a u, w-walk wih paern (C 2,..., C r+1 ). Togeher, hese form a v, w-walk of lengh + 1 wih paern (C 1,..., C r+1 ). A graph is nice if i is -nice for some. Nice graphs were used implicily in [11]. They were explicily sudied and characerized in [8]. In [8] i was also shown ha minimal graphs ha are homomorphic images of all planar s-graphs wih girh a leas g are nice. For anoher example, le C 2 n denoe he direced graph whose verices are he congruence classes modulo n and whose arcs are he ordered pairs of he form (i, i + 1) and (i, i + 2). This is an s-graph for s = (1, 0). There are 2 paerns of lengh, bu o show ha C 2 n is no (n 2)-nice we only need o show failure for one paern and one pair of verices. A walk whose paern has only plus-signs follows only forward arcs. We claim ha C 2 n has no such 5
6 walk of lengh n 2 from verex 0 o verex n. The oal upward moion in n 2 seps ha each add +1 or +2 is a leas n 2 and a mos 2n 4. Since no value in his range is congruen o n modulo n, he needed walk does no exis. On he oher hand, C 2 n is (n 1)-nice. This is easies o show (see Example 2.) by using a sronger concep ha we inroduce nex. Definiion. A verex v V (H) is a (c, σ)-successor of a se W of verices in an s-graph H if for some w W here is an edge or arc wih endpoins w and v ha has color c and sign σ when viewed from w o v. An s-graph H wih n verices is -expansive if for all nonempy W V (H) and every pair (c, σ), he number of (c, σ)-successors of W is a leas min{n, W + n 1 }. A verex in W may be a (c, σ)-successor of W. In a (0, 1)-graph G, he number of successors of W is he number of verices of G having neighbors in W. No biparie graph is -expansive, because a larges parie se does no have enough successors. We formalize -expansiveness for he wo examples ha we discussed earlier and will apply laer. Example 2.2 As a (0, 1)-graph, he undireced cycle C 2k+1 is 2k-expansive. Proof. When W 2k we need only W +1 successors. The elemens of W have disinc successors in he clockwise direcion. Since he oal number of verices is odd, when W < 2k + 1 here is a verex v on he cycle such ha v / W bu he verex w ha is wo posiions laer in he clockwise direcion belongs o W. Now he common neighbor of v and w is a successor of W ha we have no already couned. Example 2. As a (1, 0)-graph, he digraph C 2 n is (n 1)-expansive. Proof. Recall ha he arcs are he pairs of he form (i, i + 1) and (i, i + 2), modulo n. Here (c, σ) can be ( 1, +) or ( 1, ), seeking ou-neighbors of W or in-neighbors of W in he digraph, respecively. By symmery, we consider only ( 1, +). As in Example 2.2, we need only W + 1 successors. For each i W, he verex i + 1 is a successor; his yields W successors. If W < n, hen here exiss i such ha i W and i + 1 / W, and now i + 2 is a successor of W ha we have no already couned. By saring wih W = {v} and using applicaions of he definiion of - expansive, i follows ha from each verex v in a -expansive s-graph, we can 6
7 reach every verex (including v) via a walk of lengh wih a specified paern. Hence every -expansive s-graph is -nice. The more deailed saemen below is wha we need from his concep; again i is immediae from he definiion of -expansive. Remark 2.4 Le v be a verex in a -expansive s-graph H wih n verices. For every paern (C 1,..., C l ) of lengh l, he number of verices w such ha H conains a v, w-walk of lengh l wih paern (C 1,..., C l ) is a leas 1 + (n 1)l/. For ordinary graphs, we say ha a graph G is H-colorable if here is a homomorphism from G ino H; his reduces o ordinary k-colorabiliy when H = K k. We use he erm H-colorable for s-graphs in he same way. When H is an s-graph, an s-graph G is criically non-h-colorable if G is no H- colorable bu every proper subgraph of G is H-colorable. The skeleon of an s-graph G is he muligraph obained from G by ignoring he orienaions of is arcs and erasing all colors. Our main resul is he following. Theorem 2.5 Le H be a -expansive s-graph. Le G be an s-graph whose skeleon has girh g and has no subgraph wih average degree more han d. If g 2 and d < 2 + 6, hen G has a homomorphism ino H. 5 4 Since every subgraph of an H-colorable s-graph is also H-colorable, an equivalen phrasing of Theorem 2.5 is ha if H is a -expansive s-graph, and G is a criically non-h-colorable s-graph whose skeleon has girh a leas 2, hen he average verex degree of he skeleon is a leas Applicaions In his secion we presen several applicaions of Theorem 2.5. We begin by considering graphs embedded on surfaces. Noe ha all graphs embeddable in he plane also embed on higher surfaces. Corollary.1 Le H be a -expansive s-graph, and le G be a criically non- H-colorable s-graph of order n. If he skeleon of G embeds on he projecive plane, hen is girh is less han If i embeds on he orus or Klein bole, hen is girh is a mos
8 Proof. Le m be he number of edges in he skeleon of G. If he claimed conclusion fails, hen he girh g of he skeleon is a leas 2, and Theorem 2.5 applies. Wih average degree a leas , we have m n Le f be he number of faces in an embedding of he skeleon on a surface of Euler characerisic N. Since fg 2m, Euler s Formula yields ( N = n m + f m ) ( 2 = m g g ). 5 1 For he surfaces menioned, N 2. Hence 2 g only when N = , wih equaliy possible We review he applicaion o circular coloring described in Corollary 1., using he more general language. Corollary.2 Le be a posiive ineger. If G is a projecive planar graph wih girh a leas 20 2, or a graph embedding on he orus or Klein bole wih girh greaer han 20, hen χ c (G) Proof. The conclusion is equivalen o he exisence of a C 2+1 -coloring of G. By Remark 2.2, C 2+1 is 2-expansive as a (0, 1)-graph. Since aking subgraphs canno reduce girh, Corollary.1 implies ha G has no subgraph ha fails o be C 2+1 -colorable. The bound of Corollary.2 generalizes easily for oher surfaces. Nex we apply Corollary.1 o oriened coloring. Definiion. The oriened chromaic number of a simple graph G is he minimum k such ha every orienaion of G admis a homomorphism ino some simple digraph wih k verices. The arge digraph can be differen for differen orienaions of G, and we may assume ha in each case he arge is an orienaion of K k. In [11,, 4], bounds on he oriened chromaic number of planar graphs wih given girh were considered. I was proved in [11] ha here are planar graphs wih arbirarily large girh having oriened chromaic number 5, and ha every planar graph wih girh a leas 16 has oriened chromaic number a mos 5. I was also menioned ha some planar graph wih girh 7 has o(7) > 5. The quesion hen is wha is he minimum hreshold g such ha all planar graphs wih girh a leas g have oriened chromaic number a 8
9 mos 5. In [], he hreshold 16 was reduced o 14 by a somewha lenghy argumen. Corollary.1 yields an immediae srenghening o 1 and applies also for hree addiional surfaces. Corollary. Every graph wih girh a leas 1 ha embeds on he orus or Klein bole has oriened chromaic number a mos 5. In fac, every orienaion of such a graph has a homomorphism ino he same 5-verex regular ournamen C5. 2 Proof. The orienaions of a simple graph G are precisely he (1, 0)-graphs wih skeleon G. If some orienaion of G is no C5-colorable, 2 hen here is a criical such digraph D, and is girh is as large as ha of G. By Remark 2., C5 2 is 4-expansive. By Corollary.1, he girh of D is a mos 40 2, which is less han 1. Le M α denoe he family of all graphs such ha he average degree of every subgraph is sricly less han α. Theorem 2 in [4] says ha every graph in M 16/7 wih girh a leas 11 admis a homomorphism ino he ocahedron K 2,2,2. Since a planar n-verex graph wih girh g has a mos (n 2) edges, i follows ha every planar graph wih girh a leas 16 has average degree less han 16/7 and hence is K 2,2,2 -colorable. The proof of Theorem 2 in [4] akes more han pages. However, a sronger version of is corollary for planar graphs follows direcly from Theorem 2.5. Corollary.4 If G is a planar graph wih girh a leas 1, hen G is K 2,2,2 - colorable. Proof. Theorem 2.5 applies, since K 2,2,2 is 5-expansive, 1 = 5 2, and = 16 when = Finally, we apply he edge-pariioning aspec of Theorem 2.5. In connecion wih quesions in group heory, Alon and Marshall [1] sudied homomorphisms of graphs wih colored edges. Given a -edge-coloring of a simple graph G, le λ(g, c) be he leas number of verices in an edge-colored graph H such ha here is a coloring-preserving homomorphism from G ino H. In our erminology, his is a homomorphism of s-graphs, where s = (0, ). Alon and Marshall discussed he maximum of λ(g, c) when G is planar and c uses a mos colors. We obain an upper bound for planar graphs wih sufficienly large girh. g g 2 9
10 Corollary.5 Le G be a planar graph wih girh a leas For every coloring of G wih a mos colors, here is a color-preserving homomorphism from G ino an edge-colored graph wih 2+1 verices. The same image always suffices: a coloring of K 2+1 in which each color class is a spanning cycle. Proof. I is well known ha he complee graph K 2+1 decomposes ino Hamilonian cycles. Le H denoe he (0, )-graph obained by coloring he ih cycle in he decomposiion of K 2+1 wih color i. We obain ha H is 2-expansive, since for each iem in a paern, we can apply Remark 2.2 o he cycle in he corresponding color. By Corollary.1, every -edge-colored planar graph wih girh a leas 20 2 is H-colorable. 4 The Main Resul We will break he proof of Theorem 2.5 ino several lemmas. Throughou his secion, fix H as a -expansive s-graph wih n verices, and le G be a criically non-h-colorable s-graph whose skeleon has girh a leas 2. We develop various properies of he skeleon o show ha is average verex degree is large. We begin by inroducing convenien noaion. Le G denoe he skeleon of G. We use δ( G) for he minimum degree of G and d(v) for he degree in G of a verex v. If d(v) = 1, hen {v} can have only one (c, σ)-successor. Since H is -expansive, we conclude ha δ( G) 2. Definiion. A hread in a graph G is a pah whose inernal verices have degree 2 in G. Two verices are weak neighbors or weakly adjacen if hey are he endpoins of a hread (his includes adjacen verices, since hreads may have no inernal verices). Our approach in proving he lemmas is as follows. If he desired conclusion fails, hen from G we delee some verices o obain a subgraph G. By he criicaliy of G, G is H-colorable. Using he -expansiveness of H, we exend he resuling homomorphism from G ino H o obain an H-coloring of G, hus producing a conradicion. Lemma 4.1 Every hread in G has lengh a mos 1. 10
11 Proof. Oherwise, le P be a u, v-hread of lengh in G, and le G be he s-graph obained from G by deleing he inernal verices of P. Since 2, G is a proper subgraph of G. Criicaliy of G yields an H-coloring φ of G. Le (C 1,..., C ) be he paern of P. By he definiion of -nice, H conains a φ(u), φ(v)-walk wih paern (C 1,..., C ). By defining φ on he inernal verices of P using he verices of his walk in succession, we exend φ o an H-coloring of G, which is impossible. Corollary 4.2 No hree verices of Y are pairwise weakly adjacen, and no wo hreads have he same se of endpoins. Proof. Oherwise, by Lemma 4.1, G has a cycle of lengh a mos. Definiion. When u and v are weakly adjacen, le l uv denoe he lengh of a shores u, v-hread. Le Y = {v V ( G): d(v) }. A weak neighbor u of v is a weak Y -neighbor if u Y ; oherwise i is a weak 2-neighbor. For v V ( G), le N Y (v) denoe he se of weak Y -neighbors of v in G. For v Y, le f(v) = + u N Y (v) ( l vu). The nex wo lemmas place lower bounds on f(v) and on u N Y (v) f(u). The moivaion for doing his is as follows. If f(v) is small, hen v has few weak Y -neighbors or long hreads o hem. Boh condiions end o reduce he average verex degree. Since we wan a lower bound on he average verex degree in G, i helps o place lower bound on values of f. Lemma 4. If v Y, hen f(v) 1. Proof. Le G be he s-graph obained from G by deleing v and all is weak 2-neighbors. By he minimaliy of G, here is an H-coloring φ of G. Suppose ha he desired inequaliy fails; we exend φ o an H-coloring of G. Consider u N Y (v). Le P u be he u, v-hread in G. Le W 0 = {u}, and for i > 0 le W i be he se of verices a which he ih verex of P could be embedded in exending φ along P u. Since H is -expansive, W i 1 + n 1 i. Leing i = l vu, we conclude ha a mos n 1 ( l vu ) verices of H are excluded from serving as he image of v in an exension of φ o P u. If some verex of H is no excluded by P u for any u N Y (v), hen φ exends o G. Hence we conclude ha n 1 ( l vu ) n > n 1, u N Y (v) 11
12 which yields u N Y (v) ( l vu) > and hence f(v) > 0. Now f(v) 1 follows from he inegraliy of f(v). Lemma 4.4 If v Y, hen u N Y (v) f(u) + 1. Proof. Say ha a verex u N Y (v) is v-free if f(u) l uv. Le G be obained from G by deleing he verex v, he v-free verices, and all heir weak 2-neighbors. By he criicaliy of G, here is an H-coloring φ of G. By Corollary 4.2, φ is defined on all of N Y (u) {v} for each u N Y (v). If u is v-free, hen as in Lemma 4. he verices of N Y (u) {v} exclude a mos n 1 y N Y (u) {v} ( l yu) verices of H from serving as he image of u in an exension of φ along he hreads from N Y (u) {v} o u. By he definiion of f, his quaniy equals n 1 (f(u)+l vu ). Since u is v-free, we have f(u)+l vu, and he number of verices excluded from serving as he image of u is a mos n 1. In paricular, a leas one is available. Accouning for he possibiliy ha f(u) + l vu is sricly less han, we compue ha a leas 1 + n 1 ( l vu f(u)) verices of H are available for he image of u. In exending he homomorphism along he hread from u o v, he number of possible images for he curren verex increases by a leas n 1 wih each of he l vu seps, because H is -expansive. By he ime we reach v, here are hus a leas 1 + n 1 ( f(u)) verices available for he image of v in an exension of φ o all he weak neighbors of u. The number of verices forbidden from being he image is a mos n 1 n 1 ( f(u)), which equals n 1 f(u). When u N Y (v) is no v-free, φ(u) is fixed. In his case, as in Lemma 4., a leas 1 + n 1 l vu verices of H can serve as he image of v in an exension of φ o he u, v-hread, and a mos n 1 ( l vu ) verices are excluded. Since l vu < f(u), fewer han n 1 f(u) verices are excluded. Since G has no H-coloring, every verex of H mus be excluded from serving as he image of v in a leas one of hese exensions. This requires n 1 u N Y (v) f(u) n. Since every f(u) is an ineger, we have f(u) + 1. u N Y (v) We complee he proof using a discharging argumen. We rea d(v) as an iniial charge on he verex v V ( G). We will move charge from verex o verex, wihou changing he oal, o obain a new charge d (v) such ha d (v) 2 + 4d(v) for all v V ( G). (1)
13 Le p = V ( G) and m = E( G). If (1) holds, hen 2m = d (v) ( 2 + 4d(v) 2 ) = 5 v V ( G) v V ( G) ( ) 2p m, and hence 5 1 p 5 4 m. This makes he average degree of G a leas 2(5 1) 5 5 which equals Hence i suffices o obain 5 4 d so ha (1) holds. 5 4, Discharging Rules Given a muligraph G wih d(u) denoing he degree of verex u as an iniial charge, define an adjused charge d (u) for each u V ( G) by he following operaions: R1. Every v Y gives each weak 2-neighbor he amoun 5. R2. Every v Y gives each weak Y -neighbor he amoun f(v)+(+1)(d(v) ) 5d(v). Lemma 4.5 Every v Y receives from is weak Y -neighbors a leas Proof. If every u N Y (v) sends v a leas f(u), hen v receives from N 5 Y (v) a leas 1 5 u N Y (v) f(u). By Lemma 4.4, u N Y (v) f(u) + 1. Hence we may assume ha f(u)+(+1)(d(u) ) < f(u) for some u N 5d(u) 5 Y (v). This requires d(u) 4. Hence we can cancel d(u) afer clearing fracions o obain f(u) > + 1. When f(u) + 1, he formula in R2 yields ha u by iself gives v a leas +1. For y N 5 Y (v), we have d(y) and f(y) 1 (by Lemma 4.), so all oher amouns sen o v are nonnegaive. Lemma 4.6 The inequaliy (1) holds for he charge d obained for G via he Discharging Rules. Proof. If d(v) = 2, hen v sends ou nohing and receives from each of 5 is wo weak Y -neighbors. Thus d (v) = = 2 + 4d(v) Now consider v Y. Verex v sends ou 5 w N Y (v) (l vw 1) o is weak 2-neighbors and f(v)+(+1)(d(v) ) o is weak Y -neighbors. By Lemma 4.5, v 5 also receives a leas +1 from is weak Y -neighbors. Since also f(v) = + 5 ( lvw ) by definiion, we obain (wih each sum running over w N Y (v)) d (v) d(v) f(v) + ( + 1)(d(v) 4) (lvw 1) 5 5 = d(v) [ + ] ( l wv + l vw 1) 5 = d(v) 5 [5 ( 1) ( + 1)] ( + 1)(d(v) 4)) 5 ( + 2)d(v) [ + 4( + 1)] =. 5
14 Since d(v) and 2, we have ( + 2)d(v) = ( + 2)d(v) ( 2) + (10 2) = (d(v) ) + 2d(v) (10 2) 4d(v) Therefore, (+2)d(v) and also he heorem. 2+ 4d(v) 2, which complees he proof of he lemma 5 References [1] N. Alon and T.H. Marshall, Homomorphisms of edge-coloured graphs and Coxeer groups. J. Algebraic Combinaorics 8 (1998), 5 1. [2] J. A. Bondy and P. Hell, A noe on he sar chromaic number. J. Graph Theory 14 (1990), [] O. V. Borodin, A. V. Kosochka, J. Nešeřil, A. Raspaud, and E. Sopena, On he maximum average degree and he oriened chromaic number of a graph, Discree Mah. 206 (1999), [4] O. V. Borodin, A. V. Kosochka, J. Nešeřil, A. Raspaud, and E. Sopena, On universal graphs for planar oriened graphs of a given girh, Discree Mah. 188 (1998), [5] M. DeVos, communicaion a Workshop on Flows and Cycles, Simon Fraser Univ., June [6] A. Galuccio, L. Goddyn, and P. Hell, High girh graphs avoiding a minor are nearly biparie, J. Comb. Theory (B) 8 (2001), [7] H. Grözsch, Ein Dreifarbensaz für dreikreisfreie Neze auf der Kugel, Wiss. Z. Marin-Luher-U., Halle-Wienberg, Mah.-Na. Reihe 8 (1959), [8] P. Hell, A. V. Kosochka, A. Raspaud, and E. Sopena, On nice graphs, Discree Mah. 24 (2001), [9] F. Jaeger, On circular flows in graphs, in: Finie and Infinie Ses (Eger, 1981), Colloq. Mah. Soc. J. Bolyai 7 (1984), Norh Holland,
15 [10] W. Klosermeyer and C.-Q. Zhang, (2+ɛ)-coloring of planar graphs wih large odd girh, J. Graph Theory (2000), [11] J. Nešeřil, A. Raspaud, and E. Sopena, Colorings and girh of oriened planar graphs, Discree Mah (1997), [12] J. Nešeřil and X. Zhu, On bounded ree-widh dualiy of graphs, J. Graph Theory 2 (1996), [1] A. Vince, Sar chromaic number, J. Graph Theory 12 (1988), [14] X. Zhu, Circular chromaic number of planar graphs of large odd girh, Elecronic J. of Combinaorics 8 (2001), # R25 [15] X. Zhu, Circular chromaic number: a survey, Discree Mah. 229 (2001),
On the degrees of irreducible factors of higher order Bernoulli polynomials
ACTA ARITHMETICA LXII.4 (1992 On he degrees of irreducible facors of higher order Bernoulli polynomials by Arnold Adelberg (Grinnell, Ia. 1. Inroducion. In his paper, we generalize he curren resuls on
More informationMTH6121 Introduction to Mathematical Finance Lesson 5
26 MTH6121 Inroducion o Mahemaical Finance Lesson 5 Conens 2.3 Brownian moion wih drif........................... 27 2.4 Geomeric Brownian moion........................... 28 2.5 Convergence of random
More informationAppendix A: Area. 1 Find the radius of a circle that has circumference 12 inches.
Appendi A: Area worked-ou s o Odd-Numbered Eercises Do no read hese worked-ou s before aemping o do he eercises ourself. Oherwise ou ma mimic he echniques shown here wihou undersanding he ideas. Bes wa
More informationPermutations and Combinations
Permuaions and Combinaions Combinaorics Copyrigh Sandards 006, Tes - ANSWERS Barry Mabillard. 0 www.mah0s.com 1. Deermine he middle erm in he expansion of ( a b) To ge he k-value for he middle erm, divide
More informationThe Transport Equation
The Transpor Equaion Consider a fluid, flowing wih velociy, V, in a hin sraigh ube whose cross secion will be denoed by A. Suppose he fluid conains a conaminan whose concenraion a posiion a ime will be
More informationANALYSIS AND COMPARISONS OF SOME SOLUTION CONCEPTS FOR STOCHASTIC PROGRAMMING PROBLEMS
ANALYSIS AND COMPARISONS OF SOME SOLUTION CONCEPTS FOR STOCHASTIC PROGRAMMING PROBLEMS R. Caballero, E. Cerdá, M. M. Muñoz and L. Rey () Deparmen of Applied Economics (Mahemaics), Universiy of Málaga,
More informationChapter 7. Response of First-Order RL and RC Circuits
Chaper 7. esponse of Firs-Order L and C Circuis 7.1. The Naural esponse of an L Circui 7.2. The Naural esponse of an C Circui 7.3. The ep esponse of L and C Circuis 7.4. A General oluion for ep and Naural
More informationModule 4. Single-phase AC circuits. Version 2 EE IIT, Kharagpur
Module 4 Single-phase A circuis ersion EE T, Kharagpur esson 5 Soluion of urren in A Series and Parallel ircuis ersion EE T, Kharagpur n he las lesson, wo poins were described:. How o solve for he impedance,
More informationCHARGE AND DISCHARGE OF A CAPACITOR
REFERENCES RC Circuis: Elecrical Insrumens: Mos Inroducory Physics exs (e.g. A. Halliday and Resnick, Physics ; M. Sernheim and J. Kane, General Physics.) This Laboraory Manual: Commonly Used Insrumens:
More informationRandom Walk in 1-D. 3 possible paths x vs n. -5 For our random walk, we assume the probabilities p,q do not depend on time (n) - stationary
Random Walk in -D Random walks appear in many cones: diffusion is a random walk process undersanding buffering, waiing imes, queuing more generally he heory of sochasic processes gambling choosing he bes
More informationChapter 2 Kinematics in One Dimension
Chaper Kinemaics in One Dimension Chaper DESCRIBING MOTION:KINEMATICS IN ONE DIMENSION PREVIEW Kinemaics is he sudy of how hings moe how far (disance and displacemen), how fas (speed and elociy), and how
More informationA Note on Using the Svensson procedure to estimate the risk free rate in corporate valuation
A Noe on Using he Svensson procedure o esimae he risk free rae in corporae valuaion By Sven Arnold, Alexander Lahmann and Bernhard Schwezler Ocober 2011 1. The risk free ineres rae in corporae valuaion
More information4. International Parity Conditions
4. Inernaional ariy ondiions 4.1 urchasing ower ariy he urchasing ower ariy ( heory is one of he early heories of exchange rae deerminaion. his heory is based on he concep ha he demand for a counry's currency
More informationChapter 13. Network Flow III Applications. 13.1 Edge disjoint paths. 13.1.1 Edge-disjoint paths in a directed graphs
Chaper 13 Nework Flow III Applicaion CS 573: Algorihm, Fall 014 Ocober 9, 014 13.1 Edge dijoin pah 13.1.1 Edge-dijoin pah in a direced graph 13.1.1.1 Edge dijoin pah queiong: graph (dir/undir)., : verice.
More information17 Laplace transform. Solving linear ODE with piecewise continuous right hand sides
7 Laplace ransform. Solving linear ODE wih piecewise coninuous righ hand sides In his lecure I will show how o apply he Laplace ransform o he ODE Ly = f wih piecewise coninuous f. Definiion. A funcion
More informationcooking trajectory boiling water B (t) microwave 0 2 4 6 8 101214161820 time t (mins)
Alligaor egg wih calculus We have a large alligaor egg jus ou of he fridge (1 ) which we need o hea o 9. Now here are wo accepable mehods for heaing alligaor eggs, one is o immerse hem in boiling waer
More informationThe Torsion of Thin, Open Sections
EM 424: Torsion of hin secions 26 The Torsion of Thin, Open Secions The resuls we obained for he orsion of a hin recangle can also be used be used, wih some qualificaions, for oher hin open secions such
More informationDifferential Equations. Solving for Impulse Response. Linear systems are often described using differential equations.
Differenial Equaions Linear sysems are ofen described using differenial equaions. For example: d 2 y d 2 + 5dy + 6y f() d where f() is he inpu o he sysem and y() is he oupu. We know how o solve for y given
More informationChapter 2 Problems. 3600s = 25m / s d = s t = 25m / s 0.5s = 12.5m. Δx = x(4) x(0) =12m 0m =12m
Chaper 2 Problems 2.1 During a hard sneeze, your eyes migh shu for 0.5s. If you are driving a car a 90km/h during such a sneeze, how far does he car move during ha ime s = 90km 1000m h 1km 1h 3600s = 25m
More information4 Convolution. Recommended Problems. x2[n] 1 2[n]
4 Convoluion Recommended Problems P4.1 This problem is a simple example of he use of superposiion. Suppose ha a discree-ime linear sysem has oupus y[n] for he given inpus x[n] as shown in Figure P4.1-1.
More information2.4 Network flows. Many direct and indirect applications telecommunication transportation (public, freight, railway, air, ) logistics
.4 Nework flow Problem involving he diribuion of a given produc (e.g., waer, ga, daa, ) from a e of producion locaion o a e of uer o a o opimize a given objecive funcion (e.g., amoun of produc, co,...).
More informationSingle-machine Scheduling with Periodic Maintenance and both Preemptive and. Non-preemptive jobs in Remanufacturing System 1
Absrac number: 05-0407 Single-machine Scheduling wih Periodic Mainenance and boh Preempive and Non-preempive jobs in Remanufacuring Sysem Liu Biyu hen Weida (School of Economics and Managemen Souheas Universiy
More informationImproper Integrals. Dr. Philippe B. laval Kennesaw State University. September 19, 2005. f (x) dx over a finite interval [a, b].
Improper Inegrls Dr. Philippe B. lvl Kennesw Se Universiy Sepember 9, 25 Absrc Noes on improper inegrls. Improper Inegrls. Inroducion In Clculus II, sudens defined he inegrl f (x) over finie inervl [,
More informationDuration and Convexity ( ) 20 = Bond B has a maturity of 5 years and also has a required rate of return of 10%. Its price is $613.
Graduae School of Business Adminisraion Universiy of Virginia UVA-F-38 Duraion and Convexiy he price of a bond is a funcion of he promised paymens and he marke required rae of reurn. Since he promised
More informationRC (Resistor-Capacitor) Circuits. AP Physics C
(Resisor-Capacior Circuis AP Physics C Circui Iniial Condiions An circui is one where you have a capacior and resisor in he same circui. Suppose we have he following circui: Iniially, he capacior is UNCHARGED
More information11/6/2013. Chapter 14: Dynamic AD-AS. Introduction. Introduction. Keeping track of time. The model s elements
Inroducion Chaper 14: Dynamic D-S dynamic model of aggregae and aggregae supply gives us more insigh ino how he economy works in he shor run. I is a simplified version of a DSGE model, used in cuing-edge
More informationAP Calculus AB 2013 Scoring Guidelines
AP Calculus AB 1 Scoring Guidelines The College Board The College Board is a mission-driven no-for-profi organizaion ha connecs sudens o college success and opporuniy. Founded in 19, he College Board was
More informationINTEREST RATE FUTURES AND THEIR OPTIONS: SOME PRICING APPROACHES
INTEREST RATE FUTURES AND THEIR OPTIONS: SOME PRICING APPROACHES OPENGAMMA QUANTITATIVE RESEARCH Absrac. Exchange-raded ineres rae fuures and heir opions are described. The fuure opions include hose paying
More informationSteps for D.C Analysis of MOSFET Circuits
10/22/2004 Seps for DC Analysis of MOSFET Circuis.doc 1/7 Seps for D.C Analysis of MOSFET Circuis To analyze MOSFET circui wih D.C. sources, we mus follow hese five seps: 1. ASSUME an operaing mode 2.
More informationAP Calculus BC 2010 Scoring Guidelines
AP Calculus BC Scoring Guidelines The College Board The College Board is a no-for-profi membership associaion whose mission is o connec sudens o college success and opporuniy. Founded in, he College Board
More informationCapacitors and inductors
Capaciors and inducors We coninue wih our analysis of linear circuis by inroducing wo new passive and linear elemens: he capacior and he inducor. All he mehods developed so far for he analysis of linear
More informationForecasting and Information Sharing in Supply Chains Under Quasi-ARMA Demand
Forecasing and Informaion Sharing in Supply Chains Under Quasi-ARMA Demand Avi Giloni, Clifford Hurvich, Sridhar Seshadri July 9, 2009 Absrac In his paper, we revisi he problem of demand propagaion in
More informationPROFIT TEST MODELLING IN LIFE ASSURANCE USING SPREADSHEETS PART ONE
Profi Tes Modelling in Life Assurance Using Spreadshees PROFIT TEST MODELLING IN LIFE ASSURANCE USING SPREADSHEETS PART ONE Erik Alm Peer Millingon 2004 Profi Tes Modelling in Life Assurance Using Spreadshees
More informationA Curriculum Module for AP Calculus BC Curriculum Module
Vecors: A Curriculum Module for AP Calculus BC 00 Curriculum Module The College Board The College Board is a no-for-profi membership associaion whose mission is o connec sudens o college success and opporuniy.
More informationAcceleration Lab Teacher s Guide
Acceleraion Lab Teacher s Guide Objecives:. Use graphs of disance vs. ime and velociy vs. ime o find acceleraion of a oy car.. Observe he relaionship beween he angle of an inclined plane and he acceleraion
More informationSTABILITY OF LOAD BALANCING ALGORITHMS IN DYNAMIC ADVERSARIAL SYSTEMS
STABILITY OF LOAD BALANCING ALGORITHMS IN DYNAMIC ADVERSARIAL SYSTEMS ELLIOT ANSHELEVICH, DAVID KEMPE, AND JON KLEINBERG Absrac. In he dynamic load balancing problem, we seek o keep he job load roughly
More informationIndividual Health Insurance April 30, 2008 Pages 167-170
Individual Healh Insurance April 30, 2008 Pages 167-170 We have received feedback ha his secion of he e is confusing because some of he defined noaion is inconsisen wih comparable life insurance reserve
More informationCoupling Online and Offline Analyses for Random Power Law Graphs
Inerne Mahemaics Vol, No 4: 409-46 Coupling Online and Offline Analyses for Random Power Law Graphs FanChungandLinyuanLu Absrac We develop a coupling echnique for analyzing online models by using offline
More informationCointegration: The Engle and Granger approach
Coinegraion: The Engle and Granger approach Inroducion Generally one would find mos of he economic variables o be non-saionary I(1) variables. Hence, any equilibrium heories ha involve hese variables require
More informationTop-K Structural Diversity Search in Large Networks
Top-K Srucural Diversiy Search in Large Neworks Xin Huang, Hong Cheng, Rong-Hua Li, Lu Qin, Jeffrey Xu Yu The Chinese Universiy of Hong Kong Guangdong Province Key Laboraory of Popular High Performance
More information9. Capacitor and Resistor Circuits
ElecronicsLab9.nb 1 9. Capacior and Resisor Circuis Inroducion hus far we have consider resisors in various combinaions wih a power supply or baery which provide a consan volage source or direc curren
More informationImagine a Source (S) of sound waves that emits waves having frequency f and therefore
heoreical Noes: he oppler Eec wih ound Imagine a ource () o sound waes ha emis waes haing requency and hereore period as measured in he res rame o he ource (). his means ha any eecor () ha is no moing
More informationEconomics Honors Exam 2008 Solutions Question 5
Economics Honors Exam 2008 Soluions Quesion 5 (a) (2 poins) Oupu can be decomposed as Y = C + I + G. And we can solve for i by subsiuing in equaions given in he quesion, Y = C + I + G = c 0 + c Y D + I
More informationOption Put-Call Parity Relations When the Underlying Security Pays Dividends
Inernaional Journal of Business and conomics, 26, Vol. 5, No. 3, 225-23 Opion Pu-all Pariy Relaions When he Underlying Securiy Pays Dividends Weiyu Guo Deparmen of Finance, Universiy of Nebraska Omaha,
More informationPresent Value Methodology
Presen Value Mehodology Econ 422 Invesmen, Capial & Finance Universiy of Washingon Eric Zivo Las updaed: April 11, 2010 Presen Value Concep Wealh in Fisher Model: W = Y 0 + Y 1 /(1+r) The consumer/producer
More informationTSG-RAN Working Group 1 (Radio Layer 1) meeting #3 Nynashamn, Sweden 22 nd 26 th March 1999
TSG-RAN Working Group 1 (Radio Layer 1) meeing #3 Nynashamn, Sweden 22 nd 26 h March 1999 RAN TSGW1#3(99)196 Agenda Iem: 9.1 Source: Tile: Documen for: Moorola Macro-diversiy for he PRACH Discussion/Decision
More informationOn Certain Properties of Random Apollonian Networks
On Cerain Properies of Random Apollonian Neworks Alan Frieze, Charalampos E. Tsourakakis Deparmen of Mahemaical Sciences, Carnegie Mellon Universiy, USA af1p@random.mah.cmu.edu, csourak@mah.cmu.edu Absrac.
More information1 HALF-LIFE EQUATIONS
R.L. Hanna Page HALF-LIFE EQUATIONS The basic equaion ; he saring poin ; : wrien for ime: x / where fracion of original maerial and / number of half-lives, and / log / o calculae he age (# ears): age (half-life)
More informationInductance and Transient Circuits
Chaper H Inducance and Transien Circuis Blinn College - Physics 2426 - Terry Honan As a consequence of Faraday's law a changing curren hrough one coil induces an EMF in anoher coil; his is known as muual
More informationAnswer, Key Homework 2 David McIntyre 45123 Mar 25, 2004 1
Answer, Key Homework 2 Daid McInyre 4123 Mar 2, 2004 1 This prin-ou should hae 1 quesions. Muliple-choice quesions may coninue on he ne column or page find all choices before making your selecion. The
More informationTEMPORAL PATTERN IDENTIFICATION OF TIME SERIES DATA USING PATTERN WAVELETS AND GENETIC ALGORITHMS
TEMPORAL PATTERN IDENTIFICATION OF TIME SERIES DATA USING PATTERN WAVELETS AND GENETIC ALGORITHMS RICHARD J. POVINELLI AND XIN FENG Deparmen of Elecrical and Compuer Engineering Marquee Universiy, P.O.
More informationPulse-Width Modulation Inverters
SECTION 3.6 INVERTERS 189 Pulse-Widh Modulaion Inverers Pulse-widh modulaion is he process of modifying he widh of he pulses in a pulse rain in direc proporion o a small conrol signal; he greaer he conrol
More informationTable of contents Chapter 1 Interest rates and factors Chapter 2 Level annuities Chapter 3 Varying annuities
Table of conens Chaper 1 Ineres raes and facors 1 1.1 Ineres 2 1.2 Simple ineres 4 1.3 Compound ineres 6 1.4 Accumulaed value 10 1.5 Presen value 11 1.6 Rae of discoun 13 1.7 Consan force of ineres 17
More informationarxiv:math/0111328v1 [math.co] 30 Nov 2001
arxiv:mah/038v [mahco 30 Nov 00 EVALUATIONS OF SOME DETERMINANTS OF MATRICES RELATED TO THE PASCAL TRIANGLE C Kraenhaler Insiu für Mahemaik der Universiä Wien, Srudlhofgasse 4, A-090 Wien, Ausria e-mail:
More informationDETERMINISTIC INVENTORY MODEL FOR ITEMS WITH TIME VARYING DEMAND, WEIBULL DISTRIBUTION DETERIORATION AND SHORTAGES KUN-SHAN WU
Yugoslav Journal of Operaions Research 2 (22), Number, 6-7 DEERMINISIC INVENORY MODEL FOR IEMS WIH IME VARYING DEMAND, WEIBULL DISRIBUION DEERIORAION AND SHORAGES KUN-SHAN WU Deparmen of Bussines Adminisraion
More informationSTABILITY OF LOAD BALANCING ALGORITHMS IN DYNAMIC ADVERSARIAL SYSTEMS
SIAM J. COMPUT. Vol. 37, No. 5, pp. 1656 1673 c 2008 Sociey for Indusrial and Applied Mahemaics STABILITY OF LOAD BALANCING ALGORITHMS IN DYNAMIC ADVERSARIAL SYSTEMS ELLIOT ANSHELEVICH, DAVID KEMPE, AND
More informationA UNIFIED APPROACH TO MATHEMATICAL OPTIMIZATION AND LAGRANGE MULTIPLIER THEORY FOR SCIENTISTS AND ENGINEERS
A UNIFIED APPROACH TO MATHEMATICAL OPTIMIZATION AND LAGRANGE MULTIPLIER THEORY FOR SCIENTISTS AND ENGINEERS RICHARD A. TAPIA Appendix E: Differeniaion in Absrac Spaces I should be no surprise ha he differeniaion
More informationChapter 8: Regression with Lagged Explanatory Variables
Chaper 8: Regression wih Lagged Explanaory Variables Time series daa: Y for =1,..,T End goal: Regression model relaing a dependen variable o explanaory variables. Wih ime series new issues arise: 1. One
More informationPATHWISE PROPERTIES AND PERFORMANCE BOUNDS FOR A PERISHABLE INVENTORY SYSTEM
PATHWISE PROPERTIES AND PERFORMANCE BOUNDS FOR A PERISHABLE INVENTORY SYSTEM WILLIAM L. COOPER Deparmen of Mechanical Engineering, Universiy of Minnesoa, 111 Church Sree S.E., Minneapolis, MN 55455 billcoop@me.umn.edu
More informationNewton s Laws of Motion
Newon s Laws of Moion MS4414 Theoreical Mechanics Firs Law velociy. In he absence of exernal forces, a body moves in a sraigh line wih consan F = 0 = v = cons. Khan Academy Newon I. Second Law body. The
More informationMaking a Faster Cryptanalytic Time-Memory Trade-Off
Making a Faser Crypanalyic Time-Memory Trade-Off Philippe Oechslin Laboraoire de Securié e de Crypographie (LASEC) Ecole Polyechnique Fédérale de Lausanne Faculé I&C, 1015 Lausanne, Swizerland philippe.oechslin@epfl.ch
More informationMortality Variance of the Present Value (PV) of Future Annuity Payments
Morali Variance of he Presen Value (PV) of Fuure Annui Pamens Frank Y. Kang, Ph.D. Research Anals a Frank Russell Compan Absrac The variance of he presen value of fuure annui pamens plas an imporan role
More informationMechanical Fasteners Tensile and Shear Stress Areas
Mechanical Faseners Tensile and Shear Sress reas Lecure 28 Engineering 473 Machine Design Threaded Faseners Bol Threaded fasener designed o pass hrough holes in maing members and o be secured by ighening
More informationPricing Fixed-Income Derivaives wih he Forward-Risk Adjused Measure Jesper Lund Deparmen of Finance he Aarhus School of Business DK-8 Aarhus V, Denmark E-mail: jel@hha.dk Homepage: www.hha.dk/~jel/ Firs
More informationFourier Series & The Fourier Transform
Fourier Series & The Fourier Transform Wha is he Fourier Transform? Fourier Cosine Series for even funcions and Sine Series for odd funcions The coninuous limi: he Fourier ransform (and is inverse) The
More informationWorking Paper On the timing option in a futures contract. SSE/EFI Working Paper Series in Economics and Finance, No. 619
econsor www.econsor.eu Der Open-Access-Publikaionsserver der ZBW Leibniz-Informaionszenrum Wirschaf The Open Access Publicaion Server of he ZBW Leibniz Informaion Cenre for Economics Biagini, Francesca;
More informationTechnical Appendix to Risk, Return, and Dividends
Technical Appendix o Risk, Reurn, and Dividends Andrew Ang Columbia Universiy and NBER Jun Liu UC San Diego This Version: 28 Augus, 2006 Columbia Business School, 3022 Broadway 805 Uris, New York NY 10027,
More informationOn Learning Algorithms for Nash Equilibria
On Learning Algorihms for Nash Equilibria Consaninos Daskalakis 1, Rafael Frongillo 2, Chrisos H. Papadimiriou 2 George Pierrakos 2, and Gregory Valian 2 1 MIT, cosis@csail.mi.edu, 2 UC Berkeley, {raf
More informationKinematics in 1-D From Problems and Solutions in Introductory Mechanics (Draft version, August 2014) David Morin, morin@physics.harvard.
Chaper 2 Kinemaics in 1-D From Problems and Soluions in Inroducory Mechanics (Draf ersion, Augus 2014) Daid Morin, morin@physics.harard.edu As menioned in he preface, his book should no be hough of as
More informationFull-wave rectification, bulk capacitor calculations Chris Basso January 2009
ull-wave recificaion, bulk capacior calculaions Chris Basso January 9 This shor paper shows how o calculae he bulk capacior value based on ripple specificaions and evaluae he rms curren ha crosses i. oal
More informationRisk Modelling of Collateralised Lending
Risk Modelling of Collaeralised Lending Dae: 4-11-2008 Number: 8/18 Inroducion This noe explains how i is possible o handle collaeralised lending wihin Risk Conroller. The approach draws on he faciliies
More informationTWO OPTIMAL CONTROL PROBLEMS IN CANCER CHEMOTHERAPY WITH DRUG RESISTANCE
Annals of he Academy of Romanian Scieniss Series on Mahemaics and is Applicaions ISSN 266-6594 Volume 3, Number 2 / 211 TWO OPTIMAL CONTROL PROBLEMS IN CANCER CHEMOTHERAPY WITH DRUG RESISTANCE Werner Krabs
More informationSignal Processing and Linear Systems I
Sanford Universiy Summer 214-215 Signal Processing and Linear Sysems I Lecure 5: Time Domain Analysis of Coninuous Time Sysems June 3, 215 EE12A:Signal Processing and Linear Sysems I; Summer 14-15, Gibbons
More informationAs widely accepted performance measures in supply chain management practice, frequency-based service
MANUFACTURING & SERVICE OPERATIONS MANAGEMENT Vol. 6, No., Winer 2004, pp. 53 72 issn 523-464 eissn 526-5498 04 060 0053 informs doi 0.287/msom.030.0029 2004 INFORMS On Measuring Supplier Performance Under
More informationDifferential Equations and Linear Superposition
Differenial Equaions and Linear Superposiion Basic Idea: Provide soluion in closed form Like Inegraion, no general soluions in closed form Order of equaion: highes derivaive in equaion e.g. dy d dy 2 y
More informationVerification Theorems for Models of Optimal Consumption and Investment with Retirement and Constrained Borrowing
MATHEMATICS OF OPERATIONS RESEARCH Vol. 36, No. 4, November 2, pp. 62 635 issn 364-765X eissn 526-547 364 62 hp://dx.doi.org/.287/moor..57 2 INFORMS Verificaion Theorems for Models of Opimal Consumpion
More informationMarkit Excess Return Credit Indices Guide for price based indices
Marki Excess Reurn Credi Indices Guide for price based indices Sepember 2011 Marki Excess Reurn Credi Indices Guide for price based indices Conens Inroducion...3 Index Calculaion Mehodology...4 Semi-annual
More informationA Generalized Bivariate Ornstein-Uhlenbeck Model for Financial Assets
A Generalized Bivariae Ornsein-Uhlenbeck Model for Financial Asses Romy Krämer, Mahias Richer Technische Universiä Chemniz, Fakulä für Mahemaik, 917 Chemniz, Germany Absrac In his paper, we sudy mahemaical
More informationDiagnostic Examination
Diagnosic Examinaion TOPIC XV: ENGINEERING ECONOMICS TIME LIMIT: 45 MINUTES 1. Approximaely how many years will i ake o double an invesmen a a 6% effecive annual rae? (A) 10 yr (B) 12 yr (C) 15 yr (D)
More informationAnalysis of Tailored Base-Surge Policies in Dual Sourcing Inventory Systems
Analysis of Tailored Base-Surge Policies in Dual Sourcing Invenory Sysems Ganesh Janakiraman, 1 Sridhar Seshadri, 2, Anshul Sheopuri. 3 Absrac We sudy a model of a firm managing is invenory of a single
More informationReturn Calculation of U.S. Treasury Constant Maturity Indices
Reurn Calculaion of US Treasur Consan Mauri Indices Morningsar Mehodolog Paper Sepeber 30 008 008 Morningsar Inc All righs reserved The inforaion in his docuen is he proper of Morningsar Inc Reproducion
More informationLife insurance cash flows with policyholder behaviour
Life insurance cash flows wih policyholder behaviour Krisian Buchard,,1 & Thomas Møller, Deparmen of Mahemaical Sciences, Universiy of Copenhagen Universiesparken 5, DK-2100 Copenhagen Ø, Denmark PFA Pension,
More informationMeasuring macroeconomic volatility Applications to export revenue data, 1970-2005
FONDATION POUR LES ETUDES ET RERS LE DEVELOPPEMENT INTERNATIONAL Measuring macroeconomic volailiy Applicaions o expor revenue daa, 1970-005 by Joël Cariolle Policy brief no. 47 March 01 The FERDI is a
More informationVector Autoregressions (VARs): Operational Perspectives
Vecor Auoregressions (VARs): Operaional Perspecives Primary Source: Sock, James H., and Mark W. Wason, Vecor Auoregressions, Journal of Economic Perspecives, Vol. 15 No. 4 (Fall 2001), 101-115. Macroeconomericians
More informationThe Application of Multi Shifts and Break Windows in Employees Scheduling
The Applicaion of Muli Shifs and Brea Windows in Employees Scheduling Evy Herowai Indusrial Engineering Deparmen, Universiy of Surabaya, Indonesia Absrac. One mehod for increasing company s performance
More informationWHAT ARE OPTION CONTRACTS?
WHAT ARE OTION CONTRACTS? By rof. Ashok anekar An oion conrac is a derivaive which gives he righ o he holder of he conrac o do 'Somehing' bu wihou he obligaion o do ha 'Somehing'. The 'Somehing' can be
More informationOptimal Stock Selling/Buying Strategy with reference to the Ultimate Average
Opimal Sock Selling/Buying Sraegy wih reference o he Ulimae Average Min Dai Dep of Mah, Naional Universiy of Singapore, Singapore Yifei Zhong Dep of Mah, Naional Universiy of Singapore, Singapore July
More informationStrategic Optimization of a Transportation Distribution Network
Sraegic Opimizaion of a Transporaion Disribuion Nework K. John Sophabmixay, Sco J. Mason, Manuel D. Rossei Deparmen of Indusrial Engineering Universiy of Arkansas 4207 Bell Engineering Cener Fayeeville,
More informationDYNAMIC MODELS FOR VALUATION OF WRONGFUL DEATH PAYMENTS
DYNAMIC MODELS FOR VALUATION OF WRONGFUL DEATH PAYMENTS Hong Mao, Shanghai Second Polyechnic Universiy Krzyszof M. Osaszewski, Illinois Sae Universiy Youyu Zhang, Fudan Universiy ABSTRACT Liigaion, exper
More informationThe naive method discussed in Lecture 1 uses the most recent observations to forecast future values. That is, Y ˆ t + 1
Business Condiions & Forecasing Exponenial Smoohing LECTURE 2 MOVING AVERAGES AND EXPONENTIAL SMOOTHING OVERVIEW This lecure inroduces ime-series smoohing forecasing mehods. Various models are discussed,
More informationMotion Along a Straight Line
Moion Along a Sraigh Line On Sepember 6, 993, Dave Munday, a diesel mechanic by rade, wen over he Canadian edge of Niagara Falls for he second ime, freely falling 48 m o he waer (and rocks) below. On his
More informationAppendix D Flexibility Factor/Margin of Choice Desktop Research
Appendix D Flexibiliy Facor/Margin of Choice Deskop Research Cheshire Eas Council Cheshire Eas Employmen Land Review Conens D1 Flexibiliy Facor/Margin of Choice Deskop Research 2 Final Ocober 2012 \\GLOBAL.ARUP.COM\EUROPE\MANCHESTER\JOBS\200000\223489-00\4
More informationThe Heisenberg group and Pansu s Theorem
The Heisenberg group and Pansu s Theorem July 31, 2009 Absrac The goal of hese noes is o inroduce he reader o he Heisenberg group wih is Carno- Carahéodory meric and o Pansu s differeniaion heorem. As
More informationKeldysh Formalism: Non-equilibrium Green s Function
Keldysh Formalism: Non-equilibrium Green s Funcion Jinshan Wu Deparmen of Physics & Asronomy, Universiy of Briish Columbia, Vancouver, B.C. Canada, V6T 1Z1 (Daed: November 28, 2005) A review of Non-equilibrium
More informationM-Degrees of Quadrangle-Free Planar Graphs
M-Degrees of Quadrangle-Free Planar Graphs Oleg V. Borodin, 1 Alexandr V. Kostochka, 1,2 Naeem N. Sheikh, 2 and Gexin Yu 3 1 SOBOLEV INSTITUTE OF MATHEMATICS NOVOSIBIRSK 630090, RUSSIA E-mail: brdnoleg@math.nsc.ru
More informationThe Grantor Retained Annuity Trust (GRAT)
WEALTH ADVISORY Esae Planning Sraegies for closely-held, family businesses The Granor Reained Annuiy Trus (GRAT) An efficien wealh ransfer sraegy, paricularly in a low ineres rae environmen Family business
More informationBALANCE OF PAYMENTS. First quarter 2008. Balance of payments
BALANCE OF PAYMENTS DATE: 2008-05-30 PUBLISHER: Balance of Paymens and Financial Markes (BFM) Lena Finn + 46 8 506 944 09, lena.finn@scb.se Camilla Bergeling +46 8 506 942 06, camilla.bergeling@scb.se
More informationNiche Market or Mass Market?
Niche Marke or Mass Marke? Maxim Ivanov y McMaser Universiy July 2009 Absrac The de niion of a niche or a mass marke is based on he ranking of wo variables: he monopoly price and he produc mean value.
More informationThe option pricing framework
Chaper 2 The opion pricing framework The opion markes based on swap raes or he LIBOR have become he larges fixed income markes, and caps (floors) and swapions are he mos imporan derivaives wihin hese markes.
More information