Linear choosability of graphs

Size: px
Start display at page:

Download "Linear choosability of graphs"

Transcription

1 Liner hoosility of grphs Louis Esperet, Mikel Montssier, André Rspud To ite this version: Louis Esperet, Mikel Montssier, André Rspud. Liner hoosility of grphs. Stefn Felsner Europen Conferene on Comintoris, Grph Theory nd Applitions (EuroCom 05), 2005, Berlin, Germny. Disrete Mthemtis nd Theoretil Computer Siene, DMTCS Proeedings vol. AE, Europen Conferene on Comintoris, Grph Theory nd Applitions (EuroCom 05), pp , 2005, DMTCS Proeedings. <hl > HAL Id: hl Sumitted on 14 Aug 2015 HAL is multi-disiplinry open ess rhive for the deposit nd dissemintion of sientifi reserh douments, whether they re pulished or not. The douments my ome from tehing nd reserh institutions in Frne or rod, or from puli or privte reserh enters. L rhive ouverte pluridisiplinire HAL, est destinée u dépôt et à l diffusion de douments sientifiques de niveu reherhe, puliés ou non, émnnt des étlissements d enseignement et de reherhe frnçis ou étrngers, des lortoires pulis ou privés.

2 EuroCom 2005 DMTCS pro. AE, 2005, Liner hoosility of grphs L. Esperet, M. Montssier nd A. Rspud LABRI, Université Bordeux 1, Domine Universitire, 351 ours de l Liértion, Tlene, Frne A proper vertex oloring of non oriented grph G = (V, E) is liner if the grph indued y the verties of two olor lsses is forest of pths. A grph G is L-list olorle if for given list ssignment L = {L(v) : v V }, there exists proper oloring of G suh tht (v) L(v) for ll v V. If G is L-list olorle for every list ssignment with L(v) k for ll v V, then G is sid k-hoosle. A grph is sid to e linery k-hoosle if the oloring otined is liner. In this pper, we investigte the liner hoosility of grphs for some fmilies of grphs: grphs with smll mximum degree, with given mximum verge degree, plnr grphs... Moreover, we prove tht determining whether iprtite suui plnr grph is linery 3-olorle is n NP-omplete prolem. Keywords: vertex-oloring, list, yli, 3-frugl, hoosility under onstrints. 1 Introdution Let G e grph. Let V (G) e its set of verties nd E(G) its set of edges. A proper vertex oloring of G is n ssignment of integers (or lels) to the verties of G suh tht (u) (v) if the verties u nd v re djent in G. A k-oloring is proper vertex oloring using k olors. A proper vertex oloring of grph is liner if the grph indued y the verties of two olor lsses is forest of pths. The liner hromti numer, Λ(G), of G is the smllest integer k suh tht G is linery k-olorle. Liner oloring ws introdued y Yuster in [Yus98]. Using tehnis sed on the Lovász Lol Lemm, he proved: Theorem 1 [Yus98] Let G e grph with mximum degree, then Λ(G) = O( 3 2 ). A liner oloring of grph G is equivlent to n yli 3-frugl oloring of G: n yli oloring is vertex oloring suh tht the grph indued y the verties of two olor lsses is forest nd n 3-frugl oloring is vertex oloring suh tht the grph indued y the verties of two olor lsses is n indued sugrph with mximum degree 2, i.e. the neighourhood of ny vertex ontins the sme olor t most two times. The lower ound Λ(G) /2 + 1 is onsequene of the 3-fruglity. This ound is rehed for simple lsses of grphs, suh s trees. A greedy oloring of tree using deep-first serh gives ( /2 + 1)-oloring. The liner hromti numer of the omplete iprtite grph is lso esy to ompute: if m n, Λ(K m,n ) = m/2 + n. A grph G is L-list olorle if for given list ssignment L = {L(v) : v V (G)} there is oloring of the verties suh tht (v) L(v) nd (v) (u) if u nd v re djent in G. If G is L-list olorle for every list ssignment with L(v) k for ll v V (G), then G is sid k-hoosle. In this pper we fous on liner hoosility of grphs. This is, for whih vlue k, ny list ssignement L, with L(v) k for ll v V (G) llows liner oloring of G. Let Λ l (G) e the smllest integer k suh tht G is linery k-hoosle. We prove: Disrete Mthemtis nd Theoretil Computer Siene (DMTCS), Nny, Frne

3 100 Louis Esperet, Mikël Montssier nd André Rspud Theorem 2 Let G e n outerplnr grph with mximum degree, then Λ l (G) Theorem 3 Let G e grph with mximum degree, then: 1. If 3, then Λ l (G) If 4, then Λ l (G) 9. Let G e grph, the mximum verge degree of G, denoted y Md(G) is: Md(G) = mx{2 E(H) / V (H), H G}. Notie tht the mximum verge degree of grph n e omputed in polynomil time y using the Mtroid Prtitioning Algorithm due to Edmonds [Edm65, SU97]. Theorem 4 Let G e grph with mximum degree : 1. If 3 nd Md(G) < 16 7, then Λl (G) = If Md(G) < 5 2, then Λl (G) If Md(G) < 8 3, then Λl (G) Sine every plnr grph G with girth g(g) verifies Md(G) < 2g(G) g(g) 2, for plnr grphs we otin: Corollry 1 Let G e plnr grph with mximum degree : 1. If 3 nd g(g) 16, then Λ l (G) = If g(g) 10, then Λ l (G) If g(g) 8, then Λ l (G) 2 Oserve tht yles re linery 3-hoosle; hene, we nnot remove the ondition on in Theorem 4.1. Theorem 5 Let G e plnr grph with mximum degree 9, then Λ l (G) Theorem 6 Deiding whether iprtite suui plnr grph is linery 3-olorle is n NP-omplete prolem. 2 Proof skethes In the following, k-vertex (resp. k-vertex, k-vertex) is vertex of degree k (resp. k, k). Sketh of proof of Theorem 2 In [BGH03], Bonihon, Gvoille nd Hnusse show tht n outerplnr grph n e deomposed into spnning tree nd set of edges M. Eh edge of M links vertex v with the vertex f(v) defined s follows : if v hs rother t its left, then f(v) is v s rightmost left rother. Else f(v) = f(u), where u is v s fther (see Figure 1.). We olor the verties of G greedily using deep-first serh in the spnning tree. At eh step of the lgorithm, the vertex tht we re trying to olor hs t most /2 + 1 olors foridden y its neighourhood (t distne t most 2). Thus, there is t lest one olor in the list of the urrent vertex tht is not foridden, nd this greedy lgorithm gives liner oloring of G given lists of size t lest / During the proess, we distinguish two types of verties : those whih do not hve ny rother t their left (Type 1 verties, tht n rete ihromti yles), nd the others (Type 2 verties).

4 Liner hoosility of grphs 101 u u w v v w ) ) ) Figure 1: ) An exmple of the deomposition of n outerplnr grph. ) A vertex of Type 1. ) A vertex of Type 2. Sketh of proof of Theorem 3.1 The proof is sed on the method of the reduile onfigurtions. Let G e ounterexmple with minimum order. We prove tht G does not ontin the onfigurtions depited in Figure 2, thus otining ontrdition. Figure 2: The reduile onfigurtions. The proof of Theorem 3.2 lso uses the method of reduile onfigurtions. Sketh of proof of Theorem 4.2 Let H e ounterexmple of minimum order with Md(G) < 5 2. By minimlity, H does not ontin the following onfigurtions: 1. 1-verties, 2. two djent 2-verties, 3. 3-vertex djent to three 2-verties. We omplete the proof of Theorem 4.1 with dishrging proedure. First, we ssign to eh vertex v hrge ω(v) equl to its degree. We then pply the following dishrging rule: Rule 1 Eh 3-vertex gives 1 4 to eh djent 2-vertex. Let ω (v) e the new hrge of the vertex v fter the dishrging proedure. Let v e k-vertex (with k 2, sine H does not ontin ny 1-verties): If k = 2, then ω(v) = 2 nd ω (v) = = 5 2 sine v is not djent to ny 2-vertex nd v reeives 1 4 from eh djent vertex y Rule 1.

5 102 Louis Esperet, Mikël Montssier nd André Rspud If k = 3, then ω(v) = 3 nd ω (v) sine v is djent to t most two 2-verties nd thus gives t most y Rule 1. If k 4, then ω(v) = k nd ω (v) k k 1 4 3k 4 > 5 2 sine v my e djent to k 2-verties. So, v V (H), ω (v) 5 2. Now, oserve tht 2 E(H) = v V (H) ω(v) = v V (H) ω (v). Then, y definition of the mximum verge degree, we hve : Md(H) 2 E(H) v V (K) = ω (v) 5/2 V (H) = 5 V (H) V (H) V (H) 2 The ontrdition with Md(H) ompletes the proof of Theorem 4.2. The proof of Theorems 4.1 nd 4.3 re sed on the sme method nd on similr rguments. Sketh of proof of Theorem 5 The proof of Theorem 5 is sed on vn den Heuvel nd MGuinness struturl lemm [vdhm03] nd on the method of reduile onfigurtions. Sketh of proof of Theorem 6 Let us first show the existene of speil iprtite suui plnr grph E(x, y) (see Figure 3). The grph E(x, y) is suui, plnr, nd iprtite. Moreover, ny liner 3-oloring of E(x, y) verifies: (x) = (y). x y Figure 3: The grph E(x, y) : ny liner 3-oloring of E(x, y) verifies: (x) = (y) The proof of the NP-ompleteness proeeds y redution to the prolem of 3-oloring of plnr grphs, tht is n NP-omplete prolem [GJS76]. Given n instne of this prolem plnr grph G, we need to rete iprtite suui plnr grph H of size polynomil in V (G) suh tht H is linery 3-olorle if nd only if G is 3-olorle. We onstrut H s follows: For ll k-vertex u of G, we reple u y inry tree T u with k leves in H suh tht eh edge xy of T u is repled y E(x, y). Now, for ll djent vertex w of u in G, we ssoite one lef u w in H. Finlly, for eh edge uv of G, we dd in H n edge linking u v nd v u (see Figure 4). Suppose now tht there exists 3-oloring of G. By pplying the olor of the vertex v to the root of the tree T v in H, it is esy to extend the oloring to otin liner 3-oloring of H (rell tht if the root of T v hs the olor, then every lef of T v hs the olor nd given the olor of the root of T, it exists liner 3-oloring of T ). Conversely, if it exists liner 3-oloring of H, it exists 3-oloring of G y pplying the olor of the root of the tree T v in H to the vertex v in G.

6 Liner hoosility of grphs 103 v u v v u u v u T v T u 3 Conlusion We onlude with some open prolems: Figure 4: The onstrution of H from G Prolem 1 Is it true tht every suui grph different from K 3,3 is linery 4-olorle? Prolem 2 Minimize the rel vlues 1 nd suh tht every plnr grph with mximum degree dmits liner ( + )-oloring? Referenes [BGH03] N. Bonihon, C. Gvoille, nd N. Hnusse. Cnonil deomposition of outerplnr mps nd pplition to enumertion, oding, nd genertion. In WG2003: 29 th Interntionl Workshop, Grph - Theoreti Conepts in Computer Siene, pges 81 92, [Edm65] [GJS76] [SU97] J.R. Edmonds. Minimum prtition of mtroid into independent susets. J.Res, Nt. Bur. Stndrds, 69B:67 72, M.R. Grey, D.S. Johnson, nd L.J. Stokmeyer. Some simplified NP-omplete grph prolems. Theor. Comput. Si., 1(3): , E.R. Sheiermnn nd D.H. Ullmn. Frtionl Grph Theory: A Rtionl Approh to the Theory of Grphs. Wiley-Intersiene series, [vdhm03] J. vn den Heuvel nd S. MGuinness. Coloring the squre of plnr grph. Journl of Grph Theory, (42): , [Yus98] R. Yuster. Liner oloring of grphs. Disrete Mth., (185): , 1998.

7 104 Louis Esperet, Mikël Montssier nd André Rspud

Graph States EPIT Mehdi Mhalla (Calgary, Canada) Simon Perdrix (Grenoble, France)

Graph States EPIT Mehdi Mhalla (Calgary, Canada) Simon Perdrix (Grenoble, France) Grph Sttes EPIT 2005 Mehdi Mhll (Clgry, Cnd) Simon Perdrix (Grenole, Frne) simon.perdrix@img.fr Grph Stte: Introdution A grph-sed representtion of the entnglement of some (lrge) quntum stte. Verties: quits

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

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

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

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

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

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

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

#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS

#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS #A42 INTEGERS 11 (2011 ON THE CONDITIONED BINOMIAL COEFFICIENTS Liqun To Shool of Mthemtil Sienes, Luoyng Norml University, Luoyng, Chin lqto@lynuedun Reeived: 12/24/10, Revised: 5/11/11, Aepted: 5/16/11,

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

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

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

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

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing

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

Graph width-parameters and algorithms

Graph width-parameters and algorithms Grph width-prmeters nd lgorithms Jisu Jeong (KAIST) joint work with Sigve Hortemo Sæther nd Jn Arne Telle (University of Bergen) 2015 KMS Annul Meeting 2015.10.24. YONSEI UNIVERSITY Grph width-prmeters

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

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

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

Directed acyclic graphs with the unique dipath property

Directed acyclic graphs with the unique dipath property Direte yli grphs with the unique ipth property Jen-Clue Bermon, Mihel Cosnr, Stéphne érennes To ite this version: Jen-Clue Bermon, Mihel Cosnr, Stéphne érennes. Direte yli grphs with the unique ipth property.

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

First Midterm Examination

First Midterm Examination 24-25 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet

More information

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

CS 573 Automata Theory and Formal Languages

CS 573 Automata Theory and Formal Languages Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple

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

Solvability of Cubic Graphs - From Four Color Theorem to NP-Complete

Solvability of Cubic Graphs - From Four Color Theorem to NP-Complete Solvility of Cui Grphs - From Four Color Theorem to NP-Complete Tony T. Lee nd Qingqi Shi Stte Key Lortory of Advned Communition Systems nd Networks, Deprtment of Eletroni Engineering, Shnghi Jio Tong

More information

Hyers-Ulam stability of Pielou logistic difference equation

Hyers-Ulam stability of Pielou logistic difference equation vilble online t wwwisr-publitionsom/jns J Nonliner Si ppl, 0 (207, 35 322 Reserh rtile Journl Homepge: wwwtjnsom - wwwisr-publitionsom/jns Hyers-Ulm stbility of Pielou logisti differene eqution Soon-Mo

More information

Nondeterministic Automata vs Deterministic Automata

Nondeterministic Automata vs Deterministic Automata Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n

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

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

Aperiodic tilings and substitutions

Aperiodic tilings and substitutions Aperioi tilings n sustitutions Niols Ollinger LIFO, Université Orléns Journées SDA2, Amiens June 12th, 2013 The Domino Prolem (DP) Assume we re given finite set of squre pltes of the sme size with eges

More information

The Word Problem in Quandles

The Word Problem in Quandles The Word Prolem in Qundles Benjmin Fish Advisor: Ren Levitt April 5, 2013 1 1 Introdution A word over n lger A is finite sequene of elements of A, prentheses, nd opertions of A defined reursively: Given

More information

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

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

More information

Fast index for approximate string matching

Fast index for approximate string matching Fst index for pproximte string mthing Dekel Tsur Astrt We present n index tht stores text of length n suh tht given pttern of length m, ll the sustrings of the text tht re within Hmming distne (or edit

More information

Connectivity in Graphs. CS311H: Discrete Mathematics. Graph Theory II. Example. Paths. Connectedness. Example

Connectivity in Graphs. CS311H: Discrete Mathematics. Graph Theory II. Example. Paths. Connectedness. Example Connetiit in Grphs CSH: Disrete Mthemtis Grph Theor II Instrtor: Işıl Dillig Tpil qestion: Is it possile to get from some noe to nother noe? Emple: Trin netork if there is pth from to, possile to tke trin

More information

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6 CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized

More information

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw

More information

On Implicative and Strong Implicative Filters of Lattice Wajsberg Algebras

On Implicative and Strong Implicative Filters of Lattice Wajsberg Algebras Glol Journl of Mthemtil Sienes: Theory nd Prtil. ISSN 974-32 Volume 9, Numer 3 (27), pp. 387-397 Interntionl Reserh Pulition House http://www.irphouse.om On Implitive nd Strong Implitive Filters of Lttie

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

Bisimulation, Games & Hennessy Milner logic

Bisimulation, Games & Hennessy Milner logic Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory

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

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

MATH 573 FINAL EXAM. May 30, 2007

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

More information

Greedoid polynomial, chip-firing, and G-parking function for directed graphs. Connections in Discrete Mathematics

Greedoid polynomial, chip-firing, and G-parking function for directed graphs. Connections in Discrete Mathematics Greedoid polynomil, hip-firing, nd G-prking funtion for direted grphs Swee Hong Chn Cornell University Connetions in Disrete Mthemtis June 15, 2015 Motivtion Tutte polynomil [Tut54] is polynomil defined

More information

Trigonometry and Constructive Geometry

Trigonometry and Constructive Geometry Trigonometry nd Construtive Geometry Trining prolems for M2 2018 term 1 Ted Szylowie tedszy@gmil.om 1 Leling geometril figures 1. Prtie writing Greek letters. αβγδɛθλµπψ 2. Lel the sides, ngles nd verties

More information

Figure 1. The left-handed and right-handed trefoils

Figure 1. The left-handed and right-handed trefoils The Knot Group A knot is n emedding of the irle into R 3 (or S 3 ), k : S 1 R 3. We shll ssume our knots re tme, mening the emedding n e extended to solid torus, K : S 1 D 2 R 3. The imge is lled tuulr

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

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

( ) { } [ ] { } [ ) { } ( ] { } 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

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

ANTIPODAL BIPOLAR FUZZY GRAPHS. Muhammad Akram. Sheng-Gang Li. K.P. Shum. 1. Introduction

ANTIPODAL BIPOLAR FUZZY GRAPHS. Muhammad Akram. Sheng-Gang Li. K.P. Shum. 1. Introduction itlin journl of pure nd pplied mthemtis n. 31 2013 (97 110) 97 ANTIPODAL BIPOLAR FUZZY GRAPHS Muhmmd Akrm Punj University College of Informtion Tehnology University of the Punj Old Cmpus, Lhore-54000 Pkistn

More information

Welcome. Balanced search trees. Balanced Search Trees. Inge Li Gørtz

Welcome. Balanced search trees. Balanced Search Trees. Inge Li Gørtz Welome nge Li Gørt. everse tehing n isussion of exerises: 02110 nge Li Gørt 3 tehing ssistnts 8.00-9.15 Group work 9.15-9.45 isussions of your solutions in lss 10.00-11.15 Leture 11.15-11.45 Work on exerises

More information

MATH Final Review

MATH Final Review MATH 1591 - Finl Review November 20, 2005 1 Evlution of Limits 1. the ε δ definition of limit. 2. properties of limits. 3. how to use the diret substitution to find limit. 4. how to use the dividing out

More information

More Properties of the Riemann Integral

More Properties of the Riemann Integral More Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologil Sienes nd Deprtment of Mthemtil Sienes Clemson University Februry 15, 2018 Outline More Riemnn Integrl Properties The Fundmentl

More information

Negative results on acyclic improper colorings

Negative results on acyclic improper colorings Negative results on acyclic improper colorings Pascal Ochem To cite this version: Pascal Ochem. Negative results on acyclic improper colorings. Stefan Felsner. 005 European Conference on Combinatorics,

More information

Single-Player and Two-Player Buttons & Scissors Games (Extended Abstract)

Single-Player and Two-Player Buttons & Scissors Games (Extended Abstract) Single-Plyer nd Two-Plyer Buttons & Sissors Gmes (Extended Astrt) Kyle Burke 1, Erik D. Demine 2, Hrrison Gregg 3, Roert A. Hern 4, Adm Hestererg 2, Mihel Hoffmnn 5, Hiro Ito 6, Irin Kostitsyn 7, Jody

More information

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar) Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of

More information

First Midterm Examination

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

More information

Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata

Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata Desriptionl Complexity of Non-Unry Self-Verifying Symmetri Differene Automt Lurette Mris 1,2 nd Lynette vn Zijl 1 1 Deprtment of Computer Siene, Stellenosh University, South Afri 2 Merk Institute, CSIR,

More information

ON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups. Sang Keun Lee

ON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups. Sang Keun Lee Kngweon-Kyungki Mth. Jour. 10 (2002), No. 2, pp. 117 122 ON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups Sng Keun Lee Astrt. In this pper, we give some properties of left(right) semi-regulr nd g-regulr

More information

Learning Partially Observable Markov Models from First Passage Times

Learning Partially Observable Markov Models from First Passage Times Lerning Prtilly Oservle Mrkov s from First Pssge s Jérôme Cllut nd Pierre Dupont Europen Conferene on Mhine Lerning (ECML) 8 Septemer 7 Outline. FPT in models nd sequenes. Prtilly Oservle Mrkov s (POMMs).

More information

Hamiltonian Cycle in Complete Multipartite Graphs

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

More information

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

Pre-Lie algebras, rooted trees and related algebraic structures

Pre-Lie algebras, rooted trees and related algebraic structures Pre-Lie lgers, rooted trees nd relted lgeri strutures Mrh 23, 2004 Definition 1 A pre-lie lger is vetor spe W with mp : W W W suh tht (x y) z x (y z) = (x z) y x (z y). (1) Exmple 2 All ssoitive lgers

More information

Arrow s Impossibility Theorem

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

More information

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

An Algebraic Algorithm for Weighted Linear Matroid Intersection

An Algebraic Algorithm for Weighted Linear Matroid Intersection An Algeri Algorithm for Weighted Liner Mtroid Intersetion Nihols J. A. Hrvey Msshusetts Institute of ehnology nikh@mit.edu Astrt We present new lgeri lgorithm for the lssil prolem of weighted mtroid intersetion.

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

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

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

Alpha Algorithm: Limitations

Alpha Algorithm: Limitations Proess Mining: Dt Siene in Ation Alph Algorithm: Limittions prof.dr.ir. Wil vn der Alst www.proessmining.org Let L e n event log over T. α(l) is defined s follows. 1. T L = { t T σ L t σ}, 2. T I = { t

More information

Similar Right Triangles

Similar Right Triangles Geometry V1.noteook Ferury 09, 2012 Similr Right Tringles Cn I identify similr tringles in right tringle with the ltitude? Cn I identify the proportions in right tringles? Cn I use the geometri mens theorems

More information

Prefix-Free Regular-Expression Matching

Prefix-Free Regular-Expression Matching Prefix-Free Regulr-Expression Mthing Yo-Su Hn, Yjun Wng nd Derik Wood Deprtment of Computer Siene HKUST Prefix-Free Regulr-Expression Mthing p.1/15 Pttern Mthing Given pttern P nd text T, find ll sustrings

More information

15-451/651: Design & Analysis of Algorithms December 3, 2013 Lecture #28 last changed: November 28, 2013

15-451/651: Design & Analysis of Algorithms December 3, 2013 Lecture #28 last changed: November 28, 2013 15-451/651: Design & nlysis of lgorithms Deemer 3, 2013 Leture #28 lst hnged: Novemer 28, 2013 Lst time we strted tlking out mehnism design: how to llote n item to the person who hs the mximum vlue for

More information

MATH 409 Advanced Calculus I Lecture 22: Improper Riemann integrals.

MATH 409 Advanced Calculus I Lecture 22: Improper Riemann integrals. MATH 409 Advned Clulus I Leture 22: Improper Riemnn integrls. Improper Riemnn integrl If funtion f : [,b] R is integrble on [,b], then the funtion F(x) = x f(t)dt is well defined nd ontinuous on [,b].

More information

Free groups, Lecture 2, part 1

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

More information

A CLASS OF GENERAL SUPERTREE METHODS FOR NESTED TAXA

A CLASS OF GENERAL SUPERTREE METHODS FOR NESTED TAXA A CLASS OF GENERAL SUPERTREE METHODS FOR NESTED TAXA PHILIP DANIEL AND CHARLES SEMPLE Astrt. Amlgmting smller evolutionry trees into single prent tree is n importnt tsk in evolutionry iology. Trditionlly,

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

CIRCULAR COLOURING THE PLANE

CIRCULAR COLOURING THE PLANE CIRCULAR COLOURING THE PLANE MATT DEVOS, JAVAD EBRAHIMI, MOHAMMAD GHEBLEH, LUIS GODDYN, BOJAN MOHAR, AND REZA NASERASR Astrct. The unit distnce grph R is the grph with vertex set R 2 in which two vertices

More information

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

Graph Algorithms. Vertex set = { a,b,c,d } Edge set = { {a,c}, {b,c}, {c,d}, {b,d}} Figure 1: An example for a simple graph

Graph Algorithms. Vertex set = { a,b,c,d } Edge set = { {a,c}, {b,c}, {c,d}, {b,d}} Figure 1: An example for a simple graph Inin Institute of Informtion Tehnology Design n Mnufturing, Knheepurm, Chenni 00, Ini An Autonomous Institute uner MHRD, Govt of Ini http://www.iiitm..in COM 0T Design n Anlysis of Algorithms -Leture Notes

More information

Co-ordinated s-convex Function in the First Sense with Some Hadamard-Type Inequalities

Co-ordinated s-convex Function in the First Sense with Some Hadamard-Type Inequalities Int. J. Contemp. Mth. Sienes, Vol. 3, 008, no. 3, 557-567 Co-ordinted s-convex Funtion in the First Sense with Some Hdmrd-Type Inequlities Mohmmd Alomri nd Mslin Drus Shool o Mthemtil Sienes Fulty o Siene

More information

8.3 THE HYPERBOLA OBJECTIVES

8.3 THE HYPERBOLA OBJECTIVES 8.3 THE HYPERBOLA OBJECTIVES 1. Define Hperol. Find the Stndrd Form of the Eqution of Hperol 3. Find the Trnsverse Ais 4. Find the Eentriit of Hperol 5. Find the Asmptotes of Hperol 6. Grph Hperol HPERBOLAS

More information

1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.

1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true. York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech

More information

Bases for Vector Spaces

Bases for Vector Spaces Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

More information

arxiv: v1 [cs.cg] 28 Apr 2009

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

More information

CS241 Week 6 Tutorial Solutions

CS241 Week 6 Tutorial Solutions 241 Week 6 Tutoril olutions Lnguges: nning & ontext-free Grmmrs Winter 2018 1 nning Exerises 1. 0x0x0xd HEXINT 0x0 I x0xd 2. 0xend--- HEXINT 0xe I nd ER -- MINU - 3. 1234-120x INT 1234 INT -120 I x 4.

More information

arxiv: v1 [math.gr] 11 Jan 2019

arxiv: v1 [math.gr] 11 Jan 2019 The Generlized Dehn Property does not imply liner isoperimetri inequlity Owen Bker nd Timothy Riley rxiv:1901.03767v1 [mth.gr] 11 Jn 2019 Jnury 15, 2019 Astrt The Dehn property for omplex is tht every

More information

Semi-local string comparison

Semi-local string comparison Semi-lol string omprison Alexnder Tiskin http://www.ds.wrwik..uk/~tiskin Deprtment of Computer Siene University of Wrwik 1 The prolem 2 Effiient output representtion 3 The lgorithms 4 Conlusions nd future

More information

s the set of onsequenes. Skeptil onsequenes re more roust in the sense tht they hold in ll possile relities desried y defult theory. All its desirle p

s the set of onsequenes. Skeptil onsequenes re more roust in the sense tht they hold in ll possile relities desried y defult theory. All its desirle p Skeptil Rtionl Extensions Artur Mikitiuk nd Miros lw Truszzynski University of Kentuky, Deprtment of Computer Siene, Lexington, KY 40506{0046, frtur mirekg@s.engr.uky.edu Astrt. In this pper we propose

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

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

Dynamic Template Matching with Mixed-polarity Toffoli Gates

Dynamic Template Matching with Mixed-polarity Toffoli Gates Dynmi Templte Mthing with Mixed-polrity Toffoli Gtes Md Mzder Rhmn 1, Mthis Soeken 2,3, nd Gerhrd W. Duek 1 1 Fulty of Computer Siene, University of New Brunswik, Cnd 2 Deprtment of Mthemtis nd Computer

More information

Dong-Myung Lee, Jeong-Gon Lee, and Ming-Gen Cui. 1. introduction

Dong-Myung Lee, Jeong-Gon Lee, and Ming-Gen Cui. 1. introduction J. Kore So. Mth. Edu. Ser. B: Pure Appl. Mth. ISSN 16-0657 Volume 11, Number My 004), Pges 133 138 REPRESENTATION OF SOLUTIONS OF FREDHOLM EQUATIONS IN W Ω) OF REPRODUCING KERNELS Dong-Myung Lee, Jeong-Gon

More information

A Differential Approach to Inference in Bayesian Networks

A Differential Approach to Inference in Bayesian Networks Dierentil pproh to Inerene in Byesin Networks esented y Ynn Shen shenyn@mi.pitt.edu Outline Introdution Oeriew o lgorithms or inerene in Byesin networks (BN) oposed new pproh How to represent BN s multi-rite

More information

Arrow s Impossibility Theorem

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

More information

Håkan Lennerstad, Lars Lundberg

Håkan Lennerstad, Lars Lundberg GENERALIZATIONS OF THE FLOOR AND CEILING FUNCTIONS USING THE STERN-BROCOT TREE Håkn Lennerstd, Lrs Lunderg Blekinge Institute of Tehnology Reserh report No. 2006:02 Generliztions of the floor nd eiling

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

Solutions to Assignment 1

Solutions to Assignment 1 MTHE 237 Fll 2015 Solutions to Assignment 1 Problem 1 Find the order of the differentil eqution: t d3 y dt 3 +t2 y = os(t. Is the differentil eqution liner? Is the eqution homogeneous? b Repet the bove

More information

Pythagoras Theorem. The area of the square on the hypotenuse is equal to the sum of the squares on the other two sides

Pythagoras Theorem. The area of the square on the hypotenuse is equal to the sum of the squares on the other two sides Pythgors theorem nd trigonometry Pythgors Theorem The hypotenuse of right-ngled tringle is the longest side The hypotenuse is lwys opposite the right-ngle 2 = 2 + 2 or 2 = 2-2 or 2 = 2-2 The re of the

More information

nd edges. Eh edge hs either one endpoint: end(e) = fxg in whih se e is termed loop t vertex x, or two endpoints: end(e) = fx; yg in whih se e is terme

nd edges. Eh edge hs either one endpoint: end(e) = fxg in whih se e is termed loop t vertex x, or two endpoints: end(e) = fx; yg in whih se e is terme Theory of Regions Eri Bdouel nd Philippe Drondeu Iris, Cmpus de Beulieu, F-35042 Rennes Cedex, Frne E-mil : feri.bdouel,philippe.drondeug@iris.fr Astrt. The synthesis prolem for nets onsists in deiding

More information