Extremal Configurations of Polygonal Linkages

Size: px
Start display at page:

Download "Extremal Configurations of Polygonal Linkages"

Transcription

1 Extremal Configurations of Polygonal Linkages Dirk Siersma Department of Mathematics University of Utrecht Singularity Conference Bruce 60, Wall 75 Liverpool, June 18-22, 2012

2 Outline Introduction Planar case Properties of moduli spaces Signed Area Morse theory Three Dimensional case Signed volume Topological Morse Function Joint work with G. Khimshiashvili, G. Panina, A. Zhukova

3 Introduction We consider in the plane R 2 and in space R 3 polygonal linkages and (robot) arms. constructed from edges in R d of fixed length L = (l 1,, l n ) which are connected as an open chain or as a polygon. At the vertices we allow movements. We will study several functions on the (moduli) spaces of out objects, e.g: Length of diagonals Area or Volume of a region generated by our objects. Especially we look for geometric criteria for critical points and their Morse types.

4 Moduli spaces We use a set of vectors p 1,, p n, where each vector describes the oriented edge between one vertex and its successor. We get a set of points in S d 1 S d 1. In the case of a linkage we add the relation p p n = 0 We work moduli diagonal SO d -action. The resulting moduli spaces we denote by: A(L) in the arm case M(L) in the linkage case

5 Smoothness; planar case Fix the starting point and direction of the first edge. Proposition A(L) = (S 1 ) n 1, smooth! M(L) is generically a smooth compact n 3-dimensional manifold.

6 For the proof of the second item we consider the function: h : A(L) R defined by the squared length of the connecting vector: h = (p p n ) 2. Statement: The critical points of h are the zero set of h all direction vectors p i are dependent. The Morse index of a linkage L at the critical point is one less than the number of Forward edges. Conclusion: For any non-zero value of h: Fix the connecting edge with the corresponding length and we get the moduli space of a closed linkage. This space is smooth exactly when the edges are not collinear.

7 Linkage examples 4-gons Pentagons Singular examples

8 Signed Area definition For a polygon with the ordered vertices (x 1, y 1 ),, (x n, y n ) we define its signed area by: A = x 1 y 1 x 2 y 2 + x 2 x 3 y 2 y x n 1 x n y n 1 y n + x n x 1 y n y 1 We consider A as function on the moduli spaces: Proposition A : M(L) R is critical in P P is a cyclic polygon,. A : A(L) R is critical in R R is a diacyclic arm..

9 Permutation of edges Lemma If two linkages differ a permutation of the length vector then their critical point theories coincide. (locally a reflection in a miror)

10 Notations for cyclic configurations 2α i = P i OP i+1. ε i = +1if O is left of P i P i+1 ; ε i = 1if O is right of P i P i+1. e(p) is the number of ε i = 1 δ(p) = ε i tan α i d(p) = sign δ(p) ω P winding number of P Hess P (A) Hessian matrix of A at P. H P = ±1 sign of determinant of Hess P (A). µ P = µ P (A) Morse index of A O center of circle.

11 Morse indices Theorem For a generic linkage or arm A is a Morse function; Linkage: m(p) = e(p) 1 2ω(P) if d(p) > 0 m(p) = e(p) 2 2ω(P) otherwise Arms: m(r) = e(r) + 1 2ω(R) if d(r) > 0 m(r) = e(r) 2ω(R) otherwise. NB. Morse index not only combinatoric. As start of a proof one can show: Lemma If e(p) = 0 then m(p) = 2ω(P) 2 If e(p) = n then m(p) = n 1 2ω(P)

12 Morse indices Theorem For a generic linkage or arm A is a Morse function; Linkage: m(p) = e(p) 1 2ω(P) if d(p) > 0 m(p) = e(p) 2 2ω(P) otherwise Arms: m(r) = e(r) + 1 2ω(R) if d(r) > 0 m(r) = e(r) 2ω(R) otherwise. NB. Morse index not only combinatoric. As start of a proof one can show: Lemma If e(p) = 0 then m(p) = 2ω(P) 2 If e(p) = n then m(p) = n 1 2ω(P)

13 Morse indices Theorem For a generic linkage or arm A is a Morse function; Linkage: m(p) = e(p) 1 2ω(P) if d(p) > 0 m(p) = e(p) 2 2ω(P) otherwise Arms: m(r) = e(r) + 1 2ω(R) if d(r) > 0 m(r) = e(r) 2ω(R) otherwise. NB. Morse index not only combinatoric. As start of a proof one can show: Lemma If e(p) = 0 then m(p) = 2ω(P) 2 If e(p) = n then m(p) = n 1 2ω(P)

14 about δ Linkage in circular situation: formula relating length vector and radius: F k (r) = ε i arcsin l i 2r πk = 0 Its derivative is: 1 2r εi tan α i = 1 2r δ(p) Genericity of F k (r) = 0 is equivalent to δ(p) 0.. Cerf s principle: Index constant if no collision of Morse points in a family. Generic colision: Index changes with ±1. Collission means two cyclic configurations come together, so F k (r) = 0 must have a dubble root in r.

15 about δ Linkage in circular situation: formula relating length vector and radius: F k (r) = ε i arcsin l i 2r πk = 0 Its derivative is: 1 2r εi tan α i = 1 2r δ(p) Genericity of F k (r) = 0 is equivalent to δ(p) 0.. Cerf s principle: Index constant if no collision of Morse points in a family. Generic colision: Index changes with ±1. Collission means two cyclic configurations come together, so F k (r) = 0 must have a dubble root in r.

16 About the proof Hessian matrix can be brought into tri-diagonal form. Not clear how to show index formula from that. Stategy: Fix radius and move (l 1,, l n ) to a convex situation. Lemma H(P) = d(p)( 1) e(p)+1 Proof. Take a well choosen transversal path to the generic case. The formula is true in de convex case. Show next that H(P) 1 d(p)( 1) e(p)+1 does not change sign. There are 3 cases to consider: passage through δ = 0 : Cerf principle H(P) changes sign passage through circle center: e and d change sign flip H and e change sign (explicit computation) So we know the Morse index mod 2.

17 About the proof Hessian matrix can be brought into tri-diagonal form. Not clear how to show index formula from that. Stategy: Fix radius and move (l 1,, l n ) to a convex situation. Lemma H(P) = d(p)( 1) e(p)+1 Proof. Take a well choosen transversal path to the generic case. The formula is true in de convex case. Show next that H(P) 1 d(p)( 1) e(p)+1 does not change sign. There are 3 cases to consider: passage through δ = 0 : Cerf principle H(P) changes sign passage through circle center: e and d change sign flip H and e change sign (explicit computation) So we know the Morse index mod 2.

18 About the proof Hessian matrix can be brought into tri-diagonal form. Not clear how to show index formula from that. Stategy: Fix radius and move (l 1,, l n ) to a convex situation. Lemma H(P) = d(p)( 1) e(p)+1 Proof. Take a well choosen transversal path to the generic case. The formula is true in de convex case. Show next that H(P) 1 d(p)( 1) e(p)+1 does not change sign. There are 3 cases to consider: passage through δ = 0 : Cerf principle H(P) changes sign passage through circle center: e and d change sign flip H and e change sign (explicit computation) So we know the Morse index mod 2.

19 About the proof Hessian matrix can be brought into tri-diagonal form. Not clear how to show index formula from that. Stategy: Fix radius and move (l 1,, l n ) to a convex situation. Lemma H(P) = d(p)( 1) e(p)+1 Proof. Take a well choosen transversal path to the generic case. The formula is true in de convex case. Show next that H(P) 1 d(p)( 1) e(p)+1 does not change sign. There are 3 cases to consider: passage through δ = 0 : Cerf principle H(P) changes sign passage through circle center: e and d change sign flip H and e change sign (explicit computation) So we know the Morse index mod 2.

20 Arms in R 3 How to relate a volume to a n-arm in R 3? The following picture where all simplices contain a = b 1 illustrates the below definition.

21 A signed volume Definition Let an n-arm be given by the vectors b 1,, b n. The vertices are O, B 1,, B n. We fix b 1 = a (as before). We denote c k = k i=1 b i (the endpoint of this vector is B k ). The signed volume function is defined as which can be rewritten as: n 1 V = [b 1, c k, c k+1 ], k=1 V = [b 1, b 2, b 3 ]+[b 1, b 2 +b 3, b 4 ]+[b 1, b 2 +b 3 +b 4, b 5 ]+ [b 1, b 2 + b n N.B. Note that this signed volume is essentially the signed area of the projection onto the plane orthogonal to b 1. N.B. V is defined on the parameter space (S 2 ) n 1

22 3 arm in R 3 Proposition The signed area V : S 2 S 2 R has the following critical points: Tri-orthogonal arms (maximum, resp minimum). These are Bott-Morse critical points with transversal index 3 and critical value ± a b c. Isolated points, corresponding to the aligned configurations. Here V has Morse index 2 and the critical value 0. NB. S 2 S 2 is not the moduli space of 3 arms.

23 3 arm in R 3 Proposition The signed area V : S 2 S 2 R has the following critical points: Tri-orthogonal arms (maximum, resp minimum). These are Bott-Morse critical points with transversal index 3 and critical value ± a b c. Isolated points, corresponding to the aligned configurations. Here V has Morse index 2 and the critical value 0. NB. S 2 S 2 is not the moduli space of 3 arms.

24 permutation of arms Lemma Let two arms differ on a permutation of the arms 2,..., n. Then there exits a bijection (by mirror-symmetry ) between their "moduli spaces" which preserves the signed volume function. Consequently this bijection preserves critical points and their local (Morse) types.

25 Theorem The critical points of V up to "mirror-symmetry" are as follows There exits a division of the n-arm into a subarm b 1, a subarm b 2,..., b k and a subarm b k+1,..., b n such that: b 1 is orthogonal to each of b 2,..., b k (which lie in a plane Rb1 ). The vertices of the arm b 2,..., b k lie on a circle, satisfying the closing condition if n k = odd, the diameter condition if n k = even. The arm b k+1,..., b n is a zigzag, which projects orthogonally to the diameter of the circle. special cases

26 Theorem The critical points of V up to "mirror-symmetry" are as follows There exits a division of the n-arm into a subarm b 1, a subarm b 2,..., b k and a subarm b k+1,..., b n such that: b 1 is orthogonal to each of b 2,..., b k (which lie in a plane Rb1 ). The vertices of the arm b 2,..., b k lie on a circle, satisfying the closing condition if n k = odd, the diameter condition if n k = even. The arm b k+1,..., b n is a zigzag, which projects orthogonally to the diameter of the circle. special cases

27 Projection on planes Take a generic plane and consider the signed area PA of the projected arm on this plane. Theorem The critical points of PA up to "mirror-symmetry" are as follows: There exits a division into two subarms b 1,..., b k and b k+1,..., b n, such that: The vertices of the arm b 1, b 2,..., b k lie on a circle in the projection plane, satisfying the closing condition if n k = odd, the diameter condition if n k = even. The arm b k+1,..., b n is a zigzag, which projects orthogonally to the diameter of the circle. Remark: Similar theorem exists for closed linkages.

28 Projection on planes Take a generic plane and consider the signed area PA of the projected arm on this plane. Theorem The critical points of PA up to "mirror-symmetry" are as follows: There exits a division into two subarms b 1,..., b k and b k+1,..., b n, such that: The vertices of the arm b 1, b 2,..., b k lie on a circle in the projection plane, satisfying the closing condition if n k = odd, the diameter condition if n k = even. The arm b k+1,..., b n is a zigzag, which projects orthogonally to the diameter of the circle. Remark: Similar theorem exists for closed linkages.

29 Projection on planes Take a generic plane and consider the signed area PA of the projected arm on this plane. Theorem The critical points of PA up to "mirror-symmetry" are as follows: There exits a division into two subarms b 1,..., b k and b k+1,..., b n, such that: The vertices of the arm b 1, b 2,..., b k lie on a circle in the projection plane, satisfying the closing condition if n k = odd, the diameter condition if n k = even. The arm b k+1,..., b n is a zigzag, which projects orthogonally to the diameter of the circle. Remark: Similar theorem exists for closed linkages.

30 Zigzags. Planar 5 gons. Spatial 5 gons.

31 Exact Morse function for a 3-arm Study the moduli space of n-arms in R n b using the Gram matrix: there is a directy relation with the volume. Given a set of vectors, the Gram matrix G is the matrix of all possible inner products. Let B be the matrix whose columns are the arm vectors b 1,..., b n. Gram matrix:. G = B t B det G = (V ) 2. The Gram matrix is always a positive semi definite symmetric matrix. If G is positive definite it determines the vectors up to isometry (no orientation involved). But not every positive semi definite matrix S (with det S= 0) is a Gram matrix.

32 We consider the 3 dimensional case: a 2 z y det G = z b 2 x y x c 2 = 2xyz a2 x 2 b 2 y 2 c 2 z 2 + a 2 b 2 c 2 = 0 The compact component corresponds to Gram matrices. Figure: Zero locus of the determinant of G. (SINGULAR software.)

33 Proposition The closure of the compact component of G 1 (0, a 2 b 2 c 2 ) is a topological 3-ball. Its boundary is a topological 2-sphere (differentiable outside 4 critical points). Proof. Since we have det G = V 2, the both functions have the same level curves on the domain of common definition. There is one maximum and no other critical points in the interior. Near critical points on G = 0 we have local topological triviality. The above proposition tells that the (unoriented) moduli space of 3-arm is a topological ball. By gluing two copies of the ball along the common boundary we get: Theorem The oriented moduli space of 3-arms in R 3 is a 3-sphere. V is an exact topological Morse function on this space with precisely two Morse critical points.

34 Proposition The closure of the compact component of G 1 (0, a 2 b 2 c 2 ) is a topological 3-ball. Its boundary is a topological 2-sphere (differentiable outside 4 critical points). Proof. Since we have det G = V 2, the both functions have the same level curves on the domain of common definition. There is one maximum and no other critical points in the interior. Near critical points on G = 0 we have local topological triviality. The above proposition tells that the (unoriented) moduli space of 3-arm is a topological ball. By gluing two copies of the ball along the common boundary we get: Theorem The oriented moduli space of 3-arms in R 3 is a 3-sphere. V is an exact topological Morse function on this space with precisely two Morse critical points.

35 References Gibson C., Newstead P., On the geometry of the planar 4-bar mechanism. Acta Appl. Math., 1986, 7, 23, Kapovich M., Millson J., On the moduli space of polygons in the Euclidean plane. J. Differential Geom. Volume 42, Number 1 (1995), Khimshiashvili G., Panina G., Cyclic polygons are critical points of area. Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI), 2008, 360, 8, Khimshiashvili G., Panina G., Siersma D., Zhukova A., Extremal Configurations of Polygonal Linkages, Oberwolfach Preprint, Khimshiashvili G., Panina G., Siersma D., Zhukova A., Critical Configurations of Planar Robot Arms,To appear in Cent. Eur. J. Math., (2012). Panina G., Zhukova A.,Morse index of a cyclic polygon,cent. Eur. J. Math., 9(2) (2011),

36 Proof for diagonal

37 Proof for linkages

38 Proof for arms

39 4gon Moduli space is a circle; in other case (one big arm) two seperate circles.

40 singular example more precise

41 singular example

42 M-example m(p) = e(p) 1 2ω(P) if d(p) > 0 m(p) = e(p) 2 2ω(P) otherwise

43 flip m(p) = e(p) 1 2ω(P) if d(p) > 0 m(p) = e(p) 2 2ω(P) otherwise

44 graph of r

45 Pentagons

46 Critical Arms Solutions in the general case

47 Critical Arms special pictures

48 Critical Arms the first edge is the projection direction

49 Zigzags

50 critical Planar 5-gons

51 critical Spatial 5-gons

Tripod Configurations

Tripod Configurations Tripod Configurations Eric Chen, Nick Lourie, Nakul Luthra Summer@ICERM 2013 August 8, 2013 Eric Chen, Nick Lourie, Nakul Luthra (S@I) Tripod Configurations August 8, 2013 1 / 33 Overview 1 Introduction

More information

Lecture 0: Reivew of some basic material

Lecture 0: Reivew of some basic material Lecture 0: Reivew of some basic material September 12, 2018 1 Background material on the homotopy category We begin with the topological category TOP, whose objects are topological spaces and whose morphisms

More information

pα i + q, where (n, m, p and q depend on i). 6. GROMOV S INVARIANT AND THE VOLUME OF A HYPERBOLIC MANIFOLD

pα i + q, where (n, m, p and q depend on i). 6. GROMOV S INVARIANT AND THE VOLUME OF A HYPERBOLIC MANIFOLD 6. GROMOV S INVARIANT AND THE VOLUME OF A HYPERBOLIC MANIFOLD of π 1 (M 2 )onπ 1 (M 4 ) by conjugation. π 1 (M 4 ) has a trivial center, so in other words the action of π 1 (M 4 ) on itself is effective.

More information

PERFECT FOLDING OF THE PLANE

PERFECT FOLDING OF THE PLANE SOOCHOW JOURNAL OF MATHEMATICS Volume 32, No. 4, pp. 521-532, October 2006 PERFECT FOLDING OF THE PLANE BY E. EL-KHOLY, M. BASHER AND M. ZEEN EL-DEEN Abstract. In this paper we introduced the concept of

More information

The equal tangents property

The equal tangents property The equal tangents property J. Jerónimo-Castro, G. Ruiz-Hernández and S. Tabachnikov April 29, 2012 Abstract Let M be a C 2 -smooth strictly convex closed surface in R 3 and denote by H the set of points

More information

Teichmüller Space and Fenchel-Nielsen Coordinates

Teichmüller Space and Fenchel-Nielsen Coordinates Teichmüller Space and Fenchel-Nielsen Coordinates Nathan Lopez November 30, 2015 Abstract Here we give an overview of Teichmüller space and its realization as a smooth manifold through Fenchel- Nielsen

More information

Motion Planning for a Class of Planar Closed-Chain Manipulators

Motion Planning for a Class of Planar Closed-Chain Manipulators Motion Planning for a Class of Planar Closed-Chain Manipulators Guanfeng Liu Department of Computer Science Stanford University Stanford, CA Email:liugf@cs.stanford.edu J.C. Trinkle Department of Computer

More information

5. THE ISOPERIMETRIC PROBLEM

5. THE ISOPERIMETRIC PROBLEM Math 501 - Differential Geometry Herman Gluck March 1, 2012 5. THE ISOPERIMETRIC PROBLEM Theorem. Let C be a simple closed curve in the plane with length L and bounding a region of area A. Then L 2 4 A,

More information

On the Number of Tilings of a Square by Rectangles

On the Number of Tilings of a Square by Rectangles University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange University of Tennessee Honors Thesis Projects University of Tennessee Honors Program 5-2012 On the Number of Tilings

More information

Glossary of dictionary terms in the AP geometry units

Glossary of dictionary terms in the AP geometry units Glossary of dictionary terms in the AP geometry units affine linear equation: an equation in which both sides are sums of terms that are either a number times y or a number times x or just a number [SlL2-D5]

More information

arxiv: v2 [math.gt] 27 Feb 2014

arxiv: v2 [math.gt] 27 Feb 2014 SIMPLE GAME INDUCED MANIFOLDS PAVEL GALASHIN 1 AND GAIANE PANINA 2 arxiv:1311.6966v2 [math.gt] 27 Feb 2014 Abstract. Starting by a simple game Q as a combinatorial data, we build up a cell complex M(Q),

More information

Orientation of manifolds - definition*

Orientation of manifolds - definition* Bulletin of the Manifold Atlas - definition (2013) Orientation of manifolds - definition* MATTHIAS KRECK 1. Zero dimensional manifolds For zero dimensional manifolds an orientation is a map from the manifold

More information

arxiv: v2 [math.gr] 12 Jul 2016

arxiv: v2 [math.gr] 12 Jul 2016 CAT(-1) metrics on small cancellation groups Samuel Brown July 13, 2016 arxiv:1607.02580v2 [math.gr] 12 Jul 2016 Abstract We give an explicit proof that groups satisfying a uniform C (1/6) small cancellation

More information

The Farey Tessellation

The Farey Tessellation The Farey Tessellation Seminar: Geometric Structures on manifolds Mareike Pfeil supervised by Dr. Gye-Seon Lee 15.12.2015 Introduction In this paper, we are going to introduce the Farey tessellation. Since

More information

Curriki Geometry Glossary

Curriki Geometry Glossary Curriki Geometry Glossary The following terms are used throughout the Curriki Geometry projects and represent the core vocabulary and concepts that students should know to meet Common Core State Standards.

More information

Minicourse II Symplectic Monte Carlo Methods for Random Equilateral Polygons

Minicourse II Symplectic Monte Carlo Methods for Random Equilateral Polygons Minicourse II Symplectic Monte Carlo Methods for Random Equilateral Polygons Jason Cantarella and Clayton Shonkwiler University of Georgia Georgia Topology Conference July 9, 2013 Basic Definitions Symplectic

More information

The Graphs of Triangulations of Polygons

The Graphs of Triangulations of Polygons The Graphs of Triangulations of Polygons Matthew O Meara Research Experience for Undergraduates Summer 006 Basic Considerations Let Γ(n) be the graph with vertices being the labeled planar triangulation

More information

Acute Triangulations of Polygons

Acute Triangulations of Polygons Europ. J. Combinatorics (2002) 23, 45 55 doi:10.1006/eujc.2001.0531 Available online at http://www.idealibrary.com on Acute Triangulations of Polygons H. MAEHARA We prove that every n-gon can be triangulated

More information

Mirror Symmetry Through Reflexive Polytopes

Mirror Symmetry Through Reflexive Polytopes Mirror Symmetry Through Reflexive Polytopes Physical and Mathematical Dualities Ursula Whitcher Harvey Mudd College April 2010 Outline String Theory and Mirror Symmetry Some Complex Geometry Reflexive

More information

Non-extendible finite polycycles

Non-extendible finite polycycles Izvestiya: Mathematics 70:3 1 18 Izvestiya RAN : Ser. Mat. 70:3 3 22 c 2006 RAS(DoM) and LMS DOI 10.1070/IM2006v170n01ABEH002301 Non-extendible finite polycycles M. Deza, S. V. Shpectorov, M. I. Shtogrin

More information

Three applications of Euler s formula. Chapter 10

Three applications of Euler s formula. Chapter 10 Three applications of Euler s formula Chapter 10 A graph is planar if it can be drawn in the plane R without crossing edges (or, equivalently, on the -dimensional sphere S ). We talk of a plane graph if

More information

A Flavor of Topology. Shireen Elhabian and Aly A. Farag University of Louisville January 2010

A Flavor of Topology. Shireen Elhabian and Aly A. Farag University of Louisville January 2010 A Flavor of Topology Shireen Elhabian and Aly A. Farag University of Louisville January 2010 In 1670 s I believe that we need another analysis properly geometric or linear, which treats place directly

More information

274 Curves on Surfaces, Lecture 5

274 Curves on Surfaces, Lecture 5 274 Curves on Surfaces, Lecture 5 Dylan Thurston Notes by Qiaochu Yuan Fall 2012 5 Ideal polygons Previously we discussed three models of the hyperbolic plane: the Poincaré disk, the upper half-plane,

More information

SPERNER S LEMMA MOOR XU

SPERNER S LEMMA MOOR XU SPERNER S LEMMA MOOR XU Abstract. Is it possible to dissect a square into an odd number of triangles of equal area? This question was first answered by Paul Monsky in 970, and the solution requires elements

More information

Distance Trisector Curves in Regular Convex Distance Metrics

Distance Trisector Curves in Regular Convex Distance Metrics Distance Trisector Curves in Regular Convex Distance Metrics Tetsuo sano School of Information Science JIST 1-1 sahidai, Nomi, Ishikawa, 923-1292 Japan t-asano@jaist.ac.jp David Kirkpatrick Department

More information

EXTREME POINTS AND AFFINE EQUIVALENCE

EXTREME POINTS AND AFFINE EQUIVALENCE EXTREME POINTS AND AFFINE EQUIVALENCE The purpose of this note is to use the notions of extreme points and affine transformations which are studied in the file affine-convex.pdf to prove that certain standard

More information

Moore Catholic High School Math Department

Moore Catholic High School Math Department Moore Catholic High School Math Department Geometry Vocabulary The following is a list of terms and properties which are necessary for success in a Geometry class. You will be tested on these terms during

More information

arxiv: v1 [math.co] 4 Sep 2017

arxiv: v1 [math.co] 4 Sep 2017 Abstract Maximal chord diagrams up to all isomorphisms are enumerated. The enumerating formula is based on a bijection between rooted one-vertex one-face maps on locally orientable surfaces andacertain

More information

Geometric structures on manifolds

Geometric structures on manifolds CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory

More information

Cannon s conjecture, subdivision rules, and expansion complexes

Cannon s conjecture, subdivision rules, and expansion complexes Cannon s conjecture, subdivision rules, and expansion complexes W. Floyd (joint work with J. Cannon and W. Parry) Department of Mathematics Virginia Tech UNC Greensboro: November, 2014 Motivation from

More information

1 Euler characteristics

1 Euler characteristics Tutorials: MA342: Tutorial Problems 2014-15 Tuesday, 1-2pm, Venue = AC214 Wednesday, 2-3pm, Venue = AC201 Tutor: Adib Makroon 1 Euler characteristics 1. Draw a graph on a sphere S 2 PROBLEMS in such a

More information

Pick s Theorem and Lattice Point Geometry

Pick s Theorem and Lattice Point Geometry Pick s Theorem and Lattice Point Geometry 1 Lattice Polygon Area Calculations Lattice points are points with integer coordinates in the x, y-plane. A lattice line segment is a line segment that has 2 distinct

More information

Geometry Vocabulary Math Fundamentals Reference Sheet Page 1

Geometry Vocabulary Math Fundamentals Reference Sheet Page 1 Math Fundamentals Reference Sheet Page 1 Acute Angle An angle whose measure is between 0 and 90 Acute Triangle A that has all acute Adjacent Alternate Interior Angle Two coplanar with a common vertex and

More information

Automorphism Groups of Cyclic Polytopes

Automorphism Groups of Cyclic Polytopes 8 Automorphism Groups of Cyclic Polytopes (Volker Kaibel and Arnold Waßmer ) It is probably well-known to most polytope theorists that the combinatorial automorphism group of a cyclic d-polytope with n

More information

Genus Ranges of 4-Regular Rigid Vertex Graphs

Genus Ranges of 4-Regular Rigid Vertex Graphs Genus Ranges of 4-Regular Rigid Vertex Graphs Dorothy Buck Department of Mathematics Imperial College London London, England, UK d.buck@imperial.ac.uk Nataša Jonoska Egor Dolzhenko Molecular and Computational

More information

Rigid Ball-Polyhedra in Euclidean 3-Space

Rigid Ball-Polyhedra in Euclidean 3-Space Discrete Comput Geom (2013) 49:189 199 DOI 10.1007/s00454-012-9480-y Rigid Ball-Polyhedra in Euclidean 3-Space Károly Bezdek Márton Naszódi Received: 15 September 2011 / Revised: 30 September 2012 / Accepted:

More information

Restricted-Orientation Convexity in Higher-Dimensional Spaces

Restricted-Orientation Convexity in Higher-Dimensional Spaces Restricted-Orientation Convexity in Higher-Dimensional Spaces ABSTRACT Eugene Fink Derick Wood University of Waterloo, Waterloo, Ont, Canada N2L3G1 {efink, dwood}@violetwaterlooedu A restricted-oriented

More information

Suggested List of Mathematical Language. Geometry

Suggested List of Mathematical Language. Geometry Suggested List of Mathematical Language Geometry Problem Solving A additive property of equality algorithm apply constraints construct discover explore generalization inductive reasoning parameters reason

More information

Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder]

Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder] Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder] Preliminaries Recall: Given a smooth function f:r R, the function

More information

Geometric structures on manifolds

Geometric structures on manifolds CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory

More information

Combinatorial Tilings of the Sphere by Pentagons

Combinatorial Tilings of the Sphere by Pentagons Combinatorial Tilings of the Sphere by Pentagons Min Yan Department of Mathematics Hong Kong University of Science and Technology Kowloon, Hong Kong mamyan@ust.hk Submitted: Nov 16, 2012; Accepted: Mar

More information

Understand the concept of volume M.TE Build solids with unit cubes and state their volumes.

Understand the concept of volume M.TE Build solids with unit cubes and state their volumes. Strand II: Geometry and Measurement Standard 1: Shape and Shape Relationships - Students develop spatial sense, use shape as an analytic and descriptive tool, identify characteristics and define shapes,

More information

751 Problem Set I JWR. Due Sep 28, 2004

751 Problem Set I JWR. Due Sep 28, 2004 751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path

More information

Lecture notes for Topology MMA100

Lecture notes for Topology MMA100 Lecture notes for Topology MMA100 J A S, S-11 1 Simplicial Complexes 1.1 Affine independence A collection of points v 0, v 1,..., v n in some Euclidean space R N are affinely independent if the (affine

More information

The orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P.

The orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P. Title Author(s) The orientability of small covers and coloring simple polytopes Nishimura, Yasuzo; Nakayama, Hisashi Citation Osaka Journal of Mathematics. 42(1) P.243-P.256 Issue Date 2005-03 Text Version

More information

Mathematical Research Letters 1, (1994) MÖBIUS CONE STRUCTURES ON 3-DIMENSIONAL MANIFOLDS. Feng Luo

Mathematical Research Letters 1, (1994) MÖBIUS CONE STRUCTURES ON 3-DIMENSIONAL MANIFOLDS. Feng Luo Mathematical Research Letters 1, 257 261 (1994) MÖBIUS CONE STRUCTURES ON 3-DIMENSIONAL MANIFOLDS Feng Luo Abstract. We show that for any given angle α (0, 2π), any closed 3- manifold has a Möbius cone

More information

Lecture 3A: Generalized associahedra

Lecture 3A: Generalized associahedra Lecture 3A: Generalized associahedra Nathan Reading NC State University Cluster Algebras and Cluster Combinatorics MSRI Summer Graduate Workshop, August 2011 Introduction Associahedron and cyclohedron

More information

Lower bounds on the barrier parameter of convex cones

Lower bounds on the barrier parameter of convex cones of convex cones Université Grenoble 1 / CNRS June 20, 2012 / High Performance Optimization 2012, Delft Outline Logarithmically homogeneous barriers 1 Logarithmically homogeneous barriers Conic optimization

More information

Topological properties of convex sets

Topological properties of convex sets Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 5: Topological properties of convex sets 5.1 Interior and closure of convex sets Let

More information

Lattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis 1 Warm-Up to Ponder

Lattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis   1 Warm-Up to Ponder Lattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis http://www.geometer.org/mathcircles/pick.pdf 1 Warm-Up to Ponder 1. Is it possible to draw an equilateral triangle on graph paper so

More information

However, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).

However, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example). 98 CHAPTER 3. PROPERTIES OF CONVEX SETS: A GLIMPSE 3.2 Separation Theorems It seems intuitively rather obvious that if A and B are two nonempty disjoint convex sets in A 2, then there is a line, H, separating

More information

acute angle An angle with a measure less than that of a right angle. Houghton Mifflin Co. 2 Grade 5 Unit 6

acute angle An angle with a measure less than that of a right angle. Houghton Mifflin Co. 2 Grade 5 Unit 6 acute angle An angle with a measure less than that of a right angle. Houghton Mifflin Co. 2 Grade 5 Unit 6 angle An angle is formed by two rays with a common end point. Houghton Mifflin Co. 3 Grade 5 Unit

More information

The Construction of a Hyperbolic 4-Manifold with a Single Cusp, Following Kolpakov and Martelli. Christopher Abram

The Construction of a Hyperbolic 4-Manifold with a Single Cusp, Following Kolpakov and Martelli. Christopher Abram The Construction of a Hyperbolic 4-Manifold with a Single Cusp, Following Kolpakov and Martelli by Christopher Abram A Thesis Presented in Partial Fulfillment of the Requirement for the Degree Master of

More information

7. The Gauss-Bonnet theorem

7. The Gauss-Bonnet theorem 7. The Gauss-Bonnet theorem 7.1 Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed

More information

GEOMETRY OF PLANAR SURFACES AND EXCEPTIONAL FILLINGS

GEOMETRY OF PLANAR SURFACES AND EXCEPTIONAL FILLINGS GEOMETRY OF PLANAR SURFACES AND EXCEPTIONAL FILLINGS NEIL R. HOFFMAN AND JESSICA S. PURCELL Abstract. If a hyperbolic 3 manifold admits an exceptional Dehn filling, then the length of the slope of that

More information

Course Number: Course Title: Geometry

Course Number: Course Title: Geometry Course Number: 1206310 Course Title: Geometry RELATED GLOSSARY TERM DEFINITIONS (89) Altitude The perpendicular distance from the top of a geometric figure to its opposite side. Angle Two rays or two line

More information

Simplicial Cells in Arrangements of Hyperplanes

Simplicial Cells in Arrangements of Hyperplanes Simplicial Cells in Arrangements of Hyperplanes Christoph Dätwyler 05.01.2013 This paper is a report written due to the authors presentation of a paper written by Shannon [1] in 1977. The presentation

More information

Area of Lattice Point Polygons. Andrejs Treibergs. Wednesday, January 16, 2019

Area of Lattice Point Polygons. Andrejs Treibergs. Wednesday, January 16, 2019 Undergraduate Colloquium: Area of Lattice Point Polygons Andrejs Treibergs University of Utah Wednesday, January 16, 2019 2. Undergraduate Colloquium Lecture on Area of Lattice Point Polygons The URL for

More information

A GEOMETRIC DESCRIPTION OF THE PSL 4 (R)-HITCHIN COMPONENT

A GEOMETRIC DESCRIPTION OF THE PSL 4 (R)-HITCHIN COMPONENT A GEOMETRIC DESCRIPTION OF THE PSL 4 (R)-HITCHIN COMPONENT SAMUEL A. BALLAS Abstract. These notes form a rough outline of the correspondence between the PSL 4 (R)- Hitchin component and convex foliated

More information

Two Connections between Combinatorial and Differential Geometry

Two Connections between Combinatorial and Differential Geometry Two Connections between Combinatorial and Differential Geometry John M. Sullivan Institut für Mathematik, Technische Universität Berlin Berlin Mathematical School DFG Research Group Polyhedral Surfaces

More information

An Investigation of Closed Geodesics on Regular Polyhedra

An Investigation of Closed Geodesics on Regular Polyhedra An Investigation of Closed Geodesics on Regular Polyhedra Tony Scoles Southern Illinois University Edwardsville May 13, 2008 1 Introduction This paper was undertaken to examine, in detail, results from

More information

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter

More information

CAT(0) BOUNDARIES OF TRUNCATED HYPERBOLIC SPACE

CAT(0) BOUNDARIES OF TRUNCATED HYPERBOLIC SPACE CAT(0) BOUNDARIES OF TRUNCATED HYPERBOLIC SPACE KIM RUANE Abstract. We prove that the CAT(0) boundary of a truncated hyperbolic space is homeomorphic to a sphere with disks removed. In dimension three,

More information

Coxeter Decompositions of Hyperbolic Polygons

Coxeter Decompositions of Hyperbolic Polygons Europ. J. Combinatorics (1998) 19, 801 817 Article No. ej980238 Coxeter Decompositions of Hyperbolic Polygons A. A. FELIKSON Let P be a polygon on hyperbolic plane H 2. A Coxeter decomposition of a polygon

More information

Pebble Sets in Convex Polygons

Pebble Sets in Convex Polygons 2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon

More information

Preferred directions for resolving the non-uniqueness of Delaunay triangulations

Preferred directions for resolving the non-uniqueness of Delaunay triangulations Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation

More information

Generating Functions for Hyperbolic Plane Tessellations

Generating Functions for Hyperbolic Plane Tessellations Generating Functions for Hyperbolic Plane Tessellations by Jiale Xie A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in

More information

4. Simplicial Complexes and Simplicial Homology

4. Simplicial Complexes and Simplicial Homology MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n

More information

WAYNESBORO AREA SCHOOL DISTRICT CURRICULUM ACCELERATED GEOMETRY (June 2014)

WAYNESBORO AREA SCHOOL DISTRICT CURRICULUM ACCELERATED GEOMETRY (June 2014) UNIT: Chapter 1 Essentials of Geometry UNIT : How do we describe and measure geometric figures? Identify Points, Lines, and Planes (1.1) How do you name geometric figures? Undefined Terms Point Line Plane

More information

Discrete minimal surfaces of Koebe type

Discrete minimal surfaces of Koebe type Discrete minimal surfaces of Koebe type Alexander I. Bobenko, Ulrike Bücking, Stefan Sechelmann March 5, 2018 1 Introduction Minimal surfaces have been studied for a long time, but still contain unsolved

More information

CUBICAL SIMPLICIAL VOLUME OF SURFACES

CUBICAL SIMPLICIAL VOLUME OF SURFACES CUBICAL SIMPLICIAL VOLUME OF SURFACES CLARA LÖH AND CHRISTIAN PLANKL ABSTRACT. Cubical simplicial volume is a variation on simplicial volume, based on cubes instead of simplices. Both invariants are homotopy

More information

CHAPTER 2 REVIEW COORDINATE GEOMETRY MATH Warm-Up: See Solved Homework questions. 2.2 Cartesian coordinate system

CHAPTER 2 REVIEW COORDINATE GEOMETRY MATH Warm-Up: See Solved Homework questions. 2.2 Cartesian coordinate system CHAPTER 2 REVIEW COORDINATE GEOMETRY MATH6 2.1 Warm-Up: See Solved Homework questions 2.2 Cartesian coordinate system Coordinate axes: Two perpendicular lines that intersect at the origin O on each line.

More information

Voronoi Diagram. Xiao-Ming Fu

Voronoi Diagram. Xiao-Ming Fu Voronoi Diagram Xiao-Ming Fu Outlines Introduction Post Office Problem Voronoi Diagram Duality: Delaunay triangulation Centroidal Voronoi tessellations (CVT) Definition Applications Algorithms Outlines

More information

Geometric approximation of curves and singularities of secant maps Ghosh, Sunayana

Geometric approximation of curves and singularities of secant maps Ghosh, Sunayana University of Groningen Geometric approximation of curves and singularities of secant maps Ghosh, Sunayana IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish

More information

Math 366 Lecture Notes Section 11.4 Geometry in Three Dimensions

Math 366 Lecture Notes Section 11.4 Geometry in Three Dimensions Math 366 Lecture Notes Section 11.4 Geometry in Three Dimensions Simple Closed Surfaces A simple closed surface has exactly one interior, no holes, and is hollow. A sphere is the set of all points at a

More information

Surface Mesh Generation

Surface Mesh Generation Surface Mesh Generation J.-F. Remacle Université catholique de Louvain September 22, 2011 0 3D Model For the description of the mesh generation process, let us consider the CAD model of a propeller presented

More information

Dynamic Collision Detection

Dynamic Collision Detection Distance Computation Between Non-Convex Polyhedra June 17, 2002 Applications Dynamic Collision Detection Applications Dynamic Collision Detection Evaluating Safety Tolerances Applications Dynamic Collision

More information

66 III Complexes. R p (r) }.

66 III Complexes. R p (r) }. 66 III Complexes III.4 Alpha Complexes In this section, we use a radius constraint to introduce a family of subcomplexes of the Delaunay complex. These complexes are similar to the Čech complexes but differ

More information

Geometry. Geometric Graphs with Few Disjoint Edges. G. Tóth 1,2 and P. Valtr 2,3. 1. Introduction

Geometry. Geometric Graphs with Few Disjoint Edges. G. Tóth 1,2 and P. Valtr 2,3. 1. Introduction Discrete Comput Geom 22:633 642 (1999) Discrete & Computational Geometry 1999 Springer-Verlag New York Inc. Geometric Graphs with Few Disjoint Edges G. Tóth 1,2 and P. Valtr 2,3 1 Courant Institute, New

More information

Lecture 7: Jan 31, Some definitions related to Simplical Complex. 7.2 Topological Equivalence and Homeomorphism

Lecture 7: Jan 31, Some definitions related to Simplical Complex. 7.2 Topological Equivalence and Homeomorphism CS 6170 Computational Topology: Topological Data Analysis University of Utah Spring 2017 School of Computing Lecture 7: Jan 31, 2017 Lecturer: Prof. Bei Wang Scribe: Avani Sharma,

More information

Elementary Planar Geometry

Elementary Planar Geometry Elementary Planar Geometry What is a geometric solid? It is the part of space occupied by a physical object. A geometric solid is separated from the surrounding space by a surface. A part of the surface

More information

Structure in Quaternions Corresponding to the 4-Dimensional Tetrahedron

Structure in Quaternions Corresponding to the 4-Dimensional Tetrahedron Structure in Quaternions Corresponding to the 4-Dimensional Tetrahedron AJ Friend School of Mathematics Georgia Institute of Technology Atlanta, GA Advised by: Adrian Ocneanu Department of Mathematics

More information

Orthogonal Ham-Sandwich Theorem in R 3

Orthogonal Ham-Sandwich Theorem in R 3 Orthogonal Ham-Sandwich Theorem in R 3 Downloaded 11/24/17 to 37.44.201.8. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php Abstract The ham-sandwich theorem

More information

Turn Graphs and Extremal Surfaces in Free Groups

Turn Graphs and Extremal Surfaces in Free Groups Turn Graphs and Extremal Surfaces in Free Groups Noel Brady, Matt Clay, and Max Forester Abstract. This note provides an alternate account of Calegari s rationality theorem for stable commutator length

More information

A Singular Example for the Averaged Mean Curvature Flow

A Singular Example for the Averaged Mean Curvature Flow To appear in Experimental Mathematics Preprint Vol. No. () pp. 3 7 February 9, A Singular Example for the Averaged Mean Curvature Flow Uwe F. Mayer Abstract An embedded curve is presented which under numerical

More information

Which n-venn diagrams can be drawn with convex k-gons?

Which n-venn diagrams can be drawn with convex k-gons? Which n-venn diagrams can be drawn with convex k-gons? Jeremy Carroll Frank Ruskey Mark Weston Abstract We establish a new lower bound for the number of sides required for the component curves of simple

More information

6 Randomized rounding of semidefinite programs

6 Randomized rounding of semidefinite programs 6 Randomized rounding of semidefinite programs We now turn to a new tool which gives substantially improved performance guarantees for some problems We now show how nonlinear programming relaxations can

More information

Basics of Combinatorial Topology

Basics of Combinatorial Topology Chapter 7 Basics of Combinatorial Topology 7.1 Simplicial and Polyhedral Complexes In order to study and manipulate complex shapes it is convenient to discretize these shapes and to view them as the union

More information

Flat Surfaces, Teichmueller Discs, Veech Groups, and the Veech Tessellation

Flat Surfaces, Teichmueller Discs, Veech Groups, and the Veech Tessellation Flat Surfaces, Teichmueller Discs, Veech Groups, and the Veech Tessellation S. Allen Broughton - Rose-Hulman Institute of Technology Chris Judge - Indiana University AMS Regional Meeting at Pennsylvania

More information

6.3 Poincare's Theorem

6.3 Poincare's Theorem Figure 6.5: The second cut. for some g 0. 6.3 Poincare's Theorem Theorem 6.3.1 (Poincare). Let D be a polygon diagram drawn in the hyperbolic plane such that the lengths of its edges and the interior angles

More information

MATRIX INTEGRALS AND MAP ENUMERATION 1

MATRIX INTEGRALS AND MAP ENUMERATION 1 MATRIX INTEGRALS AND MAP ENUMERATION 1 IVAN CORWIN Abstract. We explore the connection between integration with respect to the GUE and enumeration of maps. This connection is faciliated by the Wick Formula.

More information

Hamiltonian cycles in bipartite quadrangulations on the torus

Hamiltonian cycles in bipartite quadrangulations on the torus Hamiltonian cycles in bipartite quadrangulations on the torus Atsuhiro Nakamoto and Kenta Ozeki Abstract In this paper, we shall prove that every bipartite quadrangulation G on the torus admits a simple

More information

Inversive Plane Geometry

Inversive Plane Geometry Inversive Plane Geometry An inversive plane is a geometry with three undefined notions: points, circles, and an incidence relation between points and circles, satisfying the following three axioms: (I.1)

More information

Honors Geometry CHAPTER 7. Study Guide Final Exam: Ch Name: Hour: Try to fill in as many as possible without looking at your book or notes.

Honors Geometry CHAPTER 7. Study Guide Final Exam: Ch Name: Hour: Try to fill in as many as possible without looking at your book or notes. Honors Geometry Study Guide Final Exam: h 7 12 Name: Hour: Try to fill in as many as possible without looking at your book or notes HPTER 7 1 Pythagorean Theorem: Pythagorean Triple: 2 n cute Triangle

More information

correlated to the Michigan High School Content Expectations Geometry

correlated to the Michigan High School Content Expectations Geometry correlated to the Michigan High School Content Expectations Geometry McDougal Littell Integrated Mathematics 2 2005 correlated to the Michigan High School Content Expectations Geometry STANDARD L1: REASONING

More information

First-passage percolation in random triangulations

First-passage percolation in random triangulations First-passage percolation in random triangulations Jean-François Le Gall (joint with Nicolas Curien) Université Paris-Sud Orsay and Institut universitaire de France Random Geometry and Physics, Paris 2016

More information

1 Introduction To construct a branched covering of a 3-manifold M, we start with a tamely embedded knot or link L ρ M (the branch set) and a represent

1 Introduction To construct a branched covering of a 3-manifold M, we start with a tamely embedded knot or link L ρ M (the branch set) and a represent Kirby diagrams from branched-covering presentations Frank J. Swenton Department of Mathematics Middlebury College Middlebury, VT 05753 Email: fswenton@alumni.princeton.edu Abstract We present an algorithm

More information

A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3

A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 ANDREW J. HANSON AND JI-PING SHA In this paper we present a systematic and explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F

More information

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Definition 1.1. Let X be a set and T a subset of the power set P(X) of X. Then T is a topology on X if and only if all of the following

More information

Lecture 2 September 3

Lecture 2 September 3 EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give

More information