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

Size: px
Start display at page:

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

Transcription

1 Greedoid polynomil, hip-firing, nd G-prking funtion for direted grphs Swee Hong Chn Cornell University Connetions in Disrete Mthemtis June 15, 2015

2 Motivtion Tutte polynomil [Tut54] is polynomil defined for undireted grphs tht hs pplitions to severl rnhes of mthemtis (grph oloring, knot theory, Ising model, et.). We re interested in generliztion of Tutte polynomil for direted grphs nd its onnetions to other topis in disrete mthemtis. Known Tutte-like polynomil for direted grphs: Cover polynomil [CG95], Greedoid polynomil [BKL85]. In this tlk, G is direted grph tht my hve loops nd multiple edges, nd is strongly onneted.

3 Motivtion Tutte polynomil [Tut54] is polynomil defined for undireted grphs tht hs pplitions to severl rnhes of mthemtis (grph oloring, knot theory, Ising model, et.). We re interested in generliztion of Tutte polynomil for direted grphs nd its onnetions to other topis in disrete mthemtis. Known Tutte-like polynomil for direted grphs: Cover polynomil [CG95], Greedoid polynomil [BKL85]. In this tlk, G is direted grph tht my hve loops nd multiple edges, nd is strongly onneted.

4 Motivtion Tutte polynomil [Tut54] is polynomil defined for undireted grphs tht hs pplitions to severl rnhes of mthemtis (grph oloring, knot theory, Ising model, et.). We re interested in generliztion of Tutte polynomil for direted grphs nd its onnetions to other topis in disrete mthemtis. Known Tutte-like polynomil for direted grphs: Cover polynomil [CG95], Greedoid polynomil [BKL85]. In this tlk, G is direted grph tht my hve loops nd multiple edges, nd is strongly onneted.

5 Motivtion Tutte polynomil [Tut54] is polynomil defined for undireted grphs tht hs pplitions to severl rnhes of mthemtis (grph oloring, knot theory, Ising model, et.). We re interested in generliztion of Tutte polynomil for direted grphs nd its onnetions to other topis in disrete mthemtis. Known Tutte-like polynomil for direted grphs: Cover polynomil [CG95], Greedoid polynomil [BKL85]. In this tlk, G is direted grph tht my hve loops nd multiple edges, nd is strongly onneted.

6 Rooted spnning tree Choose root vertex V (G). In -rooted spnning tree, there is uniue direted pth from to v for eh vertex v V (G). -rooted spnning trees

7 Externl tivity Fix totl order < e on E(G). Let T e -rooted spnning tree, nd let e E(G) \ E(T ). The grph T {e} hs uniue iruit C.

8 Externl tivity Fix totl order < e on E(G). Let T e -rooted spnning tree, nd let e E(G) \ E(T ). The grph T {e} hs uniue iruit C. e

9 Externl tivity Fix totl order < e on E(G). Let T e -rooted spnning tree, nd let e E(G) \ E(T ). The grph T {e} hs uniue iruit C. e

10 Externl tivity Fix totl order < e on E(G). Let T e -rooted spnning tree, nd let e E(G) \ E(T ). The grph T {e} hs uniue iruit C. e The iruit C deomposes to two direted pths P 1 nd P 2. Let P 1 e the pth tht ontins e. P 1 P 2

11 Externl tivity Fix totl order < e on E(G). Let T e -rooted spnning tree, nd let e E(G) \ E(T ). The grph T {e} hs uniue iruit C. e The iruit C deomposes to two direted pths P 1 nd P 2. Let P 1 e the pth tht ontins e. P 1 P 2 The edge e is externlly tive w.r.t.t if the smllest edge of E(C) is ontined in E(P 1 ).

12 Greedoid polynomil The externl tivity of T, denoted y ext(t ), is the numer of edges tht re externlly tive w.r.t T. The greedoid polynomil of G w.r.t root vertex is the polynomil λ (G; y) = T y ext(t ). The polynomil λ (G; y) does not depend on the totl ordering < e. If G is undireted, then λ (G; y) = y Ē(G) T (G; 1, y).

13 Greedoid polynomil The externl tivity of T, denoted y ext(t ), is the numer of edges tht re externlly tive w.r.t T. The greedoid polynomil of G w.r.t root vertex is the polynomil λ (G; y) = T y ext(t ). The polynomil λ (G; y) does not depend on the totl ordering < e. If G is undireted, then λ (G; y) = y Ē(G) T (G; 1, y).

14 Greedoid polynomil (td.) Things tht re different from Tutte polynomil: There is no notion of internl tivity. It stisfies wek deletion-ontrtion reurrene, i.e. if e is n edge rooted t, then: { yλ (G \ {e}; y) if e is loop; λ (G; y) = λ (G \ {e}; y) + λ (G/{e}; y) otherwise. The polynomil λ (G; y) depends on the hoie of root.

15 G-prking funtion A funtion f : V (G) \ {} N is G-prking funtion w.r.t. [PS04] if for ll nonempty A V (G) \ {}, there is v A so tht f (v) < numer of edges from V (G) \ A to v. Exmple The level of f, denoted y lvl(f ), is lvl(f ) = E(G) V (G) + 1 f (v). v V (G)\{}

16 G-prking funtion A funtion f : V (G) \ {} N is G-prking funtion w.r.t. [PS04] if for ll nonempty A V (G) \ {}, there is v A so tht f (v) < numer of edges from V (G) \ A to v. Exmple The level of f, denoted y lvl(f ), is lvl(f ) = E(G) V (G) + 1 f (v). v V (G)\{}

17 G-prking funtion A funtion f : V (G) \ {} N is G-prking funtion w.r.t. [PS04] if for ll nonempty A V (G) \ {}, there is v A so tht f (v) < numer of edges from V (G) \ A to v. Exmple The level of f, denoted y lvl(f ), is lvl(f ) = E(G) V (G) + 1 f (v). v V (G)\{}

18 Connetions to greedoid polynomil Theorem 1 (C.,2015) y lvl(f ) = f T y ext(t ) = λ (G; y). Corollry 2 There is ijetion etween G-prking funtions w.r.t nd -rooted spnning trees of G tht trnsltes level to externl tivity. Corollry 2 is generliztion of Cori-Le Borgne ijetion for undireted grphs [CLB03].

19 Connetions to greedoid polynomil Theorem 1 (C.,2015) y lvl(f ) = f T y ext(t ) = λ (G; y). Corollry 2 There is ijetion etween G-prking funtions w.r.t nd -rooted spnning trees of G tht trnsltes level to externl tivity. Corollry 2 is generliztion of Cori-Le Borgne ijetion for undireted grphs [CLB03].

20 Connetions to greedoid polynomil Theorem 1 (C.,2015) y lvl(f ) = f T y ext(t ) = λ (G; y). Corollry 2 There is ijetion etween G-prking funtions w.r.t nd -rooted spnning trees of G tht trnsltes level to externl tivity. Corollry 2 is generliztion of Cori-Le Borgne ijetion for undireted grphs [CLB03].

21 The ijetion The grph G nd the G-prking funtion

22 The ijetion The grph G nd the G-prking funtion The lgorithm. S = {}, E = {1, 2, 3, 4, 5}, E S = {1, 5}

23 The ijetion The grph G nd the G-prking funtion The lgorithm. S = {}, E = {1, 2, 3, 4, 5}, E S = {1,5}

24 The ijetion The grph G nd the G-prking funtion The lgorithm. S = {}, E = {1, 2, 3, 4, 5}, E S = {1,5}

25 The ijetion The grph G nd the G-prking funtion The lgorithm. S = {}, E = {1, 2, 3, 4}, E S ={1}

26 The ijetion The grph G nd the G-prking funtion The lgorithm. S = {}, E = { 1, 2, 3, 4}, E S ={1}

27 The ijetion The grph G nd the G-prking funtion The lgorithm. S={, }, E = { 1, 2, 3, 4}, E S ={1}

28 The ijetion The grph G nd the G-prking funtion The lgorithm. S={, }, E = {2, 3, 4}, E S ={2}

29 The ijetion The grph G nd the G-prking funtion The lgorithm. S={,, }, E = { 2, 3, 4}, E S ={2}

30 The ijetion The grph G nd the G-prking funtion The lgorithm. S={,, }, E = {3, 4}, E S ={3}

31 The ijetion The grph G nd the G-prking funtion The lgorithm. S={,,, }, E = { 3, 4}, E S ={3}

32 The ijetion The grph G nd the G-prking funtion The lgorithm. S={,,, }, E = {4}, E S ={4}

33 The ijetion The grph G nd the G-prking funtion The lgorithm. S={,,, }, E = { 4}, E S ={4}

34 The ijetion The grph G nd the G-prking funtion The lgorithm. S={,,, }, E = {}, E S ={}. Algorithm stops

35 Chip-firing gme The sinkless Chip-firing gme [BTW88], lso known s elin sndpile model nd Bk-Tng-Wiesenfield model, is dynmil system on digrph G. Eh vertex v V (G) is ssigned (v) hips, nd v is unstle if (v) is greter thn or eul to the outdegree of v. If v is unstle, then we n topple the vertex y sending hip through eh of its outgoing edges to its neighors. Exmple of toppling moves.

36 Chip-firing gme The sinkless Chip-firing gme [BTW88], lso known s elin sndpile model nd Bk-Tng-Wiesenfield model, is dynmil system on digrph G. Eh vertex v V (G) is ssigned (v) hips, nd v is unstle if (v) is greter thn or eul to the outdegree of v. If v is unstle, then we n topple the vertex y sending hip through eh of its outgoing edges to its neighors. Exmple of toppling moves

37 Chip-firing gme The sinkless Chip-firing gme [BTW88], lso known s elin sndpile model nd Bk-Tng-Wiesenfield model, is dynmil system on digrph G. Eh vertex v V (G) is ssigned (v) hips, nd v is unstle if (v) is greter thn or eul to the outdegree of v. If v is unstle, then we n topple the vertex y sending hip through eh of its outgoing edges to its neighors. Exmple of toppling moves

38 Chip-firing gme The sinkless Chip-firing gme [BTW88], lso known s elin sndpile model nd Bk-Tng-Wiesenfield model, is dynmil system on digrph G. Eh vertex v V (G) is ssigned (v) hips, nd v is unstle if (v) is greter thn or eul to the outdegree of v. If v is unstle, then we n topple the vertex y sending hip through eh of its outgoing edges to its neighors. Exmple of toppling moves

39 Chip-firing gme The sinkless Chip-firing gme [BTW88], lso known s elin sndpile model nd Bk-Tng-Wiesenfield model, is dynmil system on digrph G. Eh vertex v V (G) is ssigned (v) hips, nd v is unstle if (v) is greter thn or eul to the outdegree of v. If v is unstle, then we n topple the vertex y sending hip through eh of its outgoing edges to its neighors. Exmple of toppling moves

40 Reurrent onfigurtion A hip onfigurtion is funtion : V (G) N, where (v) is the numer of hips in vertex v. We write if there is seuene of toppling moves from to. A hip onfigurtion is reurrent if: is unstle; If, then. For two reurrent onfigurtions nd, we write if nd. The level of reurrent euivlene lss [] is lvl([]) = v V (G) (v). We use r n to denote the numer of reurrent euivlene lsses with level n.

41 Reurrent onfigurtion A hip onfigurtion is funtion : V (G) N, where (v) is the numer of hips in vertex v. We write if there is seuene of toppling moves from to. A hip onfigurtion is reurrent if: is unstle; If, then. For two reurrent onfigurtions nd, we write if nd. The level of reurrent euivlene lss [] is lvl([]) = v V (G) (v). We use r n to denote the numer of reurrent euivlene lsses with level n.

42 Reurrent onfigurtion A hip onfigurtion is funtion : V (G) N, where (v) is the numer of hips in vertex v. We write if there is seuene of toppling moves from to. A hip onfigurtion is reurrent if: is unstle; If, then. For two reurrent onfigurtions nd, we write if nd. The level of reurrent euivlene lss [] is lvl([]) = v V (G) (v). We use r n to denote the numer of reurrent euivlene lsses with level n.

43 Connetions to greedoid polynomil Theorem 3 (C.,2015) If G is n Eulerin digrph, then n 0 r n y n = λ (G; y) (1 y). Theorem 4 (C., 2015) The greedoid polynomil λ (G; y) does not depend on the hoie of root vertex if nd only if G is n Eulerin digrph. Theorem 5 (C., 2015) Let G e the reverse of the digrph G. We hve G is n Eulerin digrph if nd only if λ (G; y) = λ (G ; y) for ll V (G).

44 Connetions to greedoid polynomil Theorem 3 (C.,2015) If G is n Eulerin digrph, then n 0 r n y n = λ (G; y) (1 y). Theorem 4 (C., 2015) The greedoid polynomil λ (G; y) does not depend on the hoie of root vertex if nd only if G is n Eulerin digrph. Theorem 5 (C., 2015) Let G e the reverse of the digrph G. We hve G is n Eulerin digrph if nd only if λ (G; y) = λ (G ; y) for ll V (G).

45 Connetions to greedoid polynomil Theorem 3 (C.,2015) If G is n Eulerin digrph, then n 0 r n y n = λ (G; y) (1 y). Theorem 4 (C., 2015) The greedoid polynomil λ (G; y) does not depend on the hoie of root vertex if nd only if G is n Eulerin digrph. Theorem 5 (C., 2015) Let G e the reverse of the digrph G. We hve G is n Eulerin digrph if nd only if λ (G; y) = λ (G ; y) for ll V (G).

46 Further reserh Find ijetive proof for Theorem 4 nd Theorem 5. Prove or disprove tht λ (G; y) is unimodl.

47 Questions?

48 Thnk you!

49 Anders Björner, Bernhrd Korte, nd László Lovász. Homotopy properties of greedoids. Adv. in Appl. Mth., 6(4): , Per Bk, Cho Tng, nd Kurt Wiesenfeld. Self-orgnized ritility. Phys. Rev. A (3), 38(1): , F. R. K. Chung nd R. L. Grhm. On the over polynomil of digrph. J. Comin. Theory Ser. B, 65(2): , Roert Cori nd Yvn Le Borgne. The snd-pile model nd Tutte polynomils. Adv. in Appl. Mth., 30(1-2):44 52, Forml power series nd lgeri omintoris (Sottsdle, AZ, 2001). Criel Merino López. Chip firing nd the Tutte polynomil. Ann. Com., 1(3): , 1997.

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

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

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

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

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

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

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

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

Linear choosability of graphs

Linear choosability of graphs 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. 2005 Europen Conferene on

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

Received: 29 November 2018; Accepted: 12 January 2019; Published: 16 January 2019

Received: 29 November 2018; Accepted: 12 January 2019; Published: 16 January 2019 mthemtis Artile q-rung Orthopir Fuzzy Competition Grphs with Applition in the Soil Eosystem Amn Hi 1 Muhmmd Akrm 1 * nd Adeel Frooq 2 1 Deprtment of Mthemtis University of the Punj New Cmpus Lhore 54590

More information

Algebra 2 Semester 1 Practice Final

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

More information

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

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

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

Random subgroups of a free group

Random subgroups of a free group Rndom sugroups of free group Frédérique Bssino LIPN - Lortoire d Informtique de Pris Nord, Université Pris 13 - CNRS Joint work with Armndo Mrtino, Cyril Nicud, Enric Ventur et Pscl Weil LIX My, 2015 Introduction

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

Section 4.4. Green s Theorem

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

More information

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

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

More information

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

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

More information

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

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

Pavel Rytí. November 22, 2011 Discrete Math Seminar - Simon Fraser University

Pavel Rytí. November 22, 2011 Discrete Math Seminar - Simon Fraser University Geometric representtions of liner codes Pvel Rytí Deprtment of Applied Mthemtics Chrles University in Prgue Advisor: Mrtin Loebl November, 011 Discrete Mth Seminr - Simon Frser University Bckground Liner

More information

Graph Theory. Dr. Saad El-Zanati, Faculty Mentor Ryan Bunge Graduate Assistant Illinois State University REU. Graph Theory

Graph Theory. Dr. Saad El-Zanati, Faculty Mentor Ryan Bunge Graduate Assistant Illinois State University REU. Graph Theory Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Grph Theory Dniel Gibson, Concordi University Jckelyn Ngel, Dominicn University Benjmin Stnley, New Mexico Stte University Allison

More information

Chapter 2 Finite Automata

Chapter 2 Finite Automata Chpter 2 Finite Automt 28 2.1 Introduction Finite utomt: first model of the notion of effective procedure. (They lso hve mny other pplictions). The concept of finite utomton cn e derived y exmining wht

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

Implication Graphs and Logic Testing

Implication Graphs and Logic Testing Implition Grphs n Logi Testing Vishwni D. Agrwl Jmes J. Dnher Professor Dept. of ECE, Auurn University Auurn, AL 36849 vgrwl@eng.uurn.eu www.eng.uurn.eu/~vgrwl Joint reserh with: K. K. Dve, ATI Reserh,

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

42 RICHARD M. LOW AND SIN-MIN LEE grphs nd Z k mgic grphs were investigted in [4,7,8,1]. The construction of mgic grphs ws studied by Sun nd Lee [18].

42 RICHARD M. LOW AND SIN-MIN LEE grphs nd Z k mgic grphs were investigted in [4,7,8,1]. The construction of mgic grphs ws studied by Sun nd Lee [18]. AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 34 (26), Pges 41 48 On the products of group-mgic grphs Richrd M. Low Λ Deprtment of Mthemtics Sn Jose Stte University Sn Jose, CA 95192 U.S.A. low@mth.sjsu.edu

More information

Math 4310 Solutions to homework 1 Due 9/1/16

Math 4310 Solutions to homework 1 Due 9/1/16 Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1

More information

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

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

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

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

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

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

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

Linear Algebra Introduction

Linear Algebra Introduction Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +

More information

A Short Introduction to Self-similar Groups

A Short Introduction to Self-similar Groups A Short Introution to Self-similr Groups Murry Eler* Asi Pifi Mthemtis Newsletter Astrt. Self-similr groups re fsinting re of urrent reserh. Here we give short, n hopefully essile, introution to them.

More information

Learning Moore Machines from Input-Output Traces

Learning Moore Machines from Input-Output Traces Lerning Moore Mchines from Input-Output Trces Georgios Gintmidis 1 nd Stvros Tripkis 1,2 1 Alto University, Finlnd 2 UC Berkeley, USA Motivtion: lerning models from blck boxes Inputs? Lerner Forml Model

More information

Lecture Notes No. 10

Lecture Notes No. 10 2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite

More information

Dorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000

Dorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000 orf, R.C., Wn,. T- Equivlent Networks The Eletril Engineering Hndook Ed. Rihrd C. orf Bo Rton: CRC Press LLC, 000 9 T P Equivlent Networks hen Wn University of Cliforni, vis Rihrd C. orf University of

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

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

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

The Quest for Perfect and Compact Symmetry Breaking for Graph Problems

The Quest for Perfect and Compact Symmetry Breaking for Graph Problems The Quest for Perfect nd Compct Symmetry Breking for Grph Prolems Mrijn J.H. Heule SYNASC Septemer 25, 2016 1/19 Stisfiility (SAT) solving hs mny pplictions... forml verifiction grph theory ioinformtics

More information

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

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

More information

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

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

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

Regular expressions, Finite Automata, transition graphs are all the same!!

Regular expressions, Finite Automata, transition graphs are all the same!! CSI 3104 /Winter 2011: Introduction to Forml Lnguges Chpter 7: Kleene s Theorem Chpter 7: Kleene s Theorem Regulr expressions, Finite Automt, trnsition grphs re ll the sme!! Dr. Neji Zgui CSI3104-W11 1

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

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

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

The graphs of Rational Functions

The graphs of Rational Functions Lecture 4 5A: The its of Rtionl Functions s x nd s x + The grphs of Rtionl Functions The grphs of rtionl functions hve severl differences compred to power functions. One of the differences is the behvior

More information

Vidyalankar S.E. Sem. III [CMPN] Discrete Structures Prelim Question Paper Solution

Vidyalankar S.E. Sem. III [CMPN] Discrete Structures Prelim Question Paper Solution S.E. Sem. III [CMPN] Discrete Structures Prelim Question Pper Solution 1. () (i) Disjoint set wo sets re si to be isjoint if they hve no elements in common. Exmple : A = {0, 4, 7, 9} n B = {3, 17, 15}

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

Core 2 Logarithms and exponentials. Section 1: Introduction to logarithms

Core 2 Logarithms and exponentials. Section 1: Introduction to logarithms Core Logrithms nd eponentils Setion : Introdution to logrithms Notes nd Emples These notes ontin subsetions on Indies nd logrithms The lws of logrithms Eponentil funtions This is n emple resoure from MEI

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

Can one hear the shape of a drum?

Can one hear the shape of a drum? Cn one her the shpe of drum? After M. K, C. Gordon, D. We, nd S. Wolpert Corentin Lén Università Degli Studi di Torino Diprtimento di Mtemti Giuseppe Peno UNITO Mthemtis Ph.D Seminrs Mondy 23 My 2016 Motivtion:

More information

Hardware Verification 2IMF20

Hardware Verification 2IMF20 Hrdwre Verifition 2IMF20 Julien Shmltz Leture 02: Boolen Funtions, ST, CEC Course ontent - Forml tools Temporl Logis (LTL, CTL) Domin Properties System Verilog ssertions demi & Industrils Proessors Networks

More information

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

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

More information

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

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

AP Calculus AB Unit 4 Assessment

AP Calculus AB Unit 4 Assessment Clss: Dte: 0-04 AP Clulus AB Unit 4 Assessment Multiple Choie Identify the hoie tht best ompletes the sttement or nswers the question. A lultor my NOT be used on this prt of the exm. (6 minutes). The slope

More information

List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.

List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1. Mth Anlysis CP WS 4.X- Section 4.-4.4 Review Complete ech question without the use of grphing clcultor.. Compre the mening of the words: roots, zeros nd fctors.. Determine whether - is root of 0. Show

More information

Finite Automata-cont d

Finite Automata-cont d Automt Theory nd Forml Lnguges Professor Leslie Lnder Lecture # 6 Finite Automt-cont d The Pumping Lemm WEB SITE: http://ingwe.inghmton.edu/ ~lnder/cs573.html Septemer 18, 2000 Exmple 1 Consider L = {ww

More information

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

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

More information

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.

More information

Maximizing Maximal Angles for Plane Straight-Line Graphs

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

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and This rticle ppered in journl published by Elsevier. The ttched copy is furnished to the uthor for internl non-commercil reserch nd eduction use, including for instruction t the uthors institution nd shring

More information

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1.

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1. Exerise Genertor polynomils of onvolutionl ode, given in binry form, re g, g j g. ) Sketh the enoding iruit. b) Sketh the stte digrm. ) Find the trnsfer funtion T. d) Wht is the minimum free distne of

More information

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

Regular languages refresher

Regular languages refresher Regulr lnguges refresher 1 Regulr lnguges refresher Forml lnguges Alphet = finite set of letters Word = sequene of letter Lnguge = set of words Regulr lnguges defined equivlently y Regulr expressions Finite-stte

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

Yet Another Cartesian Cubical Type Theory

Yet Another Cartesian Cubical Type Theory Yet Another Crtesin Cubicl Type Theory Anders Mörtberg Crnegie Mellon University nd University of Gothenburg Types, Homotopy Type theory, nd Verifiction HIM Bonn June 6, 2018 Anders Mörtberg June 6, 2018

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

These slides are from 2014 and contain a semi-serious error at one point in the

These slides are from 2014 and contain a semi-serious error at one point in the Hello Internet! Hello Internet! These slides re rom 2014 nd ontin semi-serious error t one point in the These slides re rom 2014 nd ontin semi-serious error t one point in the presenttion. For more up-to-dte

More information

Binding Number and Connected (g, f + 1)-Factors in Graphs

Binding Number and Connected (g, f + 1)-Factors in Graphs Binding Number nd Connected (g, f + 1)-Fctors in Grphs Jinsheng Ci, Guizhen Liu, nd Jinfeng Hou School of Mthemtics nd system science, Shndong University, Jinn 50100, P.R.Chin helthci@163.com Abstrct.

More information

2. Topic: Summation of Series (Mathematical Induction) When n = 1, L.H.S. = S 1 = u 1 = 3 R.H.S. = 1 (1)(1+1)(4+5) = 3

2. Topic: Summation of Series (Mathematical Induction) When n = 1, L.H.S. = S 1 = u 1 = 3 R.H.S. = 1 (1)(1+1)(4+5) = 3 GCE A Level Otober/November 008 Suggested Solutions Mthemtis H (970/0) version. MATHEMATICS (H) Pper Suggested Solutions. Topi: Definite Integrls From the digrm: Are A = y dx = x Are B = x dy = y dy dx

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

CS/CE/SE 6367 Software Testing, Validation and Verification. Lecture 4 Code Coverage (II)

CS/CE/SE 6367 Software Testing, Validation and Verification. Lecture 4 Code Coverage (II) CS/CE/SE 6367 Softwre Testing, Vlidtion nd Verifiction Lecture 4 Code Coverge (II) 2/54 Lst Clss Code coverge Control-flow coverge Sttement coverge Brnch coverge Pth coverge Coverge Collection Tools EclEmm

More information

Lecture 11 Binary Decision Diagrams (BDDs)

Lecture 11 Binary Decision Diagrams (BDDs) C 474A/57A Computer-Aie Logi Design Leture Binry Deision Digrms (BDDs) C 474/575 Susn Lyseky o 3 Boolen Logi untions Representtions untion n e represente in ierent wys ruth tle, eqution, K-mp, iruit, et

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 EXERCISE - 01 CHECK YOUR GRASP

QUADRATIC EQUATION EXERCISE - 01 CHECK YOUR GRASP QUADRATIC EQUATION EXERCISE - 0 CHECK YOUR GRASP. Sine sum of oeffiients 0. Hint : It's one root is nd other root is 8 nd 5 5. tn other root 9. q 4p 0 q p q p, q 4 p,,, 4 Hene 7 vlues of (p, q) 7 equtions

More information

Ch. 2.3 Counting Sample Points. Cardinality of a Set

Ch. 2.3 Counting Sample Points. Cardinality of a Set Ch..3 Counting Smple Points CH 8 Crdinlity of Set Let S e set. If there re extly n distint elements in S, where n is nonnegtive integer, we sy S is finite set nd n is the rdinlity of S. The rdinlity of

More information

Homework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama

Homework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 4 1. UsetheproceduredescriedinLemm1.55toconverttheregulrexpression(((00) (11)) 01) into n NFA. Answer: 0 0 1 1 00 0 0 11 1 1 01 0 1 (00)

More information

The corolla polynomial: a graph polynomial on half-edges

The corolla polynomial: a graph polynomial on half-edges : grph polynomil on hlf-edges Depts. of Physis nd Mthemtis Humoldt University, Berlin E-mil: kreimer@physik.hu-erlin.de The study of Feynmn rules is muh filitted y the two Symnzik polynomils, homogeneous

More information

The Minimum Label Spanning Tree Problem: Illustrating the Utility of Genetic Algorithms

The Minimum Label Spanning Tree Problem: Illustrating the Utility of Genetic Algorithms The Minimum Lel Spnning Tree Prolem: Illustrting the Utility of Genetic Algorithms Yupei Xiong, Univ. of Mrylnd Bruce Golden, Univ. of Mrylnd Edwrd Wsil, Americn Univ. Presented t BAE Systems Distinguished

More information

GM1 Consolidation Worksheet

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

More information

NEW CIRCUITS OF HIGH-VOLTAGE PULSE GENERATORS WITH INDUCTIVE-CAPACITIVE ENERGY STORAGE

NEW CIRCUITS OF HIGH-VOLTAGE PULSE GENERATORS WITH INDUCTIVE-CAPACITIVE ENERGY STORAGE NEW CIRCUITS OF HIGH-VOLTAGE PULSE GENERATORS WITH INDUCTIVE-CAPACITIVE ENERGY STORAGE V.S. Gordeev, G.A. Myskov Russin Federl Nuler Center All-Russi Sientifi Reserh Institute of Experimentl Physis (RFNC-VNIIEF)

More information

Functions. mjarrar Watch this lecture and download the slides

Functions. mjarrar Watch this lecture and download the slides 9/6/7 Mustf Jrrr: Leture Notes in Disrete Mthemtis. Birzeit University Plestine 05 Funtions 7.. Introdution to Funtions 7. One-to-One Onto Inverse funtions mjrrr 05 Wth this leture nd downlod the slides

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

We will see what is meant by standard form very shortly

We will see what is meant by standard form very shortly THEOREM: For fesible liner progrm in its stndrd form, the optimum vlue of the objective over its nonempty fesible region is () either unbounded or (b) is chievble t lest t one extreme point of the fesible

More information

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

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

More information

A Note on Feng Qi Type Integral Inequalities

A Note on Feng Qi Type Integral Inequalities Int Journl of Mth Anlysis, Vol 1, 2007, no 25, 1243-1247 A Note on Feng Qi Type Integrl Inequlities Hong Yong Deprtment of Mthemtics Gungdong Business College Gungzhou City, Gungdong 510320, P R Chin hongyong59@sohucom

More information

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}

More information

Subsequence Automata with Default Transitions

Subsequence Automata with Default Transitions Susequene Automt with Defult Trnsitions Philip Bille, Inge Li Gørtz, n Freerik Rye Skjoljensen Tehnil University of Denmrk {phi,inge,fskj}@tu.k Astrt. Let S e string of length n with hrters from n lphet

More information

4 Deterministic Büchi Automata

4 Deterministic Büchi Automata Bernd Finkeiner Dte: April 26, 2011 Automt, Gmes nd Verifiction: Lecture 3 4 Deterministic Büchi Automt Theorem 1 The lnguge ( + ) ω is not recognizle y deterministic Büchi utomton. Assume tht L is recognized

More information

Reachability of recurrent positions in the chip-firing game

Reachability of recurrent positions in the chip-firing game Egerváry Research Group on Combinatorial Optimization Technical reports TR-2015-10. Published by the Egerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

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