and vertically shrinked by

Size: px
Start display at page:

Download "and vertically shrinked by"

Transcription

1 1. A first exmple 1.1. From infinite trnsltion surfe mp to end-periodi mp. We begin with n infinite hlf-trnsltion surfe M 0 desribed s in Figure 1 nd n ffine mp f 0 defined s follows: the surfe is horizontlly nd vertilly shrinked by 2 strethed by 5 1, then the prt to the left of the vertil dshed line is sent to the prt bove the horizontl dshed line, while the prt to the right of the vertil dshed line is rotted by π nd sent to the prt below the horizontl dshed line. Let M 1 be the double over of M 0 whih is n infinite trnsltion surfe. More preisely, onsider two opies of the polygon in figure 1: P 0 nd P 1. For eh pir of edges in figure 1 with the sme lbel, if they re in the sme diretion, we glue the pirs in P 0 nd P 1 together; if they re in the different diretion, we glue the edges in P 0 to the edges in P 1 in the opposite diretion. Let f 1 be the lift of f 0 tht sends the prt of P 0 to the left of the vertil dshed line to the prt of P 0 bove the horizontl dshed line of the sme lef. f 2 f 2 f 1 f 1 e 2 e 2 e 1 e 1 b d d b Figure 1 Now we blow up M 1 into M 3 s shown in figure 2. The blow up proeeds s follows: strt with the polygonl region in figure 1. Reple eh red dot in the boundry with short r g n, nd dd line t the top-left orner whih is divided into short segments h n. Glue ll the other edges ording to the previous prgrph, then we get n infinite (topologil) surfe M 2 with boundry whose boundry urves re g n nd h n. f 1 lifts to f 2, whih sends g n to g n+1 nd h n to h n+1. Keep the gluing reltions 1

2 2 on ll other sides. Let M 3 be the double of M 2 long its boundry, nd f 3 be diffeomorphism from M 3 to itself whih is identil to f 2 when double over of f 2. Now f 3 is n end-periodi mp (.f. [F97, CC]). This blow up proess reverses the Hndel-Miller onstrution [CC], where pir of invrint lmintions, hene n ffine mp on hlf-trnsltion surfe, is obtined from n end-periodi mp. f 2 f 2 h 3 g 3 h 2 f 1 h 3 h 2 h 0 h 1 h 1 f 1 g 2 b e 2 e 2 g 3 e 1 g 1 d e 1 g 2 d g 0 b g 1 Figure 2. This is one of the two leves of X. g i nd h i re the boundry urves. S is its double. The mp F is defined s sending the region to the left of the red line to the region bove the blue line, nd sending the region to the right of the red line to the prt below the blue line on nother lef From end-periodi mp to 3-mnifold. Let T be the mpping torus of M 3 with monodromy f 3. This is non ompt 3-mnifold, sine it is mpping torus of non ompt surfe. The mpping torus onstrution restrited to the two periodi ends (the ttrting one nd the repelling one) forms two ylindril ends of the 3 mnifold s in Figure 3,

3 lso.f. [F97]. Hene, it hs nturl omptifition T by dding two opies of losed surfe homeomorphi to the quotient of either end of M 3 by f 3. More preisely, in T, onsider the prt oming from the suspension of neighborhood of the repelling end, nd djoin n idel point to every flow line in there. The set of suh idel points is homeomorphi to the quotient of this neighborhood under the mp f 3. Similrly, one n do the sme thing with the ttrting end. In prtiulr, the boundry urves of these two periodi neighborhoods (in our se, the green dotted lines in figure 2) re identified with union of loops C nd C on these two boundry surfes. 3 Figure Approximtion by sequene of finite type surfes. Glue the two boundry surfes of T together suh tht C nd C re identified, then we get losed 3-mnifold with depth 1 folition, whose infinite leves re from the mpping torus nd the ompt lef is from the boundry surfe of T, whose dul in H 1 (N) is denoted s b. Remove smll ylindril neighborhood of the ompt lef nd glue the two ends of the infinite leves togther, we get fibertion of N on irle whih orresponds to point lose to b in PH 1 (N). In terms of the surfe, wht this gives us is mp f 4 on finite surfe M 4 bsed on the end-periodi mp. M 4 is formed by gluing the preimge of the green dotted loops under some iterte of f 3 in the ttrting end to the green dotted loops in the repelling end, nd f 4 is the sme s f 3 exept on the lst step in the ttrting end, whih, insted of being sent to the next step, it is sent to the step in the repelling end glued to it. The ext wy it is sent to the repelling end is determined by how we identify the boundries of T to form N. Here, we send h n to h 3, g n to g 3, nd e n 1 to f 1 s shown in figure 2. Vrying n we get sequene of mps on surfes of inresing genus, whih represents n rithmeti sequene in fibered one

4 4 of N. We n give flt struture on eh finite surfe mp by invrint mesure lmintions, mking them two opies of the double over of hlf trnsltion surfes. In our se, one of them is over of the following: Figure 4. The dilttion onstnt λ stisfies λ 6 λ 4 λ 3 λ = 0 And, by lultion, we know tht the dilttion of f 4 on these surfes stisfy λ n λ n 2 λ = Fibered fe nd Teihmüller polynomil. The 1-eigenspe of f 4 on H 1 (M 4 ; Q) hs rnk 3 nd is generted by the duls of the two loops formed by h i s well s the dul of the green loops s shown in figure 2. Hene, the ompt 3-mnifold hs first Betti number 4. The loops formed by h i re both preserved by f 4, hene perturbing fibertion in those two diretions orrespond to doing Dehn twists on embedded tori, whih hnges neither genus (i.e. they lie in the kernel of the Thurston norm) nor the dilttion onstnt when those loops re ollpsed. 2. Other exmples Exmple 1. Bowmn [JB] desribed suh sequene formed by Arnoux- Yooz surfes. Exmple 2 (Chmnr surfe[rc]). Strt with the Chmnr surfe (Figure 5) with the Bker s mp, where the prt to the right of the vertil dshed line is sent to the prt below the horizontl dshed line: In the polygon in Figure 5, reple eh blue dot in the boundry with short r, nd dd line t the top-left orner nd line t the bottom-right

5 5 Figure 5 orner, whih re both divided into short segments. Glue ll the other edges ording to the previous prgrph, then we get n infinite (topologil) surfe with boundry nd the ffine mp lifts to n end-periodi mp with one ontrting nd one repelling end. Do double of this infinite surfe long the boundry, nd follow the sme proedure s desribed in the previous setion, we get sequene of finite surfe mps pproximting the Bker s mp on the Chmnr surfe. Figure 6 is surfe in the sequene pproximting the Chmnr surfe. It s in strt H(2). The dilttion onstnt is pproximtely whih is the root of x 4 x 3 x 2 x + 1 = 0. The next surfe in this sequene is Figure 7. It s in strt H(1, 1). The dilttion onstnt is pproximtely whih is the root of x 5 x 4 x 3 x 2 x + 1 = 0. In generl, the dilttion onstnt is root of x n x n 1 x + 1 = 0. Exmple 3. Consider pieewise liner mp from squre to itself defined s follows: deomposes the squre horizontlly into three retngles of the sme width, streth them horizontlly by 3 nd shrink them vertilly by 3, then stk them vertilly suh tht the left-most retngle is put in

6 6 Figure 6 Figure 7 the middle, the middle retngle is put t the bottom, nd the right-most retngle is rotted by π nd put t the top. This mp indues gluing on the boundry of the squre whih mkes it into hlf-trnsltion surfe of infinite type, s shown in Figure 8. Pss to double over tht mkes it trnsltion surfe, then reple the infinite one points with line segments nd do double long them s in the previous setion, we get end-periodi mp on infinite-type surfe with one ontrting nd one repelling end. Following the sme proess s

7 7 b d b d d 1 b 1 d 1 b 1 Figure 8 desribed in the previous setion we n get sequene of finite surfe with pseudo-anosov mps, one of whih is shown in Figure 9. Figure 9. The dilttion of this pseudo-anosov mp is the lrgest root of λ 8 3λ 7 2λ 5 + 4λ 4 2λ 3 3λ + 1 = 0. By lultion, the dilttion of these sequene of pseudo-anosov mpd stisfies λ 8+2n 3λ 7+2n 2λ 5+n + 4λ 4+n 2λ 3+n 3λ + 1 = 0.

8 8 3. Aknowledgements We would lso like to thnk someone. The first uthor ws prtilly supported by the ERC Grnt Nb Referenes [CH] de Crvlho, A. nd Hll, T. (2004). Unimodl generlized pseudo-anosov mps. Geom. Topol., 8, [BRW15] Bik, H. nd Rfiqi, A. nd Wu, C. Construting pseudo-anosov mps with given dilttions. Geom. Dedit (2015), DOI /s [F97] Fenley, Srgio R. End periodi surfe homeomorphisms nd 3-mnifolds. Mthemtishe Zeitshrift (1997): [CC] Cntwell, John, nd Lwrene Conlon. Endperiodi Automorphisms of Surfes nd Folitions. rxiv preprint rxiv: (2010). [JB] Bowmn, Joshu P. The omplete fmily of Arnoux-Yooz surfes. Geometrie Dedit (2013): [RC] Chmnr, Rez. Affine utomorphism groups of surfes of infinite type. Contemporry Mthemtis 355 (2004): Mthemtishes Institut, Rheinishe Friedrih-Wilhelms-Universität Bonn, Endeniher Allee 60, Bonn, Germny E-mil ddress: Deprtment of Mthemtis, Cornell University, Mlott Hll, Ith, NY 14853, USA E-mil ddress: Deprtment of Mthemtis, Cornell University, Mlott Hll, Ith, NY 14853, USA E-mil ddress:

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms Prdigm. Dt Struture Known exmples: link tble, hep, Our leture: suffix tree Will involve mortize method tht will be stressed shortly in this ourse Suffix trees Wht is suffix tree? Simple pplitions History

More information

Lecture 12 : Topological Spaces

Lecture 12 : Topological Spaces Leture 12 : Topologil Spes 1 Topologil Spes Topology generlizes notion of distne nd loseness et. Definition 1.1. A topology on set X is olletion T of susets of X hving the following properties. 1. nd X

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

Line The set of points extending in two directions without end uniquely determined by two points. The set of points on a line between two points

Line The set of points extending in two directions without end uniquely determined by two points. The set of points on a line between two points Lines Line Line segment Perpendiulr Lines Prllel Lines Opposite Angles The set of points extending in two diretions without end uniquely determined by two points. The set of points on line between two

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

Tight triangulations: a link between combinatorics and topology

Tight triangulations: a link between combinatorics and topology Tight tringultions: link between ombintoris nd topology Jonthn Spreer Melbourne, August 15, 2016 Topologil mnifolds (Geometri) Topology is study of mnifolds (surfes) up to ontinuous deformtion Complited

More information

CS 241 Week 4 Tutorial Solutions

CS 241 Week 4 Tutorial Solutions CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it

More information

Honors Thesis: Investigating the Algebraic Properties of Cayley Digraphs

Honors Thesis: Investigating the Algebraic Properties of Cayley Digraphs Honors Thesis: Investigting the Algebri Properties of Cyley Digrphs Alexis Byers, Wittenberg University Mthemtis Deprtment April 30, 2014 This pper utilizes Grph Theory to gin insight into the lgebri struture

More information

Duality in linear interval equations

Duality in linear interval equations Aville online t http://ijim.sriu..ir Int. J. Industril Mthemtis Vol. 1, No. 1 (2009) 41-45 Dulity in liner intervl equtions M. Movhedin, S. Slhshour, S. Hji Ghsemi, S. Khezerloo, M. Khezerloo, S. M. Khorsny

More information

Math 227 Problem Set V Solutions. f ds =

Math 227 Problem Set V Solutions. f ds = Mth 7 Problem Set V Solutions If is urve with prmetriztion r(t), t b, then we define the line integrl f ds b f ( r(t) ) dr dt (t) dt. Evlute the line integrl f(x,y,z)ds for () f(x,y,z) xosz, the urve with

More information

Section 2.3 Functions. Definition: Let A and B be sets. A function (mapping, map) f from A to B, denoted f :A B, is a subset of A B such that

Section 2.3 Functions. Definition: Let A and B be sets. A function (mapping, map) f from A to B, denoted f :A B, is a subset of A B such that Setion 2.3 Funtions Definition: Let n e sets. funtion (mpping, mp) f from to, enote f :, is suset of suh tht x[x y[y < x, y > f ]] n [< x, y 1 > f < x, y 2 > f ] y 1 = y 2 Note: f ssoites with eh x in

More information

Lesson 4.4. Euler Circuits and Paths. Explore This

Lesson 4.4. Euler Circuits and Paths. Explore This Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different

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

Section 3.1: Sequences and Series

Section 3.1: Sequences and Series Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one

More information

10.2 Graph Terminology and Special Types of Graphs

10.2 Graph Terminology and Special Types of Graphs 10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the

More information

6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page.

6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page. 6045J/18400J: Automt, Computbility nd Complexity Mrh 30, 2005 Quiz 2: Solutions Prof Nny Lynh Vinod Vikuntnthn Plese write your nme in the upper orner of eh pge Problem Sore 1 2 3 4 5 6 Totl Q2-1 Problem

More information

[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116 [Prksh* et l 58: ugust 6] ISSN: 77-9655 I Vlue: Impt Ftor: 6 IJESRT INTERNTIONL JOURNL OF ENGINEERING SIENES & RESERH TEHNOLOGY SOME PROPERTIES ND THEOREM ON FUZZY SU-TRIDENT DISTNE Prveen Prksh* M Geeth

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

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

Geometrical reasoning 1

Geometrical reasoning 1 MODULE 5 Geometril resoning 1 OBJECTIVES This module is for study y n individul teher or group of tehers. It: looks t pprohes to developing pupils visulistion nd geometril resoning skills; onsiders progression

More information

Chapter 2. Chapter 2 5. Section segments: AB, BC, BD, BE. 32. N 53 E GEOMETRY INVESTIGATION Answers will vary. 34. (a) N. sunset.

Chapter 2. Chapter 2 5. Section segments: AB, BC, BD, BE. 32. N 53 E GEOMETRY INVESTIGATION Answers will vary. 34. (a) N. sunset. Chpter 2 5 Chpter 2 32. N 53 E GEOMETRY INVESTIGATION Answers will vry. 34. () N Setion 2.1 2. 4 segments: AB, BC, BD, BE sunset sunrise 4. 2 rys: CD (or CE ), CB (or CA ) 6. ED, EC, EB W Oslo, Norwy E

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

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved. Chpter 9 Greey Tehnique Copyright 2007 Person Aison-Wesley. All rights reserve. Greey Tehnique Construts solution to n optimiztion prolem piee y piee through sequene of hoies tht re: fesile lolly optiml

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

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

CS553 Lecture Introduction to Data-flow Analysis 1

CS553 Lecture Introduction to Data-flow Analysis 1 ! Ide Introdution to Dt-flow nlysis!lst Time! Implementing Mrk nd Sweep GC!Tody! Control flow grphs! Liveness nlysis! Register llotion CS553 Leture Introdution to Dt-flow Anlysis 1 Dt-flow Anlysis! Dt-flow

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

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

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

Final Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book

Final Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book inl xm Review 06 M 236 e sure to loo over ll of your tests, s well s over the tivities you did in the tivity oo 1 1. ind the mesures of the numered ngles nd justify your wor. Line j is prllel to line.

More information

Width and Bounding Box of Imprecise Points

Width and Bounding Box of Imprecise Points Width nd Bounding Box of Impreise Points Vhideh Keikh Mrten Löffler Ali Mohdes Zhed Rhmti Astrt In this pper we study the following prolem: we re given set L = {l 1,..., l n } of prllel line segments,

More information

Functor (1A) Young Won Lim 10/5/17

Functor (1A) Young Won Lim 10/5/17 Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published

More information

Chapter Spline Method of Interpolation More Examples Electrical Engineering

Chapter Spline Method of Interpolation More Examples Electrical Engineering Chpter. Spline Method of Interpoltion More Exmples Electricl Engineering Exmple Thermistors re used to mesure the temperture of bodies. Thermistors re bsed on mterils chnge in resistnce with temperture.

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

CS201 Discussion 10 DRAWTREE + TRIES

CS201 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 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

CS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string.

CS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string. CS 340, Fll 2016 Sep 29th Exm 1 Nme: Note: in ll questions, the speil symol ɛ (epsilon) is used to indite the empty string. Question 1. [10 points] Speify regulr expression tht genertes the lnguge over

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

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

5 ANGLES AND POLYGONS

5 ANGLES AND POLYGONS 5 GLES POLYGOS urling rige looks like onventionl rige when it is extene. However, it urls up to form n otgon to llow ots through. This Rolling rige is in Pington sin in Lonon, n urls up every Friy t miy.

More information

Lecture Overview. Knowledge-based systems in Bioinformatics, 1MB602. Procedural abstraction. The sum procedure. Integration as a procedure

Lecture Overview. Knowledge-based systems in Bioinformatics, 1MB602. Procedural abstraction. The sum procedure. Integration as a procedure Lecture Overview Knowledge-bsed systems in Bioinformtics, MB6 Scheme lecture Procedurl bstrction Higher order procedures Procedures s rguments Procedures s returned vlues Locl vribles Dt bstrction Compound

More information

Math 4 Review for Quarter 2 Cumulative Test

Math 4 Review for Quarter 2 Cumulative Test Mth 4 Review for Qurter 2 Cumultive Test Nme: I. Right Tringle Trigonometry (3.1-3.3) Key Fcts Pythgoren Theorem - In right tringle, 2 + b 2 = c 2 where c is the hypotenuse s shown below. c b Trigonometric

More information

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers

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

Doubts about how to use azimuth values from a Coordinate Object. Juan Antonio Breña Moral

Doubts about how to use azimuth values from a Coordinate Object. Juan Antonio Breña Moral Douts out how to use zimuth vlues from Coordinte Ojet Jun Antonio Breñ Morl # Definition An Azimuth is the ngle from referene vetor in referene plne to seond vetor in the sme plne, pointing towrd, (ut

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

GENG2140 Modelling and Computer Analysis for Engineers

GENG2140 Modelling and Computer Analysis for Engineers GENG4 Moelling n Computer Anlysis or Engineers Letures 9 & : Gussin qurture Crete y Grn Romn Joles, PhD Shool o Mehnil Engineering, UWA GENG4 Content Deinition o Gussin qurture Computtion o weights n points

More information

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

Functor (1A) Young Won Lim 8/2/17

Functor (1A) Young Won Lim 8/2/17 Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published

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

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

Subtracting Fractions

Subtracting Fractions Lerning Enhncement Tem Model Answers: Adding nd Subtrcting Frctions Adding nd Subtrcting Frctions study guide. When the frctions both hve the sme denomintor (bottom) you cn do them using just simple dding

More information

9.1 apply the distance and midpoint formulas

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

CS453 INTRODUCTION TO DATAFLOW ANALYSIS

CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 Leture Register llotion using liveness nlysis 1 Introdution to Dt-flow nlysis Lst Time Register llotion for expression trees nd lol nd prm vrs Tody Register

More information

3.5.1 Single slit diffraction

3.5.1 Single slit diffraction 3..1 Single slit diffrction ves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. e will consider this lter. Tke

More information

UNCORRECTED SAMPLE PAGES. Angle relationships and properties of 6geometrical figures 1. Online resources. What you will learn

UNCORRECTED SAMPLE PAGES. Angle relationships and properties of 6geometrical figures 1. Online resources. What you will learn Online resoures uto-mrked hpter pre-test Video demonstrtions of ll worked exmples Intertive widgets Intertive wlkthroughs Downlodle HOTsheets ess to ll HOTmths ustrlin urriulum ourses ess to the HOTmths

More information

Introduction to Integration

Introduction to Integration Introduction to Integrtion Definite integrls of piecewise constnt functions A constnt function is function of the form Integrtion is two things t the sme time: A form of summtion. The opposite of differentition.

More information

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam Cmrige, Msshusetts Introution to Mtrois n Applitions Srikumr Rmlingm MERL mm//yy Liner Alger (,0,0) (0,,0) Liner inepenene in vetors: v, v2,..., For ll non-trivil we hve s v s v n s, s2,..., s n 2v2...

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

Suffix trees, suffix arrays, BWT

Suffix trees, suffix arrays, BWT ALGORITHMES POUR LA BIO-INFORMATIQUE ET LA VISUALISATION COURS 3 Rluc Uricru Suffix trees, suffix rrys, BWT Bsed on: Suffix trees nd suffix rrys presenttion y Him Kpln Suffix trees course y Pco Gomez Liner-Time

More information

Lesson6: Modeling the Web as a graph Unit5: Linear Algebra for graphs

Lesson6: Modeling the Web as a graph Unit5: Linear Algebra for graphs Lesson6: Modeling the We s grph Unit5: Liner Alger for grphs Rene Pikhrdt Introdution to We Siene Prt 2 Emerging We Properties Rene Pikhrdt Institute CC-BY-SA-3. for We Siene nd Tehnologies Modeling the

More information

3.5.1 Single slit diffraction

3.5.1 Single slit diffraction 3.5.1 Single slit diffrction Wves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. We will consider this lter.

More information

Area & Volume. Chapter 6.1 & 6.2 September 25, y = 1! x 2. Back to Area:

Area & 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 information

Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends

Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends Compt Drwings of 1-Plnr Grphs with Right-Angle Crossings nd Few Bends Steven Chplik, Fbin Lipp, Alexnder Wolff, nd Johnnes Zink Lehrstuhl für Informtik I, Universität Würzburg, Germny http://www1.informtik.uni-wuerzburg.de/en/stff

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

Representation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation

Representation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation Representtion of Numbers Number Representtion Computer represent ll numbers, other thn integers nd some frctions with imprecision. Numbers re stored in some pproximtion which cn be represented by fixed

More information

Review Packet #3 Notes

Review Packet #3 Notes SCIE 40, Spring 0 Miller Review Pket # Notes Mpping Nottion We use mpping nottion to note how oordinte hnges. For exmple, if the point ( ) trnsformed under mpping nottion of ( x, y) ( x, y), then it eomes

More information

Integration. October 25, 2016

Integration. 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 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

arxiv: v2 [math.ho] 4 Jun 2012

arxiv: v2 [math.ho] 4 Jun 2012 Volumes of olids of Revolution. Unified pproch Jorge Mrtín-Morles nd ntonio M. Oller-Mrcén jorge@unizr.es, oller@unizr.es rxiv:5.v [mth.ho] Jun Centro Universitrio de l Defens - IUM. cdemi Generl Militr,

More information

Topic 3: 2D Transformations 9/10/2016. Today s Topics. Transformations. Lets start out simple. Points as Homogeneous 2D Point Coords

Topic 3: 2D Transformations 9/10/2016. Today s Topics. Transformations. Lets start out simple. Points as Homogeneous 2D Point Coords Tody s Topics 3. Trnsformtions in 2D 4. Coordinte-free geometry 5. (curves & surfces) Topic 3: 2D Trnsformtions 6. Trnsformtions in 3D Simple Trnsformtions Homogeneous coordintes Homogeneous 2D trnsformtions

More information

Containers: Queue and List

Containers: Queue and List Continers: Queue n List Queue A ontiner in whih insertion is one t one en (the til) n eletion is one t the other en (the he). Also lle FIFO (First-In, First-Out) Jori Cortell n Jori Petit Deprtment of

More information

Lecture 13: Graphs I: Breadth First Search

Lecture 13: Graphs I: Breadth First Search Leture 13 Grphs I: BFS 6.006 Fll 2011 Leture 13: Grphs I: Bredth First Serh Leture Overview Applitions of Grph Serh Grph Representtions Bredth-First Serh Rell: Grph G = (V, E) V = set of verties (ritrry

More information

Introduction to Algebra

Introduction to Algebra INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh

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

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

CMPUT101 Introduction to Computing - Summer 2002

CMPUT101 Introduction to Computing - Summer 2002 CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,

More information

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V) Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from

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

TRIANGLE. The sides of a triangle (any type of triangle) are proportional to the sines of the angle opposite to them in triangle.

TRIANGLE. The sides of a triangle (any type of triangle) are proportional to the sines of the angle opposite to them in triangle. 19. SOLUTIONS OF TRINGLE 1. INTRODUTION In ny tringle, the side, opposite to the ngle is denoted by ; the side nd, opposite to the ngles nd respetively re denoted by b nd respetively. The semi-perimeter

More information

Solids. Solids. Curriculum Ready.

Solids. Solids. Curriculum Ready. Curriulum Rey www.mthletis.om This ooklet is ll out ientifying, rwing n mesuring solis n prisms. SOM CUES The Som Cue ws invente y Dnish sientist who went y the nme of Piet Hein. It is simple 3 # 3 #

More information

Math 142, Exam 1 Information.

Math 142, Exam 1 Information. Mth 14, Exm 1 Informtion. 9/14/10, LC 41, 9:30-10:45. Exm 1 will be bsed on: Sections 7.1-7.5. The corresponding ssigned homework problems (see http://www.mth.sc.edu/ boyln/sccourses/14f10/14.html) At

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

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

Information Retrieval and Organisation

Information Retrieval and Organisation Informtion Retrievl nd Orgnistion Suffix Trees dpted from http://www.mth.tu.c.il/~himk/seminr02/suffixtrees.ppt Dell Zhng Birkeck, University of London Trie A tree representing set of strings { } eef d

More information

arxiv:math/ v2 [math.co] 28 Feb 2006

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

Review Packet #3 Notes

Review Packet #3 Notes SCIE 40, Fll 05 Miller Review Pket # Notes Prllel Lines If two prllel lines re onneted y third line (lled the trnsversl), the resulting ngles re either ongruent or supplementry. Angle pirs re nmed s follows:

More information

Product of polynomials. Introduction to Programming (in C++) Numerical algorithms. Product of polynomials. Product of polynomials

Product of polynomials. Introduction to Programming (in C++) Numerical algorithms. Product of polynomials. Product of polynomials Product of polynomils Introduction to Progrmming (in C++) Numericl lgorithms Jordi Cortdell, Ricrd Gvldà, Fernndo Orejs Dept. of Computer Science, UPC Given two polynomils on one vrile nd rel coefficients,

More information

Cameras. Importance of camera models

Cameras. Importance of camera models pture imges mesuring devie Digitl mers mers fill in memor ith olor-smple informtion D hrge-oupled Devie insted of film film lso hs finite resolution grininess depends on speed IS 00 00 6400 sie 35mm IMAX

More information

Solving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence Winter 2016

Solving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence Winter 2016 Solving Prolems y Serching CS 486/686: Introduction to Artificil Intelligence Winter 2016 1 Introduction Serch ws one of the first topics studied in AI - Newell nd Simon (1961) Generl Prolem Solver Centrl

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

Chapter 2. 3/28/2004 H133 Spring

Chapter 2. 3/28/2004 H133 Spring Chpter 2 Newton believe tht light ws me up of smll prticles. This point ws ebte by scientists for mny yers n it ws not until the 1800 s when series of experiments emonstrte wve nture of light. (But be

More information

Lecture 8: Graph-theoretic problems (again)

Lecture 8: Graph-theoretic problems (again) COMP36111: Advned Algorithms I Leture 8: Grph-theoreti prolems (gin) In Prtt-Hrtmnn Room KB2.38: emil: iprtt@s.mn..uk 2017 18 Reding for this leture: Sipser: Chpter 7. A grph is pir G = (V, E), where V

More information

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE 3.1 Scheimpflug Configurtion nd Perspective Distortion Scheimpflug criterion were found out to be the best lyout configurtion for Stereoscopic PIV, becuse

More information

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

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

4.3 Balanced Trees. let us assume that we can manipulate them conveniently and see how they can be put together to form trees.

4.3 Balanced Trees. let us assume that we can manipulate them conveniently and see how they can be put together to form trees. 428 T FOU 4.3 Blned Trees T BT GOIT IN T VIOU setion work well for wide vriety of pplitions, ut they hve poor worst-se performne. s we hve noted, files lredy in order, files in reverse order, files with

More information

Tiling Triangular Meshes

Tiling Triangular Meshes Tiling Tringulr Meshes Ming-Yee Iu EPFL I&C 1 Introdution Astrt When modelling lrge grphis senes, rtists re not epeted to model minute nd repetitive fetures suh s grss or snd with individul piees of geometry

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

Computational geometry

Computational geometry Leture 23 Computtionl geometry Supplementl reding in CLRS: Chpter 33 exept 33.3 There re mny importnt prolems in whih the reltionships we wish to nlyze hve geometri struture. For exmple, omputtionl geometry

More information

12/9/14. CS151 Fall 20124Lecture (almost there) 12/6. Graphs. Seven Bridges of Königsberg. Leonard Euler

12/9/14. CS151 Fall 20124Lecture (almost there) 12/6. Graphs. Seven Bridges of Königsberg. Leonard Euler CS5 Fll 04Leture (lmost there) /6 Seven Bridges of Königserg Grphs Prof. Tny Berger-Wolf Leonrd Euler 707-783 Is it possile to wlk with route tht rosses eh ridge e Seven Bridges of Königserg Forget unimportnt

More information