ON THE DEHN COMPLEX OF VIRTUAL LINKS
|
|
- Elfrieda Bates
- 5 years ago
- Views:
Transcription
1 ON THE DEHN COMPLEX OF VIRTUAL LINKS RACHEL BYRD, JENS HARLANDER Astrct. A virtul link comes with vriety of link complements. This rticle is concerned with the Dehn spce, pseudo mnifold with oundry, nd the Dehn complex, 2-dimensionl spine of the Dehn spce. In the clssicl cse where the link is plnr, the Dehn spce is the link complement in the 3-sphere. We study topologicl nd geometric properties of the Dehn complex of virtul link. Among other things, we show tht every finitely presented group is the fundmentl group of Dehn complex, nd tht ny lternting triple of n lternting virtul link is non-positively curved squred complex. Keywords: Virtul link, Wirtinger complex, Dehn complex, non-positively squred complex, finitely presented group. Mthemticl Suject Clssifiction 2010: 57M20, 57M05, 20F05 1. Introduction This pper presents results concerning topologicl nd geometric spects of the Dehn complex of virtul links. Virtul knots nd links re n extension of clssicl knot nd link theory nd were first introduced y Kuffmn [6]. A virtul link digrm l is 4-regulr grph in the plne, with over-crossing nd under-crossing informtion t some nodes. The nodes with this dditionl informtion re crossings, nd the remining nodes re clled virtul crossings. The ltter re indicted y circle round the node. Figure 1. A usul crossing nd virtul crossing. From virtul link digrm in the plne, we construct closed, orientle surfce F of miniml genus in which l emeds, so tht only crossings pper s nodes. The virtul crossings dispper ecuse we cn run the edges of the grph over hndles. The detils of this construction re s follows. Strt with the grph nd emed it in R 3 so tht the virtul crossings dispper. We otin 2-mnifold with oundry y thickening every edge of the grph into nd. For every oundry component, glue in disc to otin the desired surfce. We cll the surfce thus otined the projection surfce F of l (see Figure 2). The virtul link digrm in the plne thus leds to link digrm on surfce. 1
2 2 RACHEL BYRD, JENS HARLANDER Figure 2. A virtul link digrm in the plne gives rise to link digrm on surfce, torus, in the cse shown; the originl imge cn e found in Kuffmn [5]. There re vrious link complements ssocited with virtul link. Given virtul link digrm l with projection surfce F. We cn push the digrm into the interior of the thickened surfce F I, nd thus otin n emedding of linked circles in F I. We denote the imge of this emedding y ˆl. If we remove n open neighorhood of ˆl from F I, then we otin compct mnifold with oundry which we denote y M(l). If we cone off the ottom surfce F {0} of M(l), we otin compct pseudo mnifold with oundry, which we cll the Wirtinger spce, W S(l). If we further cone off the top surfce in the Wirtinger spce, we otin nother compct pseudo mnifold with oundry, which we cll the Dehn spce, DS(l). In the clssicl sitution where l is plnr link digrm, M(l) is link complement in the thickened 2-sphere, W S(l) is link complement in the 3-ll, nd DS(l) is link complement in the 3-sphere. The Wirtinger spce nd the Dehn spce hve interesting 2-dimensionl spines, the Wirtinger complex W (l) nd the Dehn complex D(l). The Dehn complex is the min oject of interest for this rticle. We will recll the nture of these spines in the next section. 2. The Dehn Complex Both the Wirtinger nd the Dehn spce, eing pseudo 3-mnifolds with oundry, hve 2-dimensionl spines. The procedure for collpsing the Wirtinger nd the Dehn spce to the Wirtinger complex W (l) nd the Dehn complex D(l) cn e found in Hrlnder/Roserock [4]. We recll the cell structures of these 2-complexes. We egin with the Wirtinger complex. First orient the virtul link digrm l. Lel the under-crossing rcs of l y 1,..., n. The Wirtinger complex hs single vertex. Its edges re in one-to-one correspondence with the under-crossing rcs 1,... n. The 2-cells, lso referred to s fces, re in one-to-one correspondence with the crossings of l. Using the right hnd rule, the orienttion of l
3 ON THE DEHN COMPLEX OF VIRTUAL LINKS 3 yields n orienttion of the oundry of the fces. See Figure 3. The Wirtinger complex provides presenttion of its fundmentl group, the Wirtinger group. We hve π 1 (W (l)) = 1, 2,..., n R 1,..., R m where every reltion, R i, is of the form i j = j k, corresponding to crossing in the virtul knot digrm. i j k Figure 3. The Wirtinger reltion i j = j k otined from crossing in virtul knot digrm. We next give description of the cell structure of the Dehn complex. There re two vertices, v + nd v (which come from the cone points). The edges re in one-to-one correspondence with the connected components, A 1,..., A n, of F l. Ech edge A i is oriented from v + to v. The fces re in one-to-one correspondence with the crossings of l. Considering prticulr crossing x of l. Proceed counterclockwise round the crossing x, strting t the end of n over-crossing, nd red off the four (not necessrily distinct) components encountered, sy A x(1), A x(2), A x(3), nd A x(4). A 2-cell is ttched to the edge-pth, A x(1) A 1 x(2) A x(3) A 1 x(4) (see Figure 4). Without loss of generlity, we my choose the tree of the 1-skeleton of D(l) to e the edge A 1. If we collpse the tree to point, choosing it to e our sepoint d 0, we otin presenttion of the Dehn group, π 1 (D(l)) = A 1,..., A n A1 = 1, A x(1) A 1 x(2) A x(3) A 1 x(4) = 1, for every crossing x l. v + A x(1) A x(4) v A x(1) A x(4) v A x(2) A x(3) A x(2) A x(3) v + Figure 4. A crossing gives rise to 2-cell in the Dehn complex. If l is plnr link digrm, then H 1 (D(l)) = Z m, where m is the numer of circle components of the link. In prticulr the Dehn group of clssicl link is never trivil. The sitution is different for virtul links.
4 4 RACHEL BYRD, JENS HARLANDER 1 A 1 A 1 A 2 A 2 A 2 A 2 A 2 A 2 2 Figure 5. The connected components for the virtul knot digrm re leled A 1 nd A 2 ; under-crossing components re leled 1 nd 2. Exmple 1. Consider the virtul knot digrm k in Figure 5. We hve π 1 (D(k)) = A 1, A 2 A 1 = 1, A 2 A 1 2 A 2A 1 1 = 1, A 2 A 1 2 A 2A 1 1 = 1 = 1. Note lso tht π 1 (W (k)) = 1, = 1 2, 2 1 = 1 1 = Z. A presenttion for the Dehn group cn lso e otined from the Wirtinger complex nd the projection surfce of the virtul link digrm l. Consider the mps F {1} ι W S(l) φ DS(l). The first mp is inclusion, the second mp is topologicl quotient mp induced y coning off the top surfce F {1}. It follows tht φ : π 1 (W (l)) π 1 (D(l)) is surjective nd the kernel is normlly generted y the imge of ι. This gives nother convenient wy to construct the presenttion of π 1 (D(l)) which we descrie next. Orient the virtul link l. Consider n oriented curve c on the projection surfce F. If c intersects n rc of l leled i in positive wy ccording to the right hnd rule, we record n i. If c intersects in negtive wy, we record n 1 i. In this wy the curve c gives rise to word w(c) in the genertors 1,..., n of the Wirtinger presenttion. Theorem 2.1 (Byrd [2]). The fundmentl group of the Dehn complex π 1 (D(l)) is isomorphic to the quotient π 1 (W (l)) / K, where K is normlly generted y words w(c), nd the curves c rnge over set of generting curves of the fundmentl group of the projection surfce F. Exmple 2. We next give n exmple of virtul knot whose Dehn group is non-trivil finite. The Wirtinger group of the virtul knot digrm k in Figure 6 is presented y nd the Dehn group is presented y 1, 2, = 1 3, 3 2 = 2 1, 2 3 = 3 1, A 1, A 2, A 3 A 1 = 1, A 1 A 1 2 A 1A 1 3 = 1, A 1 A 1 2 A 1A 1 3 = 1, A 1 A 1 2 A 1A 1 2 = 1 = Z 2. Hrlnder/Roserock [4] show tht the Wirtinger group of this virtul knot hs torsion. Note tht the projection surfce of k is torus. The curve indicted in Figure 6 gives the
5 ON THE DEHN COMPLEX OF VIRTUAL LINKS 5 reltion 1 = 1 3 in π 1 (D(k)) under the surjective homomorphism ϕ. Adding the reltion from the other generting curve, 1 = 1 2, we cn compute π 1(D(k)) using Theorem 2.1. π 1 (D(k)) = π 1 (W (k)) / { 1 = 1 3, 1 = 1 2 } = Z 2 A 1 A 2 A 3 A 1 1 A 1 A 3 A 2 A A 2 A 1 A 1 A 2 Figure 6. A virtul knot digrm k with Dehn group Z 2. The dshed red line represents generting curve on the projection surfce. 3. Curvture We egin with the definition of reducing circle. Definition 3.1. Let l e virtul link digrm with projection surfce F. A simple, closed curve on F tht intersects l exctly twice is reducing circle. When the reducing circle is seprting, we require tht crossings re contined on oth sides of the seprting reducing circle. Seprting reducing circles led to decompositions of the link digrm. If we cut virtul link digrm l long reducing circle nd connect the four new endpoints with two new smll rcs, we otin two virtul link digrms, l 1 nd l 2, nd l is clled the composition of l 1 nd l 2, l = l 1 #l 2. Cutting long non-seprting reducing circle lso simplifies the virtul link digrm. It results in virtul link digrm whose projection surfce is of smller genus. Definition 3.2. A virtul link digrm is prime if there re no reducing circles, seprting or non-seprting. A squred 2-complex is 2-complex where every 2-cell hs four oundry edges. The Dehn complex nd the Wirtinger complex re exmples of squred 2-complex. Definition 3.3. A squred 2-complex is non-positively curved if there re t lest four squres grouped round ech vertex. Tht is, if every reduced edge cycle in the link grph of ech vertex in the 2-complex hs length t lest four.
6 6 RACHEL BYRD, JENS HARLANDER The following result ws otined y Hrlnder nd Roserock [3]. It extends well known results from clssicl knot theory (see Bridson/Hefliger [1], pge 220). Theorem 3.1. Let l e prime, lternting virtul link digrm. Then the Dehn complex of l is non-postively curved squred complex. We outline the min ides of the proof. One first notes tht since l is lternting, oth vertex links in D(l) re isomorphic to the 1-skeleton of the squre cell decomposition of the projection surfce tht is dul to the one induced y l. In prticulr, ech reduces edge pth in these links hs even length. An edge pth of length two would produce reducing circle. Hence, since l is prime, reduced edge pths in the links hve to hve length t lest four. Thus D(l) is non-positively curved squred complex. Exmple 3. The Dehn complex of the knot digrm on the torus in Figure 7 is nonpositively curved squred complex s there re no reducing circles. Figure 7. A prime lternting knot digrm on torus. Byrd [2] investigted the geometry of the Dehn complex for ritrry lternting virtul links. Theorem 3.2. [2] If l is n lternting virtul link digrm drwn on projection surfce F, then we cn cut long finite numer of reducing circles to otin collection of prime, lternting links, l 1,, l n. This gives decomposition of the Dehn complex D(l) into non-positively curved squred complexes, nd decomposition of the fundmentl group of D(l) into CAT(0) groups. The decomposition of the fundmentl group is not decomposition in the grph of groups sense. It mens tht the fundmentl group of D(l) is quotient of free product of CAT(0) groups nd ech reducing circle introduces reltion of prticulr kind. Exmple 4. The knot digrm in Figure 8, drwn on torus, hs one non-seprting reducing circle shown in red. Hence its Dehn complex is not non-positively curved squred complex. We my pply Theorem 3.2 to eliminte the reducing circle nd otin prime knot digrm on 2-sphere whose Dehn complex is non-positively curved squred complex. The resulting prime knot is shown in Figure 9.
7 ON THE DEHN COMPLEX OF VIRTUAL LINKS 7 Figure 8. An lternting knot digrm on torus with one non-seprting reducing circle, indicted y the red curve. Figure 9. The prime knot otined from the knot shown in Figure 8 y cutting long the red reducing circle. Reducing circles cn lso e eliminted y dding dditionl link components to virtul link digrm. One method is tripling link. We triple virtul link digrm l y dding components which run prllel on either side of ll the originl strnds of the link. Denote the tripled link y l T. An lternting exmple of tripled virtul knot digrm is shown in Figure 10. Figure 10. An lternting triple of n lternting virtul knot digrm.
8 8 RACHEL BYRD, JENS HARLANDER Theorem 3.3. [2] If l T is n lternting triple of ny lternting virtul link digrm l, then D(l T ) is non-positively curved squred complex. 4. Dehn Groups It is well known tht the Dehn complex of clssicl link is sphericl if the components re linked. In prticulr Dehn groups of clssicl links re non-trivil, do not contin torsion, nd do not contin free elin sugroups of rnk higher thn two. We hve lredy given exmples of Dehn groups of virtul links tht cn not occur s Dehn groups of clssicl links. In fct, restrictions of ny kind do not exist for Dehn groups of virtul links. Theorem 4.1. Every finitely presented group is Dehn group. Proof. Let G e group nd X R e finite presenttion of G. If R contins m reltions then consider surfce of genus m. Choose reltion r = x ɛ x ɛ k k from R. Choose hole in the surfce nd plce k circles y 1,...,y k round tht hole, y 1 eing the outermost nd y k eing the innermost circle. Orient the circle y i clockwise if ɛ i = 1 nd counterclockwise if ɛ i = 1. See Figure 11. Figure 11. Oriented circles on surfce of genus 2. If x i = x j, i < j, then we turn the circles y i nd y j into one circle component using hndle. Figure 12 shows the cse ɛ i = 1 nd ɛ j = 1. The other cses re treted similrly. Relle this new component y x i. Notice tht the hndle tht ws ttched introduces new genertors nd reltions in the Dehn group for the circle configurtion (see Theorem 2.1). The two crossings on the hndle coming from the lue under-crossing component (see Figure 12) yield the reltion x i = x i nd its inverse. The meridin of the hndle gives the trivil reltion x i = x i, the longitude gives the reltion = w, where w is the word otined from the circles tht run through the hndle. We cn pply Tietze trnsformtions to remove the genertor nd the reltion = w. The other reltion turns into wx i = x i. We cn use Tietze trnsformtion to remove the genertor nd the reltion wx i = x i. Thus the effect of ttching the hndle on the Dehn group is chnging the reltion y ɛ yɛ i i...yɛ j j...yɛ k k into the reltion y ɛ xɛ i i...xɛ j i...yɛ k k. In the end the reltion y ɛ yɛ k k tht held in the Dehn group of the originl circle configurtion is turned into the reltion
9 ON THE DEHN COMPLEX OF VIRTUAL LINKS 9 y i y j x i Figure 12. Connecting oppositely oriented components using hndle (seen from ove). x i r = x ɛ x ɛ k k. The ttched hndles do not introduce dditionl reltions. We proceed with this construction one reltion t time. Suppose we hve reltion r = x ɛ x ɛ k k nd s = z κ zκ l l nd x i = z j. Then we cn connect the ith circle round the hole for r with the jth circle round the hole for s using the sme hndle construction. In the end we hve produces virtul knot drwn on surfce of genus greter or equl to m with desired Dehn group X R. Figure 13 shows link on torus with Dehn group the Klein ottle group x, y xyx 1 y. Note tht the surfce the virtul link is drwn on is not of miniml genus. One could remedy this y dding n under-crossing component long the meridin of the torus. It is not difficult to check tht dding such n under-crossing component does not chnge the Dehn group. The rgument is the sme s given in the proof of Theorem 4.1, when we dded hndle. x y x y d c Figure 13. A virtul link on torus; the projection surfce hs genus 3, the Dehn group is the Klein ottle group.
10 10 RACHEL BYRD, JENS HARLANDER The generl construction for relizing given presenttion s Dehn presenttion typiclly produces virtul link on surfce of high genus with mny components. Indeed, if we strt with the presenttion x 1,..., x n r 1,..., r m, then the virtul link is drwn on surfce of genus greter or equl to m, nd the link hs greter or equl to n components. Sometimes d hoc constructions yield more efficient virtul links tht relize given group s Dehn group. Theorem 4.2. Every cyclic group Z n is Dehn group of virtul knot with the torus s its projection surfce. Proof of Theorem 4.2. The trivil group (Exmple 1), Z 2 (Exmple 2), nd the infinite cyclic group (the unknot) hve lredy een shown to e Dehn groups of virtul links. For ny n, consider the knot digrm k drwn on torus s in Figure 14. By Theorem 2.1, the Dehn group is π 1 (D(k)) = π 1 (W (k)) / { (n 1)(n 2) n 1 = n 2 (n 1)(n 2) = 1} In π 1 (W (k)), we hve the reltion 2 = 1, or = 1. Continuing long this component (strting t 1 ), we see tht the Wirtinger reltions give = 1 = 2 = = n(n 2). Hence, π 1 (D(k)) = n = 1 = Z n n 2... n n(n 2) (n 1)(n 2)... 2(n 2) (n 2)(n 2) (n 1)(n 2) Figure 14. A knot digrm k on torus with the Dehn group Z n ; the knot runs round the meridin nd longitude n times. Theorem 4.3. Every direct sum of two finite cyclic groups Z m Z n is the Dehn group of virtul link with two components with genus 2 projection surfce. Proof. We cn produce two knots k 1 nd k 2 on tori with Dehn groups Z m = 1 m 1 = 1 nd Z n = 2 n 2 = 1, respectively, using Theorem 4.2. From these two knot digrms, we construct link digrm on genus 2 surfce with Dehn group Z m Z n. Connect the
11 ON THE DEHN COMPLEX OF VIRTUAL LINKS Figure 15. The hndle with the linked components tht connect the two tori. two tori y hndle. Pull strnd of k 1 nd strnd of k 2 onto the hndle nd link the two strnds (see Figure 15). Cll the new link digrm l. If we include the reltions from the new crossing nd the one coming from curves round the new hndle, we otin s the Dehn group of l π 1 (D(l)) = 1, 1, 2, 2 m 1 = n 2 = 1, 2 1 = 1 2, 1 2 = 2 1, 1 = 1, 2 = 2 = 1, 2 m 1 = n 2 = [ 1, 2 ] = 1. Theorem 4.4. Every direct sum of finite cyclic group nd n infinite cyclic group, Z n Z, cn e expressed s Dehn group of virtul link. Proof. Consider knot digrm on torus s in Theorem 4.2 with Dehn group Z n nd the unknot drown on sphere. We cn use the sme construction s in Theorem 4.2. Note tht the connected sum of torus with sphere is torus, we end up with the desired 2-component link on torus. A 3 A 4 A 2 A 1 Figure 16. A 2-component link on torus with the Dehn group Z 3 Z. Figure 16 shows 2-component link l on torus with Dehn group Z 3 Z. We cn lso compute the Dehn group of l directly from the Dehn complex. We otin
12 12 RACHEL BYRD, JENS HARLANDER π 1 (D(l)) = A 1, A 2, A 3, A 4 A 1 = 1, A n 2 = 1, A 1 A 1 3 A 4A 1 2 = 1, A 1 A 1 2 A 4A 1 3 = 1 = Z 3 Z Two simply linked circles provides n oviously exmple of knot digrm with Dehn group Z Z. We hve now shown tht every cyclic group is Dehn group of virtul knot nd every elin group tht is generted y two elements is the Dehn group of virtul 2-component link. References [1] M. R. Bridson nd A. Hefliger. Metric Spces of Non-Positive Curvture. Springer, Berlin, [2] R. E. Byrd. On the geometry of virtul knots. Mster s thesis, Boise Stte University, [3] J. Hrlnder nd S. Roserock. Generlized knot complements nd some sphericl rion disc complements. Journl of Knot Theory nd Its Rmifictions, 12(7): , [4] J. Hrlnder nd S. Roserock. On distinguishing virtul knot groups from knot groups. J. of Knot Theory nd Its Rmifictions, 19(5): , [5] L. H. Kuffmn. Introduction to virtul knot theory. rxiv: v2 [mth.gt], Sumitted. [6] L.H. Kuffmn. Virtul knot theory. Europ. J. Comintorics, 20: , Rchel Byrd The Ohio Stte University yrd.197@osu.edu Jens Hrlnder Boise Stte University jenshrlnder@oisestte.edu
10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More informationCS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig
CS311H: Discrete Mthemtics Grph Theory IV Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mthemtics Grph Theory IV 1/25 A Non-plnr Grph Regions of Plnr Grph The plnr representtion of
More informationMTH 146 Conics Supplement
105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points
More informationINTRODUCTION TO SIMPLICIAL COMPLEXES
INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min
More informationa(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X
4. Mon, Sept. 30 Lst time, we defined the quotient topology coming from continuous surjection q : X! Y. Recll tht q is quotient mp (nd Y hs the quotient topology) if V Y is open precisely when q (V ) X
More information1 Quad-Edge Construction Operators
CS48: Computer Grphics Hndout # Geometric Modeling Originl Hndout #5 Stnford University Tuesdy, 8 December 99 Originl Lecture #5: 9 November 99 Topics: Mnipultions with Qud-Edge Dt Structures Scribe: Mike
More informationA dual of the rectangle-segmentation problem for binary matrices
A dul of the rectngle-segmenttion prolem for inry mtrices Thoms Klinowski Astrct We consider the prolem to decompose inry mtrix into smll numer of inry mtrices whose -entries form rectngle. We show tht
More informationDefinition and Examples
56 Chpter 1 The Fundmentl Group We come now to the second min topic of this chpter, covering spces. We hve in fct lredy encountered one exmple of covering spce in our clcultion of π 1 (S 1 ). This ws the
More information2 Surface Topology. 2.1 Topological Type. Computational Topology Surface Topology Afra Zomorodian
Klein ottle for rent inquire ithin. Anonymous 2 Surfce Topology Lst lecture, e spent considerle mount of effort defining mnifolds. We like mnifolds ecuse they re loclly Eucliden. So, een though it is hrd
More information2 Computing all Intersections of a Set of Segments Line Segment Intersection
15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design
More informationIf you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.
Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online
More informationClass-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts
Clss-XI Mthemtics Conic Sections Chpter-11 Chpter Notes Key Concepts 1. Let be fixed verticl line nd m be nother line intersecting it t fixed point V nd inclined to it t nd ngle On rotting the line m round
More information6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.
6.3 Volumes Just s re is lwys positive, so is volume nd our ttitudes towrds finding it. Let s review how to find the volume of regulr geometric prism, tht is, 3-dimensionl oject with two regulr fces seprted
More informationThe Fundamental Theorem of Calculus
MATH 6 The Fundmentl Theorem of Clculus The Fundmentl Theorem of Clculus (FTC) gives method of finding the signed re etween the grph of f nd the x-xis on the intervl [, ]. The theorem is: FTC: If f is
More informationDefinition of Regular Expression
Definition of Regulr Expression After the definition of the string nd lnguges, we re redy to descrie regulr expressions, the nottion we shll use to define the clss of lnguges known s regulr sets. Recll
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationUnit 5 Vocabulary. A function is a special relationship where each input has a single output.
MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with
More informationStained Glass Design. Teaching Goals:
Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to
More informationSOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES
SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES MARCELLO DELGADO Abstrct. The purpose of this pper is to build up the bsic conceptul frmework nd underlying motivtions tht will llow us to understnd ctegoricl
More informationsuch that the S i cover S, or equivalently S
MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i
More informationP(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have
Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using
More informationAML710 CAD LECTURE 16 SURFACES. 1. Analytical Surfaces 2. Synthetic Surfaces
AML7 CAD LECTURE 6 SURFACES. Anlticl Surfces. Snthetic Surfces Surfce Representtion From CAD/CAM point of view surfces re s importnt s curves nd solids. We need to hve n ide of curves for surfce cretion.
More informationΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών
ΕΠΛ323 - Θωρία και Πρακτική Μταγλωττιστών Lecture 3 Lexicl Anlysis Elis Athnsopoulos elisthn@cs.ucy.c.cy Recognition of Tokens if expressions nd reltionl opertors if è if then è then else è else relop
More informationBasic Geometry and Topology
Bsic Geometry nd Topology Stephn Stolz Septemer 7, 2015 Contents 1 Pointset Topology 1 1.1 Metric spces................................... 1 1.2 Topologicl spces................................ 5 1.3 Constructions
More informationBefore We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):
Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters
More informationTyping with Weird Keyboards Notes
Typing with Weird Keyords Notes Ykov Berchenko-Kogn August 25, 2012 Astrct Consider lnguge with n lphet consisting of just four letters,,,, nd. There is spelling rule tht sys tht whenever you see n next
More informationF. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.
Forced convex n-gons in the plne F. R. K. Chung y University ofpennsylvni Phildelphi, Pennsylvni 19104 R. L. Grhm AT&T Ls - Reserch Murry Hill, New Jersey 07974 Mrch 2,1997 Astrct In seminl pper from 1935,
More informationChapter44. Polygons and solids. Contents: A Polygons B Triangles C Quadrilaterals D Solids E Constructing solids
Chpter44 Polygons nd solids Contents: A Polygons B Tringles C Qudrilterls D Solids E Constructing solids 74 POLYGONS AND SOLIDS (Chpter 4) Opening prolem Things to think out: c Wht different shpes cn you
More informationSection 10.4 Hyperbolas
66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol
More information1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)
Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric
More informationMATH 25 CLASS 5 NOTES, SEP
MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid
More informationFig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.
Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution
More informationMath 35 Review Sheet, Spring 2014
Mth 35 Review heet, pring 2014 For the finl exm, do ny 12 of the 15 questions in 3 hours. They re worth 8 points ech, mking 96, with 4 more points for netness! Put ll your work nd nswers in the provided
More informationIf f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve.
Line Integrls The ide of line integrl is very similr to tht of single integrls. If the function f(x) is bove the x-xis on the intervl [, b], then the integrl of f(x) over [, b] is the re under f over the
More informationAVolumePreservingMapfromCubetoOctahedron
Globl Journl of Science Frontier Reserch: F Mthemtics nd Decision Sciences Volume 18 Issue 1 Version 1.0 er 018 Type: Double Blind Peer Reviewed Interntionl Reserch Journl Publisher: Globl Journls Online
More informationDr. D.M. Akbar Hussain
Dr. D.M. Akr Hussin Lexicl Anlysis. Bsic Ide: Red the source code nd generte tokens, it is similr wht humns will do to red in; just tking on the input nd reking it down in pieces. Ech token is sequence
More informationCS321 Languages and Compiler Design I. Winter 2012 Lecture 5
CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,
More information1.1. Interval Notation and Set Notation Essential Question When is it convenient to use set-builder notation to represent a set of numbers?
1.1 TEXAS ESSENTIAL KNOWLEDGE AND SKILLS Prepring for 2A.6.K, 2A.7.I Intervl Nottion nd Set Nottion Essentil Question When is it convenient to use set-uilder nottion to represent set of numers? A collection
More information6.2 Volumes of Revolution: The Disk Method
mth ppliction: volumes by disks: volume prt ii 6 6 Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem 6) nd the ccumultion process is to determine so-clled volumes
More informationarxiv:math/ v2 [math.co] 28 Feb 2006
Chord Digrms nd Guss Codes for Grphs rxiv:mth/0508269v2 [mth.co] 28 Feb 2006 Thoms Fleming Deprtment of Mthemtics University of Cliforni, Sn Diego L Joll, C 92093-0112 tfleming@mth.ucsd.edu bstrct lke
More information4-1 NAME DATE PERIOD. Study Guide. Parallel Lines and Planes P Q, O Q. Sample answers: A J, A F, and D E
4-1 NAME DATE PERIOD Pges 142 147 Prllel Lines nd Plnes When plnes do not intersect, they re sid to e prllel. Also, when lines in the sme plne do not intersect, they re prllel. But when lines re not in
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationTopic 2: Lexing and Flexing
Topic 2: Lexing nd Flexing COS 320 Compiling Techniques Princeton University Spring 2016 Lennrt Beringer 1 2 The Compiler Lexicl Anlysis Gol: rek strem of ASCII chrcters (source/input) into sequence of
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More informationFig.25: the Role of LEX
The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing
More informationArea & Volume. Chapter 6.1 & 6.2 September 25, y = 1! x 2. Back to Area:
Bck to Are: Are & Volume Chpter 6. & 6. Septemer 5, 6 We cn clculte the re etween the x-xis nd continuous function f on the intervl [,] using the definite integrl:! f x = lim$ f x * i )%x n i= Where fx
More informationGeometric transformations
Geometric trnsformtions Computer Grphics Some slides re bsed on Shy Shlom slides from TAU mn n n m m T A,,,,,, 2 1 2 22 12 1 21 11 Rows become columns nd columns become rows nm n n m m A,,,,,, 1 1 2 22
More informationarxiv: v1 [math.co] 18 Sep 2015
Improvements on the density o miml -plnr grphs rxiv:509.05548v [mth.co] 8 Sep 05 János Brát MTA-ELTE Geometric nd Algeric Comintorics Reserch Group rt@cs.elte.hu nd Géz Tóth Alréd Rényi Institute o Mthemtics,
More informationMa/CS 6b Class 1: Graph Recap
M/CS 6 Clss 1: Grph Recp By Adm Sheffer Course Detils Instructor: Adm Sheffer. TA: Cosmin Pohot. 1pm Mondys, Wednesdys, nd Fridys. http://mth.cltech.edu/~2015-16/2term/m006/ Min ook: Introduction to Grph
More informationTries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries
Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer
More informationMA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork
MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html
More informationORDER AUTOMATIC MAPPING CLASS GROUPS. Colin Rourke and Bert Wiest
PACIFIC JOURNAL OF MATHEMATICS ol. 94, No., 000 ORDER AUTOMATIC MAPPING CLASS GROUPS Colin Rourke nd Bert Wiest We prove tht the mpping clss group of compct surfce with finite numer of punctures nd non-empty
More informationIntermediate Information Structures
CPSC 335 Intermedite Informtion Structures LECTURE 13 Suffix Trees Jon Rokne Computer Science University of Clgry Cnd Modified from CMSC 423 - Todd Trengen UMD upd Preprocessing Strings We will look t
More informationSummer Review Packet For Algebra 2 CP/Honors
Summer Review Pcket For Alger CP/Honors Nme Current Course Mth Techer Introduction Alger uilds on topics studied from oth Alger nd Geometr. Certin topics re sufficientl involved tht the cll for some review
More informationGrade 7/8 Math Circles Geometric Arithmetic October 31, 2012
Fculty of Mthemtics Wterloo, Ontrio N2L 3G1 Grde 7/8 Mth Circles Geometric Arithmetic Octoer 31, 2012 Centre for Eduction in Mthemtics nd Computing Ancient Greece hs given irth to some of the most importnt
More informationSlides for Data Mining by I. H. Witten and E. Frank
Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully
More informationCS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis
CS143 Hndout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexicl Anlysis In this first written ssignment, you'll get the chnce to ply round with the vrious constructions tht come up when doing lexicl
More informationΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών. Lecture 3b Lexical Analysis Elias Athanasopoulos
ΕΠΛ323 - Θωρία και Πρακτική Μταγλωττιστών Lecture 3 Lexicl Anlysis Elis Athnsopoulos elisthn@cs.ucy.c.cy RecogniNon of Tokens if expressions nd relnonl opertors if è if then è then else è else relop è
More information9.1 apply the distance and midpoint formulas
9.1 pply the distnce nd midpoint formuls DISTANCE FORMULA MIDPOINT FORMULA To find the midpoint between two points x, y nd x y 1 1,, we Exmple 1: Find the distnce between the two points. Then, find the
More informationLily Yen and Mogens Hansen
SKOLID / SKOLID No. 8 Lily Yen nd Mogens Hnsen Skolid hs joined Mthemticl Myhem which is eing reformtted s stnd-lone mthemtics journl for high school students. Solutions to prolems tht ppered in the lst
More information9 Graph Cutting Procedures
9 Grph Cutting Procedures Lst clss we begn looking t how to embed rbitrry metrics into distributions of trees, nd proved the following theorem due to Brtl (1996): Theorem 9.1 (Brtl (1996)) Given metric
More informationImproper Integrals. October 4, 2017
Improper Integrls October 4, 7 Introduction We hve seen how to clculte definite integrl when the it is rel number. However, there re times when we re interested to compute the integrl sy for emple 3. Here
More informationMENSURATION-IV
MENSURATION-IV Theory: A solid is figure bounded by one or more surfce. Hence solid hs length, bredth nd height. The plne surfces tht bind solid re clled its fces. The fundmentl difference between plne
More information8.2 Areas in the Plane
39 Chpter 8 Applictions of Definite Integrls 8. Ares in the Plne Wht ou will lern out... Are Between Curves Are Enclosed Intersecting Curves Boundries with Chnging Functions Integrting with Respect to
More information4452 Mathematical Modeling Lecture 4: Lagrange Multipliers
Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl
More information3 4. Answers may vary. Sample: Reteaching Vertical s are.
Chpter 7 Answers Alterntive Activities 7-2 1 2. Check students work. 3. The imge hs length tht is 2 3 tht of the originl segment nd is prllel to the originl segment. 4. The segments pss through the endpoints
More informationNaming 3D objects. 1 Name the 3D objects labelled in these models. Use the word bank to help you.
Nming 3D ojects 1 Nme the 3D ojects lelled in these models. Use the word nk to help you. Word nk cue prism sphere cone cylinder pyrmid D A C F A B C D cone cylinder cue cylinder E B E prism F cue G G pyrmid
More informationPresentation Martin Randers
Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes
More informationGraphs with at most two trees in a forest building process
Grphs with t most two trees in forest uilding process rxiv:802.0533v [mth.co] 4 Fe 208 Steve Butler Mis Hmnk Mrie Hrdt Astrct Given grph, we cn form spnning forest y first sorting the edges in some order,
More informationB. Definition: The volume of a solid of known integrable cross-section area A(x) from x = a
Mth 176 Clculus Sec. 6.: Volume I. Volume By Slicing A. Introduction We will e trying to find the volume of solid shped using the sum of cross section res times width. We will e driving towrd developing
More informationTO REGULAR EXPRESSIONS
Suject :- Computer Science Course Nme :- Theory Of Computtion DA TO REGULAR EXPRESSIONS Report Sumitted y:- Ajy Singh Meen 07000505 jysmeen@cse.iit.c.in BASIC DEINITIONS DA:- A finite stte mchine where
More informationA GENERALIZED PROCEDURE FOR DEFINING QUOTIENT SPACES. b y HAROLD G. LAWRENCE A THESIS OREGON STATE UNIVERSITY MASTER OF ARTS
A GENERALIZED PROCEDURE FOR DEFINING QUOTIENT SPACES b y HAROLD G. LAWRENCE A THESIS submitted to OREGON STATE UNIVERSITY in prtil fulfillment of the requirements for the degree of MASTER OF ARTS June
More informationRay surface intersections
Ry surfce intersections Some primitives Finite primitives: polygons spheres, cylinders, cones prts of generl qudrics Infinite primitives: plnes infinite cylinders nd cones generl qudrics A finite primitive
More informationPointwise convergence need not behave well with respect to standard properties such as continuity.
Chpter 3 Uniform Convergence Lecture 9 Sequences of functions re of gret importnce in mny res of pure nd pplied mthemtics, nd their properties cn often be studied in the context of metric spces, s in Exmples
More information12-B FRACTIONS AND DECIMALS
-B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn
More informationMa/CS 6b Class 1: Graph Recap
M/CS 6 Clss 1: Grph Recp By Adm Sheffer Course Detils Adm Sheffer. Office hour: Tuesdys 4pm. dmsh@cltech.edu TA: Victor Kstkin. Office hour: Tuesdys 7pm. 1:00 Mondy, Wednesdy, nd Fridy. http://www.mth.cltech.edu/~2014-15/2term/m006/
More informationMATH 2530: WORKSHEET 7. x 2 y dz dy dx =
MATH 253: WORKSHT 7 () Wrm-up: () Review: polr coordintes, integrls involving polr coordintes, triple Riemnn sums, triple integrls, the pplictions of triple integrls (especilly to volume), nd cylindricl
More informationComplete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li
2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min
More informationarxiv: v1 [math.mg] 27 Jan 2008
Geometric Properties of ssur Grphs rxiv:0801.4113v1 [mth.mg] 27 Jn 2008 rigitte Servtius Offer Shi Wlter Whiteley June 18, 2018 bstrct In our previous pper, we presented the combintoril theory for miniml
More information1.5 Extrema and the Mean Value Theorem
.5 Extrem nd the Men Vlue Theorem.5. Mximum nd Minimum Vlues Definition.5. (Glol Mximum). Let f : D! R e function with domin D. Then f hs n glol mximum vlue t point c, iff(c) f(x) for ll x D. The vlue
More informationHyperbolas. Definition of Hyperbola
CHAT Pre-Clculus Hyperols The third type of conic is clled hyperol. For n ellipse, the sum of the distnces from the foci nd point on the ellipse is fixed numer. For hyperol, the difference of the distnces
More informationWhat are suffix trees?
Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl
More informationRational Numbers---Adding Fractions With Like Denominators.
Rtionl Numbers---Adding Frctions With Like Denomintors. A. In Words: To dd frctions with like denomintors, dd the numertors nd write the sum over the sme denomintor. B. In Symbols: For frctions c nd b
More informationObjective: Students will understand what it means to describe, graph and write the equation of a parabola. Parabolas
Pge 1 of 8 Ojective: Students will understnd wht it mens to descrie, grph nd write the eqution of prol. Prols Prol: collection of ll points P in plne tht re the sme distnce from fixed point, the focus
More informationCS201 Discussion 10 DRAWTREE + TRIES
CS201 Discussion 10 DRAWTREE + TRIES DrwTree First instinct: recursion As very generic structure, we could tckle this problem s follows: drw(): Find the root drw(root) drw(root): Write the line for the
More informationEXPONENTIAL & POWER GRAPHS
Eponentil & Power Grphs EXPONENTIAL & POWER GRAPHS www.mthletics.com.u Eponentil EXPONENTIAL & Power & Grphs POWER GRAPHS These re grphs which result from equtions tht re not liner or qudrtic. The eponentil
More informationarxiv:cs.cg/ v1 18 Oct 2005
A Pir of Trees without Simultneous Geometric Embedding in the Plne rxiv:cs.cg/0510053 v1 18 Oct 2005 Mrtin Kutz Mx-Plnck-Institut für Informtik, Srbrücken, Germny mkutz@mpi-inf.mpg.de October 19, 2005
More informationx )Scales are the reciprocal of each other. e
9. Reciprocls A Complete Slide Rule Mnul - eville W Young Chpter 9 Further Applictions of the LL scles The LL (e x ) scles nd the corresponding LL 0 (e -x or Exmple : 0.244 4.. Set the hir line over 4.
More informationGeometrical tile design for complex neighborhoods
COMPUTATIONAL NEUROSCIENCE ORIGINAL RESEARCH ARTICLE pulished: 23 Novemer 2009 doi: 103389/neuro100202009 Geometricl tile design for complex neighorhoods Eugen Czeizler* nd Lil Kri Deprtment of Computer
More informationAlgorithms for graphs on surfaces
Algorithms for grphs on surfces Éric Colin de Verdière École normle supérieure, 20112012 ALGORITHMS FOR GRAPHS ON SURFACES Foreword nd introduction Foreword These notes re certinly not in nl shpe, nd comments
More information1 Drawing 3D Objects in Adobe Illustrator
Drwing 3D Objects in Adobe Illustrtor 1 1 Drwing 3D Objects in Adobe Illustrtor This Tutoril will show you how to drw simple objects with three-dimensionl ppernce. At first we will drw rrows indicting
More informationDate: 9.1. Conics: Parabolas
Dte: 9. Conics: Prols Preclculus H. Notes: Unit 9 Conics Conic Sections: curves tht re formed y the intersection of plne nd doulenpped cone Syllus Ojectives:. The student will grph reltions or functions,
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More informationHere is an example where angles with a common arm and vertex overlap. Name all the obtuse angles adjacent to
djcent tht do not overlp shre n rm from the sme vertex point re clled djcent ngles. me the djcent cute ngles in this digrm rm is shred y + + me vertex point for + + + is djcent to + djcent simply mens
More informationIntegration. October 25, 2016
Integrtion October 5, 6 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my hve
More informationNotes for Graph Theory
Notes for Grph Theory These re notes I wrote up for my grph theory clss in 06. They contin most of the topics typiclly found in grph theory course. There re proofs of lot of the results, ut not of everything.
More informationMathematics Background
For more roust techer experience, plese visit Techer Plce t mthdshord.com/cmp3 Mthemtics Bckground Extending Understnding of Two-Dimensionl Geometry In Grde 6, re nd perimeter were introduced to develop
More informationMisrepresentation of Preferences
Misrepresenttion of Preferences Gicomo Bonnno Deprtment of Economics, University of Cliforni, Dvis, USA gfbonnno@ucdvis.edu Socil choice functions Arrow s theorem sys tht it is not possible to extrct from
More informationLab 1 - Counter. Create a project. Add files to the project. Compile design files. Run simulation. Debug results
1 L 1 - Counter A project is collection mechnism for n HDL design under specifiction or test. Projects in ModelSim ese interction nd re useful for orgnizing files nd specifying simultion settings. The
More informationarxiv: v1 [cs.cg] 9 Dec 2016
Some Counterexmples for Comptible Tringultions rxiv:62.0486v [cs.cg] 9 Dec 206 Cody Brnson Dwn Chndler 2 Qio Chen 3 Christin Chung 4 Andrew Coccimiglio 5 Sen L 6 Lily Li 7 Aïn Linn 8 Ann Lubiw 9 Clre Lyle
More information