Trees as operads. Lecture A formalism of trees
|
|
- Doris Hancock
- 5 years ago
- Views:
Transcription
1 Ltur 2 rs s oprs In this ltur, w introu onvnint tgoris o trs tht will us or th inition o nroil sts. hs tgoris r gnrliztions o th simpliil tgory us to in simpliil sts. First w onsir th s o plnr trs n thn th mor gnrl s o non-plnr trs. 2.1 A ormlism o trs A tr is non-mpty onnt init grph with no loops. A vrtx in grph is ll outr i it hs only on g tth to it. All th trs w will onsir r root trs, i.., quipp with istinguish outr vrtx ll th output n (possily mpty) st o outr vrtis (not ontining th output vrtx) ll th st o inputs. Whn rwing trs, w will lt th output n input vrtis rom th pitur. From now on, th trm vrtx in tr will lwys rr to rmining vrtx. Givn tr, w not y V ( ) th st o vrtis o n y E( ) th st o gs o. h gs tth to th lt input vrtis r ll input gs or lvs; th g tth to th lt output vrtx is ll output g or root. h rst o th gs r ll innr gs. h root inus n ovious irtion in th tr, rom th lvs towrs th root. I v is vrtx o init root tr, w not y out(v) th uniqu outgoing g n y in(v) th st o inoming gs (not tht in(v) n mpty). h rinlity o in(v) is ll th vln o v, th lmnt o out(v) is th output o v, n th lmnts o in(v) r th inputs o v. As n xmpl, onsir th ollowing pitur o tr: I. Morijk n B. oën, Simpliil Mthos or Oprs n Algri Gomtry, Avn Courss 11 in Mthmtis - CRM Brlon, DOI / _2, Springr Bsl AG 2010
2 12 Ltur 2. rs s oprs v w h output vrtx t th g n th input vrtis t, n hv n lt. his tr hs thr vrtis r, v n w o rsptiv vlns 3, 2, n 0. It lso hs thr input gs or lvs, nmly, n. h gs n r innr gs n th g is th root. A tr with no vrtis whos input g (whih w not y ) oinis with its output g will not y η, or simply y η. Dinition A plnr root tr is root tr togthr with linr orring o in(v) or h vrtx v o. h orring o in(v) or h vrtx is quivlnt to rwing th tr on th pln. Whn w rw tr w will lwys put th root t th ottom. On rwk o rwing tr on th pln is tht it immitly oms plnr tr; w thus my hv mny irnt piturs or th sm tr. For xmpl, th two trs r two irnt plnr rprsnttions o th sm tr. 2.2 Plnr trs Lt plnr root tr. Any suh tr gnrts non-σ opr, whih w not y Ω p ( ). h st o olours o Ω p ( ) is th st E( ) o gs o, n th oprtions r gnrt y th vrtis o th tr. Mor xpliitly, h vrtx v with input gs 1,..., n n output g ins n oprtion v Ω p ( )( 1,..., n ; ). h othr oprtions r th unit oprtions n th oprtions otin y ompositions. his opr hs th proprty tht, or
3 2.2. Plnr trs 13 ll 1,..., n,, th st o oprtions Ω p ( )( 1,..., n ; ) ontins t most on lmnt. For xmpl, onsir th sm tr pitur or: v h opr Ω p ( ) hs six olours,,,,, n. hn v Ω p ( )(, ; ), w Ω p ( )( ; ), n r Ω p (,, ; ) r th gnrtors, whil th othr oprtions r th units 1, 1,..., 1 n th oprtions otin y ompositions, nmly r 1 v Ω p ( )(,,, ; ), r 3 w Ω p ( )(, ; ), n r(v, 1, w) = (r 1 v) 4 w = (r 3 w) 1 v Ω p ( )(,, ; ). his is omplt sription o th opr Ω p ( ). Dinition h tgory o plnr root trs Ω p is th ull sutgory o th tgory o non-σ olour oprs whos ojts r Ω p ( ) or ny tr. W n viw Ω p s th tgory whos ojts r plnr root trs. h st o morphisms rom tr S to tr is givn y th st o non-σ olour opr mps rom Ω p (S) to Ω p ( ). Osrv tht ny morphism S in Ω p is ompltly trmin y its t on th olours (i.., gs). h tgory Ω p xtns th simpliil tgory. In, ny n 0 ins linr tr L n n 2 1 with n + 1 gs n n vrtis v 1,..., v n. W not this tr y [n] or L n. Any orr-prsrving mp {0,..., n} {0,..., m} ins n rrow [n] [m] in th tgory Ω p. In this wy, w otin n ming v n v 2 v 1 0 u Ω p. his ming is ully ithul. Morovr, it sris s siv (or il) in Ω p, in th sns tht or ny rrow S in Ω p, i is linr thn so is S. In th nxt stions w giv mor xpliit sription o th morphisms in Ω p. w
4 14 Ltur 2. rs s oprs F mps Lt plnr root tr n n innr g in. Lt us not y / th tr otin rom y ontrting. hn thr is nturl mp : / in Ω p, ll th innr mp ssoit with. his mp is th inlusion on oth th olours n th gnrting oprtions o Ω p (/), xpt or th oprtion u, whih is snt to r v. Hr r n v r th two vrtis in t th two ns o, n u is th orrsponing vrtx in /, s in th pitur: / u w v w Now lt plnr root tr n v vrtx o with xtly on innr g tth to it. Lt /v th tr otin rom y rmoving th vrtx v n ll th outr gs. hr is mp ssoit to this oprtion, not v : /v, whih is th inlusion oth on th olours n on th gnrting oprtions o Ω p (/v). hs typs o mps r ll th outr s o. h ollowing r two outr mps: /v w v v w w v /w Not tht th possiility o rmoving th root vrtx o is inlu in this inition. his sitution n hppn only i th root vrtx is tth to xtly on innr g, thus not vry tr hs n outr inu y its root. hr is nothr prtiulr sitution whih rquirs spil ttntion, nmly th inlusion o th tr with no vrtis η into tr with on vrtx, ll oroll. In this s w gt n + 1 mps i th oroll hs n lvs. h opr Ω p (η) onsists o only on olour n th intity oprtion on it. hn mp o oprs Ω p (η) Ω p ( ) is just hoi o n g o. W will us th trm mp to rr to n innr or outr mp Dgnry mps hr is on mor typ o mp tht n ssoit with vrtx v o vln on in s ollows. Lt \v th tr otin rom y rmoving th vrtx v n mrging th two gs inint to it into on g. hn thr is mp
5 2.2. Plnr trs 15 : \v in Ω p ll th gnry mp ssoit with v, whih sns th olours 1 n 2 o Ω p ( ) to, sns th gnrting oprtion v to i, n is th intity or th othr olours n oprtions. It n pitur lik this: 1 v 2 F mps n gnry mps gnrt th whol tgory Ω p. h ollowing lmm is th gnrliztion to Ω p o th wll-known t tht in h rrow n writtn s omposition o gnry mps ollow y mps. For th proo o this t w rr th rr to Lmm 2.3.2, whr w prov similr sttmnt in th tgory o non-plnr trs. Lmm Any rrow : A B in Ω p omposs (up to isomorphism) s A B σ whr σ : A C is omposition o gnry mps n δ : C B is omposition o mps Dnroil intitis In this stion w r going to mk xpliit th rltions twn th gnrting mps (s n gnris) o Ω p. h intitis tht w otin gnrliz th simpliil ons in th tgory. Elmntry rltions Lt : / n : / istint innr s o. It ollows tht th innr s : (/)/ / n : (/)/ / xist, w hv (/)/ = (/)/, n th ollowing igrm ommuts: C δ \v (/)/ / /.
6 16 Ltur 2. rs s oprs Lt v : /v n w : /w istint outr s o, n ssum tht hs t lst thr vrtis. hn th outr s w : (/v)/w /v n v : (/w)/v /w lso xist, (/v)/w = (/w)/v, n th ollowing igrm ommuts: (/v)/w w /v v /w w. v In s tht hs only two vrtis, thr is similr ommuttiv igrm involving th inlusion o η into th n-th oroll. h lst rmining s is whn w ompos n innr with n outr on in ny orr. hr r svrl possiilitis n in ll o thm w suppos tht v : /v is n outr n : / is n innr. I in th g is not jnt to th vrtx v, thn th outr v : (/)/v / n th innr : (/v)/ /v xist, (/)/v = (/v)/, n th ollowing igrm ommuts: (/v)/ /v v /. v Suppos tht in th innr g is jnt to th vrtx v n not th othr jnt vrtx to y w. Osrv tht v n w ontriut vrtx v w or w v to /. Lt us not this vrtx y z. hn th outr z : (/)/z / xists i n only i th outr w : (/v)/w /v xists, n in this s (/)/z = (/v)/w. Morovr, th ollowing igrm ommuts: z (/v)/w (/)/z / w /v v. It ollows tht w n writ v w = z, whr z = v w i v is losr to th root o or z = w v i w is losr to th root o. Elmntry gnry rltions Lt : \v n σ w : \w two gnris o. hn th gnris : \w ( \w)\v n σ w : \v ( \v)\w xist, w hv
7 2.3. Non-plnr trs 17 ( \v)\w = ( \w)\v, n th ollowing igrm ommuts: \v σ w σ w \w σv ( \v)\w. Comin rltions Lt : \v gnry n : mp suh tht : \v mks sns (i.., still ontins v n its two jnt gs s sutr). hn thr xists n inu mp : \v \v trmin y th sm vrtx or g s :. Morovr, th ollowing igrm ommuts: \v \v. Lt : \v gnry n : mp inu y on o th jnt gs to v or th rmovl o v, i tht is possil. It ollows tht = \v n th omposition \v \v is th intity mp i \v. 2.3 Non-plnr trs Any non-plnr tr gnrts (symmtri) olour opr Ω( ). Similrly s in th s o plnr trs, th st o olours o Ω( ) is th st o gs E( ) o. h oprtions r gnrt y th vrtis o th tr, n th symmtri group on n lttrs Σ n ts on h oprtion with n inputs y prmuting th orr o its inputs. Eh vrtx v o th tr with output g n numring o its input gs 1,..., n ins n oprtion v Ω( 1,..., n ; ). h othr oprtions r th unit oprtions n th oprtions otin y ompositions n th tion o th symmtri group. For xmpl, onsir th tr v w
8 18 Ltur 2. rs s oprs h opr Ω( ) hs six olours,,,,, n. h gnrting oprtions r th sm s th gnrting oprtions o Ω p ( ). All th oprtions o Ω p ( ) r oprtions o Ω( ), ut thr r mor oprtions in Ω( ) otin y th tion o th symmtri group. For xmpl i σ is th trnsposition o two lmnts o Σ 2, w hv n oprtion v σ Ω(, ; ). Similrly i σ is th trnsposition o Σ 3 tht intrhngs th irst n thir lmnts, thn thr is n oprtion r σ Ω(,, ; ). Mor ormlly, i is ny tr, thn Ω( ) = Σ(Ω p ( )), whr is plnr rprsnttiv o. In t, hoi o plnr strutur on is prisly hoi o gnrtors or Ω( ). Dinition h tgory o root trs Ω is th ull sutgory o th tgory o olour oprs whos ojts r Ω( ) or ny tr. W n viw Ω s th tgory whos ojts r root trs. h st o morphisms rom tr S to tr is givn y th st o olour opr mps rom Ω(S) to Ω( ). Not tht ny morphism S in Ω is ompltly trmin y its t on th olours (i.., gs). h morphisms in Ω r gnrt y s n gnris (s in th plnr s) n lso y (non-plnr) isomorphisms. Lmm Any rrow : S in Ω omposs s S σ S ϕ whr σ : S S is omposition o gnry mps, ϕ: S is n isomorphism, n δ : is omposition o mps. Proo. W pro y inution on th sum o th numr o vrtis o S n. I n S hv no vrtis, thn = S = η n is th intity. Not tht, without loss o gnrlity, w n ssum tht sns th root o S to th root o ; othrwis w n tor it s mp S tht prsrvs th root ollow y mp tht is omposition o outr s. Also, w n ssum tht is n pimorphism on th lvs sin, i this is not th s, tors s S /v v, whr v is th vrtx low th l in tht is not in th img o. I n r gs o S suh tht () = (), thn n must on th sm (linr) rnh o S n sns intrmit vrtis to intitis. Sin is mp o olour oprs, w n tor it in uniqu wy s surjtion ollow y n injtion on th olours. his orrspons to toriztion in Ω, S ψ S ξ, δ
9 2.3. Non-plnr trs 19 whr ψ is omposition o gnris n ξ is ijtiv on lvs, sns th root o S to th root o, n is injtiv on th olours (y th prvious osrvtions). I ξ is surjtiv on olours, thn ξ is n isomorphism. I ξ is not surjtiv, thn thr is n g in not in th img o ξ. Sin is n intrnl g (not l), ξ tors s S ξ /. Now w ontinu y inution on th mp ξ. In gnrl, limits n olimits o not xist in th tgory Ω; or xmpl, Ω lks sums n prouts. Howvr, rtin pushouts o xist in Ω, s xprss in th ollowing lmm: Lmm Lt : R S n g : R two surjtiv mps in Ω. hn th pushout R S g P xists in Ω. Proo. h mps n g n h writtn s omposition o n isomorphism n squn o gnry mps y Lmm Sin pushout squrs n pst togthr to gt lrgr pushout squrs, it thus suis to prov th lmm in th s whr n g r gnry mps givn y unry vrtis v n w in R, i.., : R S is : R R\v n g : R is σ w : R R\w. I v = w, thn th ollowing igrm is pushout: R R\v R\v R\v. I v w, thn th ommuttiv squr R R\v σ w σ w R\w σv (R\v)\w = (R\w)\v is lso pushout, s on sily hks.
10 20 Ltur 2. rs s oprs Dnroil intitis with isomorphisms h nroil intitis or th tgory Ω r th sm s or th tgory Ω p plus som mor rltions involving th isomorphisms in Ω. As n xmpl, w giv th ollowing rltion, tht involvs innr s n isomorphisms. Lt tr with n innr g n lt : (non-plnr) isomorphism. hn th trs / n / xist, whr = (), th mp rstrits to n isomorphism : / /, n th ollowing igrm ommuts: / /. Similr rltions hol or outr s n gnris Isomorphisms long s n gnris For ny tr in Ω, lt P ( ) th st o plnr struturs o. Not tht P ( ) or vry tr. hus, th tgory Ω is quivlnt to th tgory Ω whos ojts r plnr trs, i.., pirs (, p) whr is n ojt o Ω n p P ( ), n whos morphisms r givn y Ω ((, p), (, p )) = Ω(, ). A morphism ϕ: (, p) (, p ) in Ω is ll plnr i, whn w pull k th plnr strutur p on to on on long ϕ, thn it oinis with p. Using this quivlnt ormultion o Ω, th tgory Ω p is thn th sutgory o Ω onsisting o th sm ojts n plnr mps only, i.., ompositions o s n gnris. In Ω p, th only utomorphisms r intitis. I δ : S is omposition o s n α: S S is n isomorphism, thr is toriztion δ S α α δ S, whr δ is gin omposition o s n α is n isomorphism. his toriztion is uniqu i on ixs som onvntions,.g., on tks th ojts o Ω to plnr trs, n tks s n gnris to plnr mps. Similrly, isomorphisms n push orwr n pull k long omposition o gnris. Lt σ : S omposition o gnris n α: S S n
11 2.3. Non-plnr trs 21 β : two isomorphisms. hn thr r toriztions σ S σ S α α σ S β σ S β whr α n β r isomorphisms n σ n σ r ompositions o gnris. hus, ny rrow in Ω n writtn in th orm δσα or δασ with δ omposition o s, σ omposition o gnris, n α n isomorphism h prsh o plnr struturs Lt P : Ω op Sts th prsh on Ω tht sns h tr to its st o plnr struturs. Osrv tht P ( ) is torsor unr Aut( ) or vry tr, whr Aut( ) nots th st o utomorphisms o. Rll tht th tgory o lmnts Ω/P is th tgory whos ojts r pirs (, x) with x P ( ). A morphism twn two ojts (, x) n (S, y) is givn y morphism : S in Ω suh tht P ()(y) = x. Hn, Ω/P = Ω p n w hv projtion v : Ω p Ω. hr is ommuttiv tringl u Ω p i v Ω, whr i is th ully ithul ming o into Ω whih sns th ojt [n] in to th linr tr L n with n vrtis n n + 1 gs or vry n Rltion with th simpliil tgory W hv sn tht oth th tgoris Ω n Ω p xtn th tgory, y viwing th ojts o s linr trs. In t, it is possil to otin s omm tgory o Ω or o Ω p s ollows. Lt η th tr in Ω onsisting o no vrtis n on g, n lt η p th plnr rprsnttiv o η in Ω p. I is ny tr in Ω, thn Ω(, η) onsists o only on morphism i is linr tr, or it is th mpty st othrwis. h sm hppns or Ω p n η p. hus, Ω/η = Ω p /η p =.
12
1 Introduction to Modulo 7 Arithmetic
1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w
More informationMath 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.
Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right
More informationThe University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008
Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is
More informationAn undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V
Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon
More informationCycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!
Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik
More informationOutline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)
More informationGarnir Polynomial and their Properties
Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,
More informationPlanar Upward Drawings
C.S. 252 Pro. Rorto Tmssi Computtionl Gomtry Sm. II, 1992 1993 Dt: My 3, 1993 Sri: Shmsi Moussvi Plnr Upwr Drwings 1 Thorm: G is yli i n only i it hs upwr rwing. Proo: 1. An upwr rwing is yli. Follow th
More informationPaths. Connectivity. Euler and Hamilton Paths. Planar graphs.
Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,
More informationModule graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura
Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not
More information0.1. Exercise 1: the distances between four points in a graph
Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in
More informationGraph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2
Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny
More information(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely
. DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,
More informationCS 461, Lecture 17. Today s Outline. Example Run
Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h
More informationCOMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS
OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson
More informationOutline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl
More informationGraphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1
CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml
More information, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management
nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o
More informationV={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous
More informationb. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?
MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth
More informationGraphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari
Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f
More informationConstructive Geometric Constraint Solving
Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC
More informationECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS
C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h
More informationMAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017
MAT3707/201/1/2017 Tutoril lttr 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Smstr 1 Dprtmnt o Mtmtil Sins SOLUTIONS TO ASSIGNMENT 01 BARCODE Din tomorrow. univrsity o sout ri SOLUTIONS TO ASSIGNMENT
More informationCSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp
CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140
More informationWhy the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.
Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y
More informationV={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn
More informationPresent state Next state Q + M N
Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I
More informationCSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018
CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs
More informationAlgorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph
Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt
More information12/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 information5/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 informationSection 10.4 Connectivity (up to paths and isomorphism, not including)
Toy w will isuss two stions: Stion 10.3 Rprsnting Grphs n Grph Isomorphism Stion 10.4 Conntivity (up to pths n isomorphism, not inluing) 1 10.3 Rprsnting Grphs n Grph Isomorphism Whn w r working on n lgorithm
More informationNumbering Boundary Nodes
Numring Bounry Nos Lh MBri Empori Stt Univrsity August 10, 2001 1 Introution Th purpos of this ppr is to xplor how numring ltril rsistor ntworks ffts thir rspons mtrix, Λ. Morovr, wht n lrn from Λ out
More informationCS 241 Analysis of Algorithms
CS 241 Anlysis o Algorithms Prossor Eri Aron Ltur T Th 9:00m Ltur Mting Lotion: OLB 205 Businss HW6 u lry HW7 out tr Thnksgiving Ring: Ch. 22.1-22.3 1 Grphs (S S. B.4) Grphs ommonly rprsnt onntions mong
More informationSolutions to Homework 5
Solutions to Homwork 5 Pro. Silvia Frnánz Disrt Mathmatis Math 53A, Fall 2008. [3.4 #] (a) Thr ar x olor hois or vrtx an x or ah o th othr thr vrtis. So th hromati polynomial is P (G, x) =x (x ) 3. ()
More informationCSC Design and Analysis of Algorithms. Example: Change-Making Problem
CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =
More information# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.
How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0
More informationProperties of Hexagonal Tile local and XYZ-local Series
1 Proprtis o Hxgonl Til lol n XYZ-lol Sris Jy Arhm 1, Anith P. 2, Drsnmik K. S. 3 1 Dprtmnt o Bsi Sin n Humnitis, Rjgiri Shool o Enginring n, Thnology, Kkkn, Ernkulm, Krl, Ini. jyjos1977@gmil.om 2 Dprtmnt
More informationExam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013
CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or
More informationSeven-Segment Display Driver
7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on
More informationarxiv: v1 [cs.ds] 20 Feb 2008
Symposium on Thortil Aspts of Computr Sin 2008 (Borux), pp. 361-372 www.sts-onf.org rxiv:0802.2867v1 [s.ds] 20 F 2008 FIXED PARAMETER POLYNOMIAL TIME ALGORITHMS FOR MAXIMUM AGREEMENT AND COMPATIBLE SUPERTREES
More informationGreedy Algorithms, Activity Selection, Minimum Spanning Trees Scribes: Logan Short (2015), Virginia Date: May 18, 2016
Ltur 4 Gry Algorithms, Ativity Sltion, Minimum Spnning Trs Sris: Logn Short (5), Virgini Dt: My, Gry Algorithms Suppos w wnt to solv prolm, n w r l to om up with som rursiv ormultion o th prolm tht woul
More informationCS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12
Aministrivi: CS61B Ltur #33 Autogrr will run this vning. Toy s Rings: Grph Struturs: DSIJ, Chptr 12 Lst moifi: W Nov 8 00:39:28 2017 CS61B: Ltur #33 1 Why Grphs? For xprssing non-hirrhilly rlt itms Exmpls:
More informationS i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.
S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths
More informationSolutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1
Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):
More informationComplete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT
Complt Solutions or MATH 012 Quiz 2, Otor 25, 2011, WTT Not. T nswrs ivn r r mor omplt tn is xpt on n tul xm. It is intn tt t mor omprnsiv solutions prsnt r will vlul to stunts in stuyin or t inl xm. In
More informationCSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata
CSE303 - Introduction to th Thory of Computing Smpl Solutions for Exrciss on Finit Automt Exrcis 2.1.1 A dtrministic finit utomton M ccpts th mpty string (i.., L(M)) if nd only if its initil stt is finl
More information1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers.
Mth 0 Exm - Prti Prolm Solutions. Dtrmin whthr or not th ollowing inry rltions r quivln rltions. B sur to justiy your nswrs. () {(0,0),(0,),(0,),(,),(,),(,),(,),(,0),(,),(,),(,0),(,),(.)} on th st A =
More informationQUESTIONS BEGIN HERE!
Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook
More informationlearning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms
rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r
More informationCS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:
CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt
More informationOutline. 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 informationMore Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations
Mr Funtins Grphs, Pruts, & Rltins Unirt Grphs An unirt grph is pir f 1. A st f ns 2. A st f gs (whr n g is st f tw ns*) Friy, Sptmr 2, 2011 Ring: Sipsr 0.2 ginning f 0.4; Stughtn 1.1.5 ({,,,,}, {{,}, {,},
More informationTOPIC 5: INTEGRATION
TOPIC 5: INTEGRATION. Th indfinit intgrl In mny rspcts, th oprtion of intgrtion tht w r studying hr is th invrs oprtion of drivtion. Dfinition.. Th function F is n ntidrivtiv (or primitiv) of th function
More informationCOMP108 Algorithmic Foundations
Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht
More informationTwo Approaches to Analyzing the Permutations of the 15 Puzzle
Two Approhs to Anlyzin th Prmuttions o th 15 Puzzl Tom How My 2017 Astrt Th prmuttions o th 15 puzzl hv n point o ous sin th 1880 s whn Sm Lloy sin spin-o o th puzzl tht ws impossil to solv. In this ppr,
More informationDUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski
Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This
More informationNP-Completeness. CS3230 (Algorithm) Traveling Salesperson Problem. What s the Big Deal? Given a Problem. What s the Big Deal? What s the Big Deal?
NP-Compltnss 1. Polynomil tim lgorithm 2. Polynomil tim rution 3.P vs NP 4.NP-ompltnss (som slis y P.T. Um Univrsity o Txs t Dlls r us) Trvling Slsprson Prolm Fin minimum lngth tour tht visits h ity on
More informationGraph Contraction and Connectivity
Chptr 17 Grph Contrtion n Conntivity So r w hv mostly ovr thniqus or solving prolms on grphs tht wr vlop in th ontxt o squntil lgorithms. Som o thm r sy to prllliz whil othrs r not. For xmpl, w sw tht
More informationCSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review
rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht
More informationQUESTIONS BEGIN HERE!
Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook
More informationAnnouncements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk
Grphs & Grph Algorithms Ltur CS Spring 6 Announmnts A6 rls toy: Risk Strt signing with your prtnr sp Prlim usy Not grphs hs r Grphs K 5 K, =...not th kin w mn, nywy Applitions o Grphs Communition ntworks
More informationResearch Article On the Genus of the Zero-Divisor Graph of Z n
Intrntionl Journl o Comintoris, Artil ID 7, pgs http://x.oi.org/.1/14/7 Rsrh Artil On th Gnus o th Zro-Divisor Grph o Z n Huong Su 1 n Piling Li 2 1 Shool o Mthmtil Sins, Gungxi Thrs Eution Univrsity,
More information5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem
Thorm 10-1: Th Hnshkin Thorm Lt G=(V,E) n unirt rph. Thn Prt 10. Grphs CS 200 Alorithms n Dt Struturs v V (v) = 2 E How mny s r thr in rph with 10 vrtis h of r six? 10 * 6 /2= 30 1 Thorm 10-2 An unirt
More informationO n t h e e x t e n s i o n o f a p a r t i a l m e t r i c t o a t r e e m e t r i c
O n t h x t n s i o n o f p r t i l m t r i t o t r m t r i Alin Guénoh, Bruno Llr 2, Vlimir Mkrnkov 3 Institut Mthémtiqus Luminy, 63 vnu Luminy, F-3009 MARSEILLE, FRANCE, gunoh@iml.univ-mrs.fr 2 Cntr
More informationNefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim
MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07
More informationWeighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths
Dt Strutur LECTURE Shortt pth lgorithm Proprti of hortt pth Bllmn-For lgorithm Dijktr lgorithm Chptr in th txtook (pp ). Wight grph -- rminr A wight grph i grph in whih g hv wight (ot) w(v i, v j ) >.
More informationN=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f
lulu jwtt pnlton sin towr ounrs hpl lpp lu Our irst non-linr t strutur! rph G onsists o two sts G = {V, E} st o V vrtis, or nos st o E s, rltionships twn nos surph G onsists o sust o th vrtis n s o G jnt
More informationSteinberg s Conjecture is false
Stinrg s Conjtur is als arxiv:1604.05108v2 [math.co] 19 Apr 2016 Vinnt Cohn-Aa Mihal Hig Danil Král Zhntao Li Estan Salgao Astrat Stinrg onjtur in 1976 that vry planar graph with no yls o lngth our or
More informationChapter 9. Graphs. 9.1 Graphs
Chptr 9 Grphs Grphs r vry gnrl lss of ojt, us to formliz wi vrity of prtil prolms in omputr sin. In this hptr, w ll s th sis of (finit) unirt grphs, inluing grph isomorphism, onntivity, n grph oloring.
More informationSOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan
LOCUS 58 SOLVED EXAMPLES Empl Lt F n F th foci of n llips with ccntricit. For n point P on th llips, prov tht tn PF F tn PF F Assum th llips to, n lt P th point (, sin ). P(, sin ) F F F = (-, 0) F = (,
More informationGraph Theory. Vertices. Vertices are also known as nodes, points and (in social networks) as actors, agents or players.
Stphn P. Borgtti Grph Thory A lthough grph thory is on o th youngr rnhs o mthmtis, it is unmntl to numr o ppli ils, inluing oprtions rsrh, omputr sin, n soil ntwork nlysis. In this hptr w isuss th si onpts
More informationCS September 2018
Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o
More informationGrade 7/8 Math Circles March 4/5, Graph Theory I- Solutions
ulty o Mtmtis Wtrloo, Ontrio N ntr or ution in Mtmtis n omputin r / Mt irls Mr /, 0 rp Tory - Solutions * inits lln qustion. Tr t ollowin wlks on t rp low. or on, stt wtr it is pt? ow o you know? () n
More informationA Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation
A Simpl Co Gnrtor Co Gnrtion Chptr 8 II Gnrt o for singl si lok How to us rgistrs? In most mhin rhitturs, som or ll of th oprnsmust in rgistrs Rgistrs mk goo tmporris Hol vlus tht r omput in on si lok
More informationOrganization. Dominators. Control-flow graphs 8/30/2010. Dominators, control-dependence. Dominator relation of CFGs
Orniztion Domintors, ontrol-pnn n SSA orm Domintor rltion o CFGs postomintor rltion Domintor tr Computin omintor rltion n tr Dtlow lorithm Lnur n Trjn lorithm Control-pnn rltion SSA orm Control-low rphs
More informationOutline. Binary Tree
Outlin Similrity Srh Th Binry Brnh Distn Nikolus Austn nikolus.ustn@s..t Dpt. o Computr Sins Univrsity o Slzur http://rsrh.uni-slzur.t 1 Binry Brnh Distn Binry Rprsnttion o Tr Binry Brnhs Lowr Boun or
More informationIEEE TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. TK, NO. TK, MONTHTK YEARTK 1. Hamiltonian Walks of Phylogenetic Treespaces
IEEE TRNSTIONS ON OMPUTTIONL IOLOGY ND IOINFORMTIS, VOL. TK, NO. TK, MONTHTK YERTK Hmiltonin Wlks of Phylognti Trsps Kvughn Goron, Eri For, n Kthrin St. John strt W nswr rynt s omintoril hllng on miniml
More informationCMSC 451: Lecture 2 Graph Basics Thursday, Aug 31, 2017
Dv Mount CMSC 45: Ltur Grph Bsis Thursy, Au, 07 Rin: Chpt. in KT (Klinr n Tros) n Chpt. in DBV (Dsupt, Ppimitriou, n Vzirni). Som o our trminoloy irs rom our txt. Grphs n Dirphs: A rph G = (V, E) is strutur
More informationWalk Like a Mathematician Learning Task:
Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics
More informationIntegration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals
Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion
More informationDesigning A Concrete Arch Bridge
This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr
More information12. Traffic engineering
lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}
More informationThis chapter covers special properties of planar graphs.
Chptr 21 Plnr Grphs This hptr ovrs spil proprtis of plnr grphs. 21.1 Plnr grphs A plnr grph is grph whih n b rwn in th pln without ny gs rossing. Som piturs of plnr grph might hv rossing gs, but it s possibl
More informationSimilarity Search. The Binary Branch Distance. Nikolaus Augsten.
Similrity Srh Th Binry Brnh Distn Nikolus Augstn nikolus.ugstn@sg..t Dpt. of Computr Sins Univrsity of Slzurg http://rsrh.uni-slzurg.t Vrsion Jnury 11, 2017 Wintrsmstr 2016/2017 Augstn (Univ. Slzurg) Similrity
More informationarxiv: v1 [math.mg] 5 Oct 2015
onvx pntgons tht mit i-lok trnsitiv tilings sy Mnn, Jnnifr MLou-Mnn, vi Von ru rxiv:1510.01186v1 [mth.mg] 5 Ot 2015 strt Univrsity of Wshington othll Univrsity of Wshington othll Univrsity of Wshington
More informationChapter 18. Minimum Spanning Trees Minimum Spanning Trees. a d. a d. a d. f c
Chptr 8 Minimum Spnning Trs In this hptr w ovr importnt grph prolm, Minimum Spnning Trs (MST). Th MST o n unirt, wight grph is tr tht spns th grph whil minimizing th totl wight o th gs in th tr. W irst
More informationThe University of Sydney MATH 2009
T Unvrsty o Syny MATH 2009 APH THEOY Tutorl 7 Solutons 2004 1. Lt t sonnt plnr rp sown. Drw ts ul, n t ul o t ul ( ). Sow tt s sonnt plnr rp, tn s onnt. Du tt ( ) s not somorp to. ( ) A onnt rp s on n
More informationLast time: introduced our first computational model the DFA.
Lctur 7 Homwork #7: 2.2.1, 2.2.2, 2.2.3 (hnd in c nd d), Misc: Givn: M, NFA Prov: (q,xy) * (p,y) iff (q,x) * (p,) (follow proof don in clss tody) Lst tim: introducd our first computtionl modl th DFA. Tody
More informationarxiv: v1 [math.co] 15 Dec 2015
On th Plnr Split Thiknss of Grphs Dvi Eppstin, Philipp Kinrmnn, Stphn Koourov, Giuspp Liott, Ann Luiw, Au Mignn, Djyoti Monl, Hmih Vosoughpour, Su Whitsis 8, n Stphn Wismth 9 rxiv:.89v [mth.co] D Univrsity
More informationOn Local Transformations in Plane Geometric Graphs Embedded on Small Grids
On Lol Trnsformtions in Pln Gomtri Grphs Em on Smll Gris Mnul Allns Prosnjit Bos Alfro Grí Frrn Hurto Pro Rmos Euro Rivr-Cmpo Jvir Tjl Astrt Givn two n-vrtx pln grphs G 1 = (V 1, E 1 ) n G 2 = (V 2, E
More informationUniform 2D-Monotone Minimum Spanning Graphs
CCCG 2018, Winnipg, Cn, August 8 10, 2018 Uniorm 2D-Monoton Minimum Spnning Grphs Konstntinos Mstks Astrt A gomtri grph G is xy monoton i h pir o vrtis o G is onnt y xy monoton pth. W stuy th prolm o prouing
More informationEXAMPLE 87.5" APPROVAL SHEET APPROVED BY /150HP DUAL VFD CONTROL ASSEMBLY CUSTOMER NAME: CAL POLY SLO FINISH: F 20
XMPL XMPL RVISIONS ZON RV. SRIPTION T PPROV 0.00 THIS IS N PPROVL RWING OR YOUR ORR. OR MNUTURING N GIN, THIS RWING MUST SIGN N RTURN TO MOTION INUSTRIS. NY HNGS M TO THIS RWING, TR MNUTURING HS GUN WILL
More informationECE 407 Computer Aided Design for Electronic Systems. Circuit Modeling and Basic Graph Concepts/Algorithms. Instructor: Maria K. Michael.
0 Computr i Dsign or Eltroni Systms Ciruit Moling n si Grph Conptslgorithms Instrutor: Mri K. Mihl MKM - Ovrviw hviorl vs. Struturl mols Extrnl vs. Intrnl rprsnttions Funtionl moling t Logi lvl Struturl
More informationPage 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.
ConTst Clikr ustions Chtr 19 Physis, 4 th Eition Jms S. Wlkr ustion 19.1 Two hrg blls r rlling h othr s thy hng from th iling. Wht n you sy bout thir hrgs? Eltri Chrg I on is ositiv, th othr is ngtiv both
More informationDiscovering Pairwise Compatibility Graphs
Disovring Pirwis Comptiility Grphs Muhmm Nur Ynhon, M. Shmsuzzoh Byzi, n M. Siur Rhmn Dprtmnt of Computr Sin n Enginring Bnglsh Univrsity of Enginring n Thnology nur.ynhon@gmil.om, shms.yzi@gmil.om, siurrhmn@s.ut..
More informationProblem solving by search
Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming
More informationInstructions for Section 1
Instructions for Sction 1 Choos th rspons tht is corrct for th qustion. A corrct nswr scors 1, n incorrct nswr scors 0. Mrks will not b dductd for incorrct nswrs. You should ttmpt vry qustion. No mrks
More informationEE1000 Project 4 Digital Volt Meter
Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s
More information