2 Surface Topology. 2.1 Topological Type. Computational Topology Surface Topology Afra Zomorodian

Size: px
Start display at page:

Download "2 Surface Topology. 2.1 Topological Type. Computational Topology Surface Topology Afra Zomorodian"

Transcription

1 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 for us to reson out them glolly, e kno ht to do in smll neighorhoods. It turns out tht this ility is ll e relly need. This is rther fortunte, ecuse e suddenly he spces ith more interesting structure thn the Eucliden spces to study. Recll tht topology, like Eucliden geometry, is study of the properties of spces tht remin inrint (do not chnge) under fixed set of trnsformtions. In topology, e expnd the trnsformtions tht re lloed from rigid motions (Eucliden geometry) to homeomorphisms: ijectie i-continuous mps. In this lecture, e sk hether e my clssify mnifolds under this set of trnsformtions, nd e see tht such clssifiction is possile for to-dimensionl mnifolds or surfces. 2.1 Topologicl Type To egin ith, e should indicte ht e men y clssifiction. This notion hs nice mthemticl definition, hich you my he seen in high school. Definition 2.1 (prtition) A prtition of set is decomposition of the set into susets (cells) such tht eery element of the set is in one nd only one of the susets. We ish to prtition the set of mnifolds ccording to their connectiity. We re forced to look t different prtitioning schemes in our serch for one hich is computtionlly fesile. Ech scheme depends on n equilence reltion. Definition 2.2 (equilence) Let S e nonempty set nd let e reltion eteen elements of S tht stisfies the folloing properties for ll,, c S: 1. (Reflexie). 2. (Symmetric) If, then. 3. (Trnsitie) If nd c, c. Then, the reltion is n equilence reltion on S. It is cler from the definition of homeomorphism tht it is n equilence reltion. The folloing theorem llos us to derie prtition from n equilence reltion. Theorem 2.1 Let S e nonempty set nd let e n equilence reltion on S. Then, yields nturl prtition of S, here ā = {x S x }. ā represents the suset to hich elongs to. Ech cell ā is n equilence clss. As homeomorphism is n equilence reltion, e my use it to prtition mnifolds y this theorem. If to mnifolds re plced in the sme suset, they re connected the sme y, nd e sy tht they he the sme topologicl type. One of the fundmentl questions in topology is hether this prtition is computle. In this lecture, e focus on the solution to this prolem in to dimensions. 1

2 2.2 Bsic 2-Mnifolds Before clssifying 2-mnifolds, hoeer, it ould e nice to meet fe of them. In this section, e look t fe sic 2-mnifolds. () {x R 3 x = 1} () Identify oundry to Figure 1. The sphere S 2 (c) Instructions for flt sphere The sphere. Topologiclly, the sphere S 2 is the simplest surfce. We re most comfortle ith the implicit surfce definition in Figure 1(), tht defines the unit sphere s suspce of R 3. The sphere my e defined, hoeer, using digrm in Figure 1(), hich sks us to mke the entire oundry of disc to single point. This process is clled identifiction: this mens tht ll the points in the oundry should e treted s if they ere the sme point. The identifiction here gies us topologicl sphere. We my lso mke sphere out of pper s shon in Figure 1(c). Pper hs no curture, so it hs flt geometry, nd e get flt sphere. The strct sphere defined y the digrm (), long ith the flt sphere, highlight the difference eteen the sphere s topologicl concept, nd sphere s geometric entity. It is importnt for you to consider the difference crefully. We only cre out connectiity in topology, nd ht is connected like the geometric sphere is sphere, no mtter its geometry. () Donut surfce () Digrm (c) Instructions for flt torus Figure 2. The torus T 2 The torus. The torus is fmilir to us s the surfce of gel or donut, s shon in Figure 2(). We my descrie torus s suspce of R 3 geometriclly. For exmple, torus of reolution is creted hen e seep circle round the z-xis: T (u, ) = ((1 + cos u) cos, (1 + cos u) sin, sin(u)). The torus my lso e descried i digrm in Figure 2(), in hich the edges re glued ccording to their direction of their rros. Finlly, e cn uild flt torus using the directions in Figure 2(c) The Möius strip. Figure 3() shos n emedded Möius strip: 2-mnifold ith oundry. It is esy to construct one y gluing one end of strip of pper to the other end ith single tist, s shon in the digrm in Figure 3(). This mnifold is not orientle. The notes for lst lecture included definition of orientility for smooth mnifolds in n ppendix. We ill see nother forml definition of orientility in the next lecture. For no, orientility mens tht the surfce hs to sides. In Figure 3(c), M. C. Escher estlishes tht the Möius strip is one-sided y mrching nts on the strip Note tht the oundry of the Möius strip is single cycle. This cycle corresponds to the to unglued edges in the digrm 3() hich e my no glue ith or ithout tist. The projectie plne. If e put non-mtching rros on the remining to edges of the Möius digrm s in Figure 4(), e get the projectie plne RP 2. This ction corresponds to gluing the oundry of disk to the oundry 2

3 () Emedded () Digrm (c) Escher s Möius Strip II Figure 3. The Möius strip is non-orientle mnifold ith oundry. () Digrm () Instructions for flt RP 2 Figure 4. The projectie plne RP 2 of the Möius strip. This mnifold hs this nme ecuse of its ssocition ith projectie geometry used in rt nd computer grphics for representing ht e see on flt cns. For exmple, e kno tht rily lines neer intersect, s they re prllel. When e look t them in rel life, hoeer, e see tht they come together t the horizon, or t infinity. They lso intersect t horizon ehind us. We ould like ny to lines to intersect t most once, so e identify the to intersecting points s the sme point. Imgine the oundry of the digrm in 4() is the horizon. The rros on the digrm identify point nd its reflected imge round the origin. These points re clled nti-podl points. This mnifold is non-orientle s it contins Möius strip. It cnnot e emedded in R 3, so e he to e content ith immersions. Figure 5 shos three immersions of the projectie plne, ll of hich self-intersect. These immersions re fmous s they contin interesting geometry in ddition to their shred topology. To mke n pper model, e he to cut the pper to llo for the self-intersection. The Klein ottle. If e glue the free edges of the Möius strip in the sme direction, e get the Klein ottle K 2, s shon in Figure 6(). The Klein ottle is therefore equilent to gluing to Möius strips to ech other long their oundry. Like the projectie plne, it is closed non-orientle surfce. It is not emeddle in R 3, nd its immersions in Figures 6() nd 6(c) self-intersect ith the intersecting tringle colored in red. Once gin, e need to cut pper in order to mke flt model, s shon in FIgure 6(d). () Cross cp () Boy s Surfce (c) Steiner s Romn Surfce Figure 5. Models of the projectie plne RP 2 3

4 () Digrm () An immersion (c) Cut in hlf ( Möius strip) (d) Instructions for flt K 2 Figure 6. The Klein ottle K Connected Sum We my use the surfces e just defined to form lrger mnifolds. To do this, e form connected sums. Definition 2.3 (connected sum) The connected sum of to n-mnifolds M 1, M 2 is M 1 # M 2 = M 1 D 1 n M 2 D 2 n, D n 1 = D n 2 here D n 1, D n 2 re n-dimensionl closed disks in M 1, M 2, respectiely. In other ords, e cut out to disks nd glue the mnifolds together long the oundry of those disks using homeomorphism. In Figure 7, for exmple, e connect to tori to form sum ith to hndles. # = Figure 7. The connected sum of to tori is genus 2 torus. 2.4 The Clssifiction Theorem We re no le to stte result tht gies complete clssifiction of compct 2-mnifolds. Theorem 2.2 (clssifiction of compct 2-mnifolds) Eery closed compct surfce is homeomorphic to sphere, the connected sum of tori, or connected sum of projectie plnes. We ill see in the next lecture tht this clssifiction is esily computle. In the reminder of this lecture, e ill look t Cony s ZIP proof [2] of this theorem. The pper is proided on the esite s the notes for the rest of the lecture. The theorem nsers the homeomorphism question for compct mnifolds in to dimensions. After lerning out groups, e ill see tht this question is undecidle for dimensions four nd higher. This prolem is still open in three dimensions, nd three-mnifold topology is n ctie re of reserch. For ery ccessile oerie, see Weeks [3]. Acknoledgments The instruction for mking flt 2-mnifolds re from Firy nd Grdiner [1]. I rendered the models of projectie plne in Figure 5 in POV-Ry using descriptions y Tore Nordstrnd. Figures 6() nd 6(c) re from [4]. 4

5 References [1] FIRBY, P. A., AND GARDINER, C. F. Surfce Topology. Ellis Horood Limited, Chichester, Englnd, [2] FRANCIS, G. K., AND WEEKS, J. R. Cony s ZIP proof. Americn Mth. Monthly 106 (My 1999). [3] WEEKS, J. R. The Shpe of Spce. Mrcel Dekker, Inc., Ne York, NY, [4] ZOMORODIAN, A., AND EDELSBRUNNER, H. Fst Softre for Box Intersection. In Proc. 16th Ann. ACM Sympos. Comput. Geom. (2000), pp

ON THE DEHN COMPLEX OF VIRTUAL LINKS

ON THE DEHN COMPLEX OF VIRTUAL LINKS 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

More information

a(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X

a(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 information

1 Quad-Edge Construction Operators

1 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 information

Basic Geometry and Topology

Basic 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 information

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.

If 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 information

INTRODUCTION TO SIMPLICIAL COMPLEXES

INTRODUCTION 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 information

10.5 Graphing Quadratic Functions

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 information

Chapter44. Polygons and solids. Contents: A Polygons B Triangles C Quadrilaterals D Solids E Constructing solids

Chapter44. 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 information

Math 35 Review Sheet, Spring 2014

Math 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 information

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.

6.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 information

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1

a < 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 information

SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES

SOME 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 information

9 Graph Cutting Procedures

9 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 information

AML710 CAD LECTURE 16 SURFACES. 1. Analytical Surfaces 2. Synthetic Surfaces

AML710 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

UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS 1 COMPUTATION & LOGIC INSTRUCTIONS TO CANDIDATES

UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS 1 COMPUTATION & LOGIC INSTRUCTIONS TO CANDIDATES UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS COMPUTATION & LOGIC Sturdy st April 7 : to : INSTRUCTIONS TO CANDIDATES This is tke-home exercise. It will not

More information

If f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve.

If 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 information

such that the S i cover S, or equivalently S

such 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 information

Dr. D.M. Akbar Hussain

Dr. 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 information

In the last lecture, we discussed how valid tokens may be specified by regular expressions.

In 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 information

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 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 information

Naming 3D objects. 1 Name the 3D objects labelled in these models. Use the word bank to help you.

Naming 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 information

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus

Unit #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 information

Fig.25: the Role of LEX

Fig.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 information

Tries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries

Tries. 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 information

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula:

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula: 5 AMC LECTURES Lecture Anlytic Geometry Distnce nd Lines BASIC KNOWLEDGE. Distnce formul The distnce (d) between two points P ( x, y) nd P ( x, y) cn be clculted by the following formul: d ( x y () x )

More information

MATH 2530: WORKSHEET 7. x 2 y dz dy dx =

MATH 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 information

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

MA1008. 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 information

6.2 Volumes of Revolution: The Disk Method

6.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 information

8.2 Areas in the Plane

8.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 information

Slides for Data Mining by I. H. Witten and E. Frank

Slides 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 information

Mathematics Background

Mathematics 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 information

MTH 146 Conics Supplement

MTH 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 information

CS321 Languages and Compiler Design I. Winter 2012 Lecture 5

CS321 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 information

CS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis

CS143 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

3 4. Answers may vary. Sample: Reteaching Vertical s are.

3 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 information

Class-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts

Class-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 information

Rational Numbers---Adding Fractions With Like Denominators.

Rational 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 information

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.

Fig.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 information

CSCI 3130: Formal Languages and Automata Theory Lecture 12 The Chinese University of Hong Kong, Fall 2011

CSCI 3130: Formal Languages and Automata Theory Lecture 12 The Chinese University of Hong Kong, Fall 2011 CSCI 3130: Forml Lnguges nd utomt Theory Lecture 12 The Chinese University of Hong Kong, Fll 2011 ndrej Bogdnov In progrmming lnguges, uilding prse trees is significnt tsk ecuse prse trees tell us the

More information

Grade 7/8 Math Circles Geometric Arithmetic October 31, 2012

Grade 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 information

Ray surface intersections

Ray 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 information

COMPUTER EDUCATION TECHNIQUES, INC. (MS_W2K3_SERVER ) SA:

COMPUTER EDUCATION TECHNIQUES, INC. (MS_W2K3_SERVER ) SA: In order to lern which questions hve een nswered correctly: 1. Print these pges. 2. Answer the questions. 3. Send this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following

More information

1.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. 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 information

Presentation Martin Randers

Presentation 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 information

Here is an example where angles with a common arm and vertex overlap. Name all the obtuse angles adjacent to

Here 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 information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before 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 information

CS-184: Computer Graphics. Today. Lecture #10: Clipping and Hidden Surfaces ClippingAndHidden.key - October 27, 2014.

CS-184: Computer Graphics. Today. Lecture #10: Clipping and Hidden Surfaces ClippingAndHidden.key - October 27, 2014. 1 CS184: Computer Grphics Lecture #10: Clipping nd Hidden Surfces!! Prof. Jmes O Brien University of Cliforni, Berkeley! V2013F101.0 Tody 2 Clipping Clipping to view volume Clipping ritrry polygons Hidden

More information

Stained Glass Design. Teaching Goals:

Stained 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 information

4-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. 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 information

MATH 25 CLASS 5 NOTES, SEP

MATH 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 information

OUTPUT DELIVERY SYSTEM

OUTPUT DELIVERY SYSTEM Differences in ODS formtting for HTML with Proc Print nd Proc Report Lur L. M. Thornton, USDA-ARS, Animl Improvement Progrms Lortory, Beltsville, MD ABSTRACT While Proc Print is terrific tool for dt checking

More information

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search.

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search. CS 88: Artificil Intelligence Fll 00 Lecture : A* Serch 9//00 A* Serch rph Serch Tody Heuristic Design Dn Klein UC Berkeley Multiple slides from Sturt Russell or Andrew Moore Recp: Serch Exmple: Pncke

More information

Math 464 Fall 2012 Notes on Marginal and Conditional Densities October 18, 2012

Math 464 Fall 2012 Notes on Marginal and Conditional Densities October 18, 2012 Mth 464 Fll 2012 Notes on Mrginl nd Conditionl Densities klin@mth.rizon.edu October 18, 2012 Mrginl densities. Suppose you hve 3 continuous rndom vribles X, Y, nd Z, with joint density f(x,y,z. The mrginl

More information

1 Drawing 3D Objects in Adobe Illustrator

1 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 information

Angle Properties in Polygons. Part 1 Interior Angles

Angle Properties in Polygons. Part 1 Interior Angles 2.4 Angle Properties in Polygons YOU WILL NEED dynmic geometry softwre OR protrctor nd ruler EXPLORE A pentgon hs three right ngles nd four sides of equl length, s shown. Wht is the sum of the mesures

More information

Reducing a DFA to a Minimal DFA

Reducing a DFA to a Minimal DFA Lexicl Anlysis - Prt 4 Reducing DFA to Miniml DFA Input: DFA IN Assume DFA IN never gets stuck (dd ded stte if necessry) Output: DFA MIN An equivlent DFA with the minimum numer of sttes. Hrry H. Porter,

More information

ply the eistence of homeomorphic modifictions. Outline. Section 2 introduces definitions from comintoril topology. Section 3 defines oundry; its sic p

ply the eistence of homeomorphic modifictions. Outline. Section 2 introduces definitions from comintoril topology. Section 3 defines oundry; its sic p Topology Preserving Edge Contrction Λ Tml K. Dey y, Herert Edelsrunner z, Sumnt Guh nd Dmitry V. Nekhyev Astrct We study edge contrctions in simplicil complees nd locl conditions under which they preserve

More information

Network Layer: Routing Classifications; Shortest Path Routing

Network Layer: Routing Classifications; Shortest Path Routing igitl ommuniction in the Modern World : Routing lssifictions; Shortest Pth Routing s min prolem: To get efficiently from one point to the other in dynmic environment http://.cs.huji.c.il/~com com@cs.huji.c.il

More information

Answer Key Lesson 6: Workshop: Angles and Lines

Answer Key Lesson 6: Workshop: Angles and Lines nswer Key esson 6: tudent Guide ngles nd ines Questions 1 3 (G p. 406) 1. 120 ; 360 2. hey re the sme. 3. 360 Here re four different ptterns tht re used to mke quilts. Work with your group. se your Power

More information

Lecture 7: Integration Techniques

Lecture 7: Integration Techniques Lecture 7: Integrtion Techniques Antiderivtives nd Indefinite Integrls. In differentil clculus, we were interested in the derivtive of given rel-vlued function, whether it ws lgeric, eponentil or logrithmic.

More information

Announcements. CS 188: Artificial Intelligence Fall Recap: Search. Today. Example: Pancake Problem. Example: Pancake Problem

Announcements. CS 188: Artificial Intelligence Fall Recap: Search. Today. Example: Pancake Problem. Example: Pancake Problem Announcements Project : erch It s live! Due 9/. trt erly nd sk questions. It s longer thn most! Need prtner? Come up fter clss or try Pizz ections: cn go to ny, ut hve priority in your own C 88: Artificil

More information

Order these angles from smallest to largest by wri ng 1 to 4 under each one. Put a check next to the right angle.

Order these angles from smallest to largest by wri ng 1 to 4 under each one. Put a check next to the right angle. Lines nd ngles Connect ech set of lines to the correct nme: prllel perpendiculr Order these ngles from smllest to lrgest y wri ng to 4 under ech one. Put check next to the right ngle. Complete this tle

More information

The Math Learning Center PO Box 12929, Salem, Oregon Math Learning Center

The Math Learning Center PO Box 12929, Salem, Oregon Math Learning Center Resource Overview Quntile Mesure: Skill or Concept: 80Q Multiply two frctions or frction nd whole numer. (QT N ) Excerpted from: The Mth Lerning Center PO Box 99, Slem, Oregon 9709 099 www.mthlerningcenter.org

More information

Study Guide for Exam 3

Study Guide for Exam 3 Mth 05 Elementry Algebr Fll 00 Study Guide for Em Em is scheduled for Thursdy, November 8 th nd ill cover chpters 5 nd. You my use "5" note crd (both sides) nd scientific clcultor. You re epected to no

More information

Definition and Examples

Definition 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 information

Objective: Students will understand what it means to describe, graph and write the equation of a parabola. Parabolas

Objective: 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 information

Math Line Integrals I

Math Line Integrals I Mth 213 - Line Integrls I Peter A. Perry University of Kentucky November 16, 2018 Homework Re-Red Section 16.2 for Mondy Work on Stewrt problems for 16.2: 1-21 (odd), 33-41 (odd), 49, 50 Begin Webwork

More information

this grammar generates the following language: Because this symbol will also be used in a later step, it receives the

this grammar generates the following language: Because this symbol will also be used in a later step, it receives the LR() nlysis Drwcks of LR(). Look-hed symols s eplined efore, concerning LR(), it is possile to consult the net set to determine, in the reduction sttes, for which symols it would e possile to perform reductions.

More information

Research Announcement: MAXIMAL CONNECTED HAUSDORFF TOPOLOGIES

Research Announcement: MAXIMAL CONNECTED HAUSDORFF TOPOLOGIES Volume 2, 1977 Pges 349 353 http://topology.uburn.edu/tp/ Reserch Announcement: MAXIMAL CONNECTED HAUSDORFF TOPOLOGIES by J. A. Guthrie, H. E. Stone, nd M. L. Wge Topology Proceedings Web: http://topology.uburn.edu/tp/

More information

F. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.

F. 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 information

Graphs with at most two trees in a forest building process

Graphs 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 information

CS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig

CS311H: 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 information

Lecture 5: Spatial Analysis Algorithms

Lecture 5: Spatial Analysis Algorithms Lecture 5: Sptil Algorithms GEOG 49: Advnced GIS Sptil Anlsis Algorithms Bsis of much of GIS nlsis tod Mnipultion of mp coordintes Bsed on Eucliden coordinte geometr http://stronom.swin.edu.u/~pbourke/geometr/

More information

Lily Yen and Mogens Hansen

Lily 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 information

1 The Definite Integral

1 The Definite Integral The Definite Integrl Definition. Let f be function defined on the intervl [, b] where

More information

Finite Automata. Lecture 4 Sections Robb T. Koether. Hampden-Sydney College. Wed, Jan 21, 2015

Finite Automata. Lecture 4 Sections Robb T. Koether. Hampden-Sydney College. Wed, Jan 21, 2015 Finite Automt Lecture 4 Sections 3.6-3.7 Ro T. Koether Hmpden-Sydney College Wed, Jn 21, 2015 Ro T. Koether (Hmpden-Sydney College) Finite Automt Wed, Jn 21, 2015 1 / 23 1 Nondeterministic Finite Automt

More information

Rigid Body Transformations

Rigid Body Transformations igid od Kinemtics igid od Trnsformtions Vij Kumr igid od Kinemtics emrk out Nottion Vectors,,, u, v, p, q, Potentil for Confusion! Mtrices,, C, g, h, igid od Kinemtics The vector nd its skew smmetric mtri

More information

A 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 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 information

ΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών

ΕΠΛ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 information

Unit 5 Vocabulary. A function is a special relationship where each input has a single output.

Unit 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 information

A dual of the rectangle-segmentation problem for binary matrices

A 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 information

ORDER AUTOMATIC MAPPING CLASS GROUPS. Colin Rourke and Bert Wiest

ORDER 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 information

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting

More information

Can Pythagoras Swim?

Can Pythagoras Swim? Overview Ativity ID: 8939 Mth Conepts Mterils Students will investigte reltionships etween sides of right tringles to understnd the Pythgoren theorem nd then use it to solve prolems. Students will simplify

More information

Simplifying Algebra. Simplifying Algebra. Curriculum Ready.

Simplifying Algebra. Simplifying Algebra. Curriculum Ready. Simplifying Alger Curriculum Redy www.mthletics.com This ooklet is ll out turning complex prolems into something simple. You will e le to do something like this! ( 9- # + 4 ' ) ' ( 9- + 7-) ' ' Give this

More information

Notes for Graph Theory

Notes 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 information

Lecture 7: Building 3D Models (Part 1) Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

Lecture 7: Building 3D Models (Part 1) Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI) Computer Grphics (CS 4731) Lecture 7: Building 3D Models (Prt 1) Prof Emmnuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Stndrd d Unit itvectors Define y i j 1,0,0 0,1,0 k i k 0,0,1

More information

ZZ - Advanced Math Review 2017

ZZ - Advanced Math Review 2017 ZZ - Advnced Mth Review Mtrix Multipliction Given! nd! find the sum of the elements of the product BA First, rewrite the mtrices in the correct order to multiply The product is BA hs order x since B is

More information

CS-184: Computer Graphics. Today. Clipping. Hidden Surface Removal. Tuesday, October 7, Clipping to view volume Clipping arbitrary polygons

CS-184: Computer Graphics. Today. Clipping. Hidden Surface Removal. Tuesday, October 7, Clipping to view volume Clipping arbitrary polygons CS184: Computer Grphics Lecture #10: Clipping nd Hidden Surfces Prof. Jmes O Brien University of Cliforni, Berkeley V2008S101.0 1 Tody Clipping Clipping to view volume Clipping ritrry polygons Hidden Surfce

More information

COMP 423 lecture 11 Jan. 28, 2008

COMP 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 information

Improper Integrals. October 4, 2017

Improper 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 information

What are suffix trees?

What 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 information

Digital Design using HDLs EE 4755 Final Examination

Digital Design using HDLs EE 4755 Final Examination Nme Solution Digitl Design using HDLs EE 4755 Finl Exmintion Thursdy, 8 Decemer 6 :3-4:3 CST Alis The Hottest Plce in Hell Prolem Prolem Prolem 3 Prolem 4 Prolem 5 Prolem 6 Exm Totl (3 pts) ( pts) (5 pts)

More information

Section 10.4 Hyperbolas

Section 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 information

Definition of Regular Expression

Definition 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 information

12-B FRACTIONS AND DECIMALS

12-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 information

Object and image indexing based on region connection calculus and oriented matroid theory

Object and image indexing based on region connection calculus and oriented matroid theory Discrete Applied Mthemtics 147 (2005) 345 361 www.elsevier.com/locte/dm Oject nd imge indexing sed on region connection clculus nd oriented mtroid theory Ernesto Stffetti, Antoni Gru, Frncesc Serrtos c,

More information

Ma/CS 6b Class 1: Graph Recap

Ma/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 information

Agenda & Reading. Class Exercise. COMPSCI 105 SS 2012 Principles of Computer Science. Arrays

Agenda & Reading. Class Exercise. COMPSCI 105 SS 2012 Principles of Computer Science. Arrays COMPSCI 5 SS Principles of Computer Science Arrys & Multidimensionl Arrys Agend & Reding Agend Arrys Creting & Using Primitive & Reference Types Assignments & Equlity Pss y Vlue & Pss y Reference Copying

More information

Summer Review Packet For Algebra 2 CP/Honors

Summer 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 information