Isabel K. Darcy. hup://
|
|
- Damon Mitchell
- 5 years ago
- Views:
Transcription
1 Lecture 5: Triangula0ons & simplicial complexes (and cell complexes). in a series of preparatory lectures for the Fall 2013 online course MATH: 7450 (22M:305) Topics in Topology: Scien0fic and Engineering Applica0ons of Algebraic Topology Target Audience: Anyone interested in topological data analysis including graduate students, faculty, industrial researchers in bioinforma0cs, biology, business, computer science, cosmology, engineering, imaging, mathema0cs, neurology, physics, sta0s0cs, etc. Isabel K. Darcy Mathema0cs Department/Applied Mathema0cal & Computa0onal Sciences niversity of Iowa hp://
2 Building blocks for a simplicial complex 0- simplex vertex v 1- simplex edge {v 1, v 2 } v 1 v 2 e Note that the boundary of this edge is v 2 + v 1 2- simplex triangle {v 1, v 2, v 3 } e 1 v 2 e 2 v 1 v e 3 3 Note that the boundary of this triangle is the cycle e 1 + e 2 + e 3 {v 1, v 2 } + {v 2, v 3 } + {v 1, v 3 }
3 Building blocks for a simplicial complex 3- simplex {v 1, v 2, v 3, v 4 } tetrahedron v 2 v 1 v 3 boundary of {v 1, v 2, v 3, v 4 } {v 1, v 2, v 3 } + {v 1, v 2, v 4 } + {v 1, v 3, v 4 } + {v 2, v 3, v 4 } n- simplex {v 1, v 2,, v n+1 } v 4
4 Building blocks for a simplicial complex 3- simplex {v 1, v 2, v 3, v 4 } tetrahedron v 2 Fill in v 2 v 4 v 4 v 1 v 3 boundary of {v 1, v 2, v 3, v 4 } {v 1, v 2, v 3 } + {v 1, v 2, v 4 } + {v 1, v 3, v 4 } + {v 2, v 3, v 4 } n- simplex {v 1, v 2,, v n+1 } v 1 v 3
5 Crea0ng a simplicial complex 0.) Start by adding 0- dimensional ver0ces (0- simplices)
6 Crea0ng a simplicial complex 1.) Next add 1- dimensional edges (1- simplices). Note: These edges must connect two ver0ces. I.e., the boundary of an edge is two ver0ces
7 Crea0ng a simplicial complex 1.) Next add 1- dimensional edges (1- simplices). Note: These edges must connect two ver0ces. I.e., the boundary of an edge is two ver0ces
8 Crea0ng a simplicial complex 1.) Next add 1- dimensional edges (1- simplices). Note: These edges must connect two ver0ces. I.e., the boundary of an edge is two ver0ces
9 Crea0ng a simplicial complex 2.) Add 2- dimensional triangles (2- simplices). Boundary of a triangle a cycle consis0ng of 3 edges.
10 Crea0ng a simplicial complex 2.) Add 2- dimensional triangles (2- simplices). Boundary of a triangle a cycle consis0ng of 3 edges.
11 Crea0ng a simplicial complex 3.) Add 3- dimensional tetrahedrons (3- simplices). Boundary of a 3- simplex a cycle consis0ng of its four 2- dimensional faces.
12 Crea0ng a simplicial complex 3.) Add 3- dimensional tetrahedrons (3- simplices). Boundary of a 3- simplex a cycle consis0ng of its four 2- dimensional faces.
13 4.) Add 4- dimensional 4- simplices, {v 1, v 2,, v 5 }. Boundary of a 4- simplex a cycle consis0ng of 3- simplices. {v 2, v 3, v 4, v 5 } + {v 1, v 3, v 4, v 5 } + {v 1, v 2, v 4, v 5 } + {v 1, v 2, v 3, v 5 } + {v 1, v 2, v 3, v 4 }
14 Crea0ng a simplicial complex n.) Add n- dimensional n- simplices, {v 1, v 2,, v n+1 }. Boundary of a n- simplex a cycle consis0ng of (n- 1)- simplices.
15 Example: Triangula0ng the circle. circle { x in R 2 : x 1 }
16 Example: Triangula0ng the circle. circle { x in R 2 : x 1 }
17 Example: Triangula0ng the circle. circle { x in R 2 : x 1 }
18 Example: Triangula0ng the circle. circle { x in R 2 : x 1 }
19 Example: Triangula0ng the circle. circle { x in R 2 : x 1 }
20 Example: Triangula0ng the disk. disk { x in R 2 : x 1 }
21 Example: Triangula0ng the disk. disk { x in R 2 : x 1 }
22 Example: Triangula0ng the disk. disk { x in R 2 : x 1 }
23 Example: Triangula0ng the disk. disk { x in R 2 : x 1 }
24 Example: Triangula0ng the disk. disk { x in R 2 : x 1 }
25 Example: Triangula0ng the sphere. sphere { x in R 3 : x 1 }
26 Example: Triangula0ng the sphere. sphere { x in R 3 : x 1 }
27 Example: Triangula0ng the sphere. sphere { x in R 3 : x 1 }
28 Example: Triangula0ng the sphere. sphere { x in R 3 : x 1 }
29 Example: Triangula0ng the circle. disk { x in R 2 : x 1 }
30 Example: Triangula0ng the circle. disk { x in R 2 : x 1 }
31 Example: Triangula0ng the circle. disk { x in R 2 : x 1 } Fist image from hp://openclipart.org/detail/1000/a- raised- fist- by- licarn
32 Example: Triangula0ng the sphere. sphere { x in R 3 : x 1 }
33 Example: Triangula0ng the sphere. sphere { x in R 3 : x 1 }
34 Crea0ng a cell complex Building block: n- cells { x in R n : x 1 } Examples: 0- cell { x in R 0 : x < 1 } 1- cell open interval { x in R : x < 1 } ( ) 2- cell open disk { x in R 2 : x < 1 } 3- cell open ball { x in R 3 : x < 1 }
35 Building blocks for a simplicial complex 0- simplex vertex v 1- simplex edge {v 1, v 2 } v 1 v 2 e Note that the boundary of this edge is v 2 + v 1 2- simplex triangle {v 1, v 2, v 3 } e 1 v 2 e 2 v 1 v e 3 3 Note that the boundary of this triangle is the cycle e 1 + e 2 + e 3 {v 1, v 2 } + {v 2, v 3 } + {v 1, v 3 }
36 Building blocks for a simplicial complex 3- simplex {v 1, v 2, v 3, v 4 } tetrahedron v 2 Fill in v 2 v 4 v 4 v 1 v 3 boundary of {v 1, v 2, v 3, v 4 } {v 1, v 2, v 3 } + {v 1, v 2, v 4 } + {v 1, v 3, v 4 } + {v 2, v 3, v 4 } n- simplex {v 1, v 2,, v n+1 } v 1 v 3
37 Crea0ng a cell complex Building block: n- cells { x in R n : x 1 } Examples: 0- cell { x in R 0 : x < 1 } 1- cell open interval { x in R : x < 1 } ( ) 2- cell open disk { x in R 2 : x < 1 } 3- cell open ball { x in R 3 : x < 1 }
38 Crea0ng a cell complex Building block: n- cells { x in R n : x 1 } Examples: 0- cell { x in R 0 : x < 1 } 1- cell open interval { x in R : x < 1 } ( ) 2- cell open disk { x in R 2 : x < 1 } 3- cell open ball { x in R 3 : x < 1 }
39 Example: disk { x in R 2 : x 1 } Simplicial complex Cell complex ( )
40 Example: disk { x in R 2 : x 1 } Simplicial complex Cell complex ( )
41 Example: disk { x in R 2 : x 1 } Simplicial complex Cell complex ( ) ( )
42 Example: disk { x in R 2 : x 1 } Simplicial complex Cell complex ( ) [ ]
43 Example: disk { x in R 2 : x 1 } Simplicial complex Cell complex ( ) [ ]
44 Example: disk { x in R 2 : x 1 } Simplicial complex Cell complex ( ) [ ]
45 Example: disk { x in R 2 : x 1 } Simplicial complex Cell complex ( ) [ ]
46 Euler characteris?c (simple form): number of ver0ces number of edges + number of faces Or in short- hand, V - E + F where V set of ver0ces E set of edges F set of 2- dimensional faces & the nota0on X the number of elements in the set X.
47 Example: disk { x in R 2 : x 1 } Simplicial complex 3 ver0ces, 3 edges, 1 triangle Cell complex 1 vertex, 1 edge, 1 disk. ( ) [ ]
48 Euler characteris?c: Given a simplicial complex C, let C n the set of n- dimensional simplices in C, and let C n denote the number of elements in C n. Then C 0 - C 1 + C 2 - C 3 + Σ (- 1) n C n
49 Euler characteris?c: Given a cell complex C, let C n the set of n- dimensional cells in C, and let C n denote the number of elements in C n. Then C 0 - C 1 + C 2 - C 3 + Σ (- 1) n C n
50 Example: sphere { x in R 3 : x 1 } Simplicial complex 4 ver0ces, 6 edges, 4 triangles Cell Complex 1 vertex, 1 disk
51 Example: sphere { x in R 3 : x 1 } Simplicial complex Cell complex
52 Example: sphere { x in R 3 : x 1 } Simplicial complex Cell complex
53 Example: sphere { x in R 3 : x 1 } Simplicial complex Cell complex
54 Example: sphere { x in R 3 : x 1 } Simplicial complex Cell complex Fist image from hp://openclipart.org/detail/1000/a- raised- fist- by- licarn
55 Example: sphere { x in R 3 : x 1 } Cell complex
56 Example: sphere { x in R 3 : x 1 } Cell complex
57 Example: sphere { x in R 3 : x 1 } Simplicial complex Cell complex Cell complex
Dec 2, 2013: Hippocampal spa:al map forma:on
MATH:7450 (22M:305) Topics in Topology: Scien:fic and Engineering Applica:ons of Algebraic Topology Dec 2, 2013: Hippocampal spa:al map forma:on Fall 2013 course offered through the University of Iowa
More informationNov 20, 2013: Intro to RNA & Topological Landscapes for Visualiza:on of Scalar- Valued Func:ons.
MATH:7450 (22M:305) Topics in Topology: Scien:fic and Engineering Applica:ons of Algebraic Topology Nov 20, 2013: Intro to RNA & Topological Landscapes for Visualiza:on of Scalar- Valued Func:ons. Fall
More informationTutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass
Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass University of California, Davis, USA http://www.cs.ucdavis.edu/~koehl/ims2017/ What is a shape? A shape is a 2-manifold with a Riemannian
More information66 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 informationEuler s Theorem. Brett Chenoweth. February 26, 2013
Euler s Theorem Brett Chenoweth February 26, 2013 1 Introduction This summer I have spent six weeks of my holidays working on a research project funded by the AMSI. The title of my project was Euler s
More informationLecture 5: Simplicial Complex
Lecture 5: Simplicial Complex 2-Manifolds, Simplex and Simplicial Complex Scribed by: Lei Wang First part of this lecture finishes 2-Manifolds. Rest part of this lecture talks about simplicial complex.
More information4.2 Simplicial Homology Groups
4.2. SIMPLICIAL HOMOLOGY GROUPS 93 4.2 Simplicial Homology Groups 4.2.1 Simplicial Complexes Let p 0, p 1,... p k be k + 1 points in R n, with k n. We identify points in R n with the vectors that point
More informationTopological Data Analysis - I. Afra Zomorodian Department of Computer Science Dartmouth College
Topological Data Analysis - I Afra Zomorodian Department of Computer Science Dartmouth College September 3, 2007 1 Acquisition Vision: Images (2D) GIS: Terrains (3D) Graphics: Surfaces (3D) Medicine: MRI
More information4. 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 informationDISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU /858B Fall 2017
DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU 15-458/858B Fall 2017 LECTURE 2: THE SIMPLICIAL COMPLEX DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU
More informationThree-Dimensional α Shapes
Herbert Edelsbrunner and Ernst P. Mücke ACM Tran. Graph. 13(1), 1994 20 September 2005 1 2 α-complexes Edelsbrunner s Algorithm 3 Properties Surface Reconstruction Shape Question Given a set of points,
More informationHomology and Persistent Homology Bootcamp Notes 2017
Homology and Persistent Homology Bootcamp Notes Summer@ICERM 2017 Melissa McGuirl September 19, 2017 1 Preface This bootcamp is intended to be a review session for the material covered in Week 1 of Summer@ICERM
More information1 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 informationLecture 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 informationLecture 5 CLASSIFICATION OF SURFACES
Lecture 5 CLASSIFICATION OF SURFACES In this lecture, we present the topological classification of surfaces. This will be done by a combinatorial argument imitating Morse theory and will make use of the
More informationSimplicial Complexes: Second Lecture
Simplicial Complexes: Second Lecture 4 Nov, 2010 1 Overview Today we have two main goals: Prove that every continuous map between triangulable spaces can be approximated by a simplicial map. To do this,
More informationExact discrete Morse functions on surfaces. To the memory of Professor Mircea-Eugen Craioveanu ( )
Stud. Univ. Babeş-Bolyai Math. 58(2013), No. 4, 469 476 Exact discrete Morse functions on surfaces Vasile Revnic To the memory of Professor Mircea-Eugen Craioveanu (1942-2012) Abstract. In this paper,
More informationSurfaces Beyond Classification
Chapter XII Surfaces Beyond Classification In most of the textbooks which present topological classification of compact surfaces the classification is the top result. However the topology of 2- manifolds
More informationHomology of Simplicial Complexes
Homology of Simplicial Complexes Math, David Perkinson Introduction. This is an introduction to the homology of simplicial complexes suitable for a first course in linear algebra. It uses little more than
More information751 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 informationBasics 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 information4) Simplify 5( 6) Simplify. 8) Solve 1 x 2 4
Algebra Summer Assignment 1) Simplify x 4y 10 x ) Simplify 4y 6x 3( x y) 3) Simplify 1 3 ( x 3) 4) Simplify 5( x 9x) (3x 4) 7 5) Simplify ( x 3)( x ) 6) Simplify ( x 4) 3 7) Simplify ( 5x 8)(4x 1) 8) Solve
More informationCOMBINATORIAL METHODS IN ALGEBRAIC TOPOLOGY
COMBINATORIAL METHODS IN ALGEBRAIC TOPOLOGY 1. Geometric and abstract simplicial complexes Let v 0, v 1,..., v k be points in R n. These points determine a hyperplane in R n, consisting of linear combinations
More informationQuasi-category theory you can use
Quasi-category theory you can use Emily Riehl Harvard University http://www.math.harvard.edu/ eriehl Graduate Student Topology & Geometry Conference UT Austin Sunday, April 6th, 2014 Plan Part I. Introduction
More informationSimplicial 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 informationLecture 18: Groupoids and spaces
Lecture 18: Groupoids and spaces The simplest algebraic invariant of a topological space T is the set π 0 T of path components. The next simplest invariant, which encodes more of the topology, is the fundamental
More information6.2 Classification of Closed Surfaces
Table 6.1: A polygon diagram 6.1.2 Second Proof: Compactifying Teichmuller Space 6.2 Classification of Closed Surfaces We saw that each surface has a triangulation. Compact surfaces have finite triangulations.
More informationCurvature Berkeley Math Circle January 08, 2013
Curvature Berkeley Math Circle January 08, 2013 Linda Green linda@marinmathcircle.org Parts of this handout are taken from Geometry and the Imagination by John Conway, Peter Doyle, Jane Gilman, and Bill
More informationA non-partitionable Cohen-Macaulay simplicial complex
A non-partitionable Cohen-Macaulay simplicial complex Art Duval 1, Bennet Goeckner 2, Caroline Klivans 3, Jeremy Martin 2 1 University of Texas at El Paso, 2 University of Kansas, 3 Brown University Discrete
More informationConstructive Homological Algebra V. Algebraic Topology background
0 Constructive Homological Algebra V. Algebraic Topology background Francis Sergeraert, Institut Fourier, Grenoble, France Genova Summer School, 2006 1 General topological spaces cannot be directly installed
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics SIMPLIFYING TRIANGULATIONS OF S 3 Aleksandar Mijatović Volume 208 No. 2 February 2003 PACIFIC JOURNAL OF MATHEMATICS Vol. 208, No. 2, 2003 SIMPLIFYING TRIANGULATIONS OF S
More informationA non-partitionable Cohen-Macaulay simplicial complex
A non-partitionable Cohen-Macaulay simplicial complex Art Duval 1, Bennet Goeckner 2, Caroline Klivans 3, Jeremy Martin 2 1 University of Texas at El Paso, 2 University of Kansas, 3 Brown University Department
More informationarxiv: v1 [math.co] 3 Nov 2017
DEGREE-REGULAR TRIANGULATIONS OF SURFACES BASUDEB DATTA AND SUBHOJOY GUPTA arxiv:1711.01247v1 [math.co] 3 Nov 2017 Abstract. A degree-regular triangulation is one in which each vertex has identical degree.
More informationComputing the Betti Numbers of Arrangements. Saugata Basu School of Mathematics & College of Computing Georgia Institute of Technology.
1 Computing the Betti Numbers of Arrangements Saugata Basu School of Mathematics & College of Computing Georgia Institute of Technology. 2 Arrangements in Computational Geometry An arrangement in R k is
More informationHyperbolic Geometry on the Figure-Eight Knot Complement
Hyperbolic Geometry on the Figure-Eight Knot Complement Alex Gutierrez Arizona State University December 10, 2012 Hyperbolic Space Hyperbolic Space Hyperbolic space H n is the unique complete simply-connected
More informationObserving Information: Applied Computational Topology.
Observing Information: Applied Computational Topology. Bangor University, and NUI Galway April 21, 2008 What is the geometric information that can be gleaned from a data cloud? Some ideas either already
More informationTopological Data Analysis
Topological Data Analysis Deepak Choudhary(11234) and Samarth Bansal(11630) April 25, 2014 Contents 1 Introduction 2 2 Barcodes 2 2.1 Simplical Complexes.................................... 2 2.1.1 Representation
More informationTopological Decompositions for 3D Non-manifold Simplicial Shapes
Topological Decompositions for 3D Non-manifold Simplicial Shapes Annie Hui a,, Leila De Floriani b a Dept of Computer Science, Univerity of Maryland, College Park, USA b Dept of Computer Science, University
More informationA convenient way to construct large simplicial complexes is through specifying sets and recording their intersection patterns.
III.2 Convex Set Systems 53 III.2 Convex Set Systems A convenient way to construct large simplicial complexes is through specifying sets and recording their intersection patterns. Nerves. Let F be a finite
More informationGeometric structures on 2-orbifolds
Geometric structures on 2-orbifolds Section 1: Manifolds and differentiable structures S. Choi Department of Mathematical Science KAIST, Daejeon, South Korea 2010 Fall, Lectures at KAIST S. Choi (KAIST)
More informationSOCIAL CHOICE AMONG COMPLEX OBJECTS:MATHEMATICAL TOOLS
SOCIAL CHOICE AMONG COMPLEX OBJECTS:MATHEMATICAL TOOLS SIMONA SETTEPANELLA Abstract. Here the reader can find some basic definitions and notations in order to better understand the model for social choise
More informationOne simple example is that of a cube. Each face is a square (=regular quadrilateral) and each vertex is connected to exactly three squares.
Berkeley Math Circle Intermediate I, 1/23, 1/20, 2/6 Presenter: Elysée Wilson-Egolf Topic: Polygons, Polyhedra, Polytope Series Part 1 Polygon Angle Formula Let s start simple. How do we find the sum of
More informationLectures on topology. S. K. Lando
Lectures on topology S. K. Lando Contents 1 Reminder 2 1.1 Topological spaces and continuous mappings.......... 3 1.2 Examples............................. 4 1.3 Properties of topological spaces.................
More informationKINDERGARTEN MATH STANDARDS BASED RUBRIC NUMBER SENSE Essential Standard: 1.0 STUDENTS UNDERSTAND THE RELATIONSHIP BETWEEN NUMBERS AND QUANTITIES.
KINDERGARTEN MATH STANDARDS BASED RUBRIC NUMBER SENSE 1.0 STUDENTS UNDERSTAND THE RELATIONSHIP BETWEEN NUMBERS AND QUANTITIES. Unable to compare 2 or more In consistently compare 2 or Compare 2 or more
More informationRevision Problems for Examination 2 in Algebra 1
Centre for Mathematical Sciences Mathematics, Faculty of Science Revision Problems for Examination in Algebra. Let l be the line that passes through the point (5, 4, 4) and is at right angles to the plane
More informationSurfaces: notes on Geometry & Topology
Surfaces: notes on Geometry & Topology 1 Surfaces A 2-dimensional region of 3D space A portion of space having length and breadth but no thickness 2 Defining Surfaces Analytically... Parametric surfaces
More informationA Constructive Proof of Ky Fan's Generalization of Tucker's Lemma
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 8-1-2005 A Constructive Proof of Ky Fan's Generalization of Tucker's Lemma Timothy Prescott
More informationMath 265 Exam 3 Solutions
C Roettger, Fall 16 Math 265 Exam 3 Solutions Problem 1 Let D be the region inside the circle r 5 sin θ but outside the cardioid r 2 + sin θ. Find the area of D. Note that r and θ denote polar coordinates.
More informationApproximating Polygonal Objects by Deformable Smooth Surfaces
Approximating Polygonal Objects by Deformable Smooth Surfaces Ho-lun Cheng and Tony Tan School of Computing, National University of Singapore hcheng,tantony@comp.nus.edu.sg Abstract. We propose a method
More informationAnalysis of high dimensional data via Topology. Louis Xiang. Oak Ridge National Laboratory. Oak Ridge, Tennessee
Analysis of high dimensional data via Topology Louis Xiang Oak Ridge National Laboratory Oak Ridge, Tennessee Contents Abstract iii 1 Overview 1 2 Data Set 1 3 Simplicial Complex 5 4 Computation of homology
More information1 Introduction. For example, consider four points A, B, C, D which form a convex polygon in the plane.
TOPCOM: Triangulations of Point Configurations and Oriented Matroids - Jörg Rambau - Handout by Clemens Pohle - Student Seminar in Combinatorics: Mathematical Software 1 Introduction TOPCOM is a package
More informationMath 170, Section 002 Spring 2012 Practice Exam 2 with Solutions
Math 170, Section 002 Spring 2012 Practice Exam 2 with Solutions Contents 1 Problems 2 2 Solution key 10 3 Solutions 11 1 1 Problems Question 1: A right triangle has hypothenuse of length 25 in and an
More informationHomology cycle bases from acyclic matchings
Homology cycle bases from acyclic matchings Dmitry Feichtner-Kozlov University of Bremen Kyoto Workshop, January 019 What is... Applied Topology? studying global features of shapes applications in other
More informationA 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 informationMath 311. Trees Name: A Candel CSUN Math
1. A simple path in a graph is a path with no repeated edges. A simple circuit is a circuit without repeated edges. 2. Trees are special kinds of graphs. A tree is a connected graph with no simple circuits.
More informationIntermediate Math Circles Fall 2018 Patterns & Counting
Intermediate Math Circles Fall 2018 Patterns & Counting Michael Miniou The Centre for Education in Mathematics and Computing Faculty of Mathematics University of Waterloo December 5, 2018 Michael Miniou
More informationSPERNER 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 informationarxiv: v1 [cs.it] 10 May 2016
Separating Topological Noise from Features using Persistent Entropy Nieves Atienza 1, Rocio Gonzalez-Diaz 1, and Matteo Rucco 2 arxiv:1605.02885v1 [cs.it] 10 May 2016 1 Applied Math Department, School
More informationPlanar graphs. Math Prof. Kindred - Lecture 16 Page 1
Planar graphs Typically a drawing of a graph is simply a notational shorthand or a more visual way to capture the structure of the graph. Now we focus on the drawings themselves. Definition A drawing of
More informationTopological estimation using witness complexes. Vin de Silva, Stanford University
Topological estimation using witness complexes, Acknowledgements Gunnar Carlsson (Mathematics, Stanford) principal collaborator Afra Zomorodian (CS/Robotics, Stanford) persistent homology software Josh
More informationCS 468 (Spring 2013) Discrete Differential Geometry
CS 468 (Spring 2013) Discrete Differential Geometry 1 Math Review Lecture 14 15 May 2013 Discrete Exterior Calculus Lecturer: Justin Solomon Scribe: Cassidy Saenz Before we dive into Discrete Exterior
More informationManifolds. Chapter X. 44. Locally Euclidean Spaces
Chapter X Manifolds 44. Locally Euclidean Spaces 44 1. Definition of Locally Euclidean Space Let n be a non-negative integer. A topological space X is called a locally Euclidean space of dimension n if
More informationSperner and Tucker s lemma
Sperner and Tucker s lemma Frédéric Meunier February 8th 2010 Ecole des Ponts, France Sperner s lemma Brouwer s theorem Let B be a d-dimensional ball and f be a continuous B B map. Then always Theorem
More informationCS 4620 Midterm, March 21, 2017
CS 460 Midterm, March 1, 017 This 90-minute exam has 4 questions worth a total of 100 points. Use the back of the pages if you need more space. Academic Integrity is expected of all students of Cornell
More informationEuler Characteristic
Euler Characteristic Sudesh Kalyanswamy 1 Introduction Euler characteristic is a very important topological property which started out as nothing more than a simple formula involving polyhedra. Euler observed
More informationWe have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance.
Solid geometry We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance. First, note that everything we have proven for the
More informationD A S O D A. Identifying and Classifying 3-D Objects. Examples
Identifying Classifying 3-D Objects Examples Have you noticed that many of the products we purchase come in packages or boxes? Take a look at the products below. A) Did you notice that all the sides or
More informationTOPOLOGICAL DATA ANALYSIS
TOPOLOGICAL DATA ANALYSIS BARCODES Ghrist, Barcodes: The persistent topology of data Topaz, Ziegelmeier, and Halverson 2015: Topological Data Analysis of Biological Aggregation Models 1 Questions in data
More informationExamples of Groups: Coxeter Groups
Examples of Groups: Coxeter Groups OSU May 31, 2008 http://www.math.ohio-state.edu/ mdavis/ 1 Geometric reflection groups Some history Properties 2 Coxeter systems The cell complex Σ Variation for Artin
More informationClassifications in Low Dimensions
Chapter XI Classifications in Low Dimensions In different geometric subjects there are different ideas which dimensions are low and which high. In topology of manifolds low dimension means at most 4. However,
More informationSTANLEY S SIMPLICIAL POSET CONJECTURE, AFTER M. MASUDA
Communications in Algebra, 34: 1049 1053, 2006 Copyright Taylor & Francis Group, LLC ISSN: 0092-7872 print/1532-4125 online DOI: 10.1080/00927870500442005 STANLEY S SIMPLICIAL POSET CONJECTURE, AFTER M.
More informationPERSISTENT HOMOLOGY OF FINITE TOPOLOGICAL SPACES
PERSISTENT HOMOLOGY OF FINITE TOPOLOGICAL SPACES HANEY MAXWELL Abstract. We introduce homology and finite topological spaces. From the basis of that introduction, persistent homology is applied to finite
More informationDiffusion Maps and Topological Data Analysis
Diffusion Maps and Topological Data Analysis Melissa R. McGuirl McGuirl (Brown University) Diffusion Maps and Topological Data Analysis 1 / 19 Introduction OVERVIEW Topological Data Analysis The use of
More informationCREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM. Dimitrios I. Dais
Séminaires & Congrès 6, 2002, p. 187 192 CREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM by Dimitrios I. Dais Abstract. A necessary condition for the existence of torus-equivariant
More informationDistributed Newest Vertex Bisection
Distributed Newest Vertex Bisection in Dune-ALUGrid Martin Alkämper and Robert Klöfkorn Dune User Meeting 2015 Algorithm Some Analysis Experiments Problem In Dune-ALUGrid (among others) we provide an adaptive,
More informationHyperbolic Structures from Ideal Triangulations
Hyperbolic Structures from Ideal Triangulations Craig Hodgson University of Melbourne Geometric structures on 3-manifolds Thurston s idea: We would like to find geometric structures (or metrics) on 3-manifolds
More informationPRESCRIBING CURVATURE FOR PIECEWISE FLAT TRIANGULATED 3-MANIFOLDS
PRESCRIBING CURVATURE FOR PIECEWISE FLAT TRIANGULATED 3-MANIFOLDS HOWARD CHENG AND PETER MCGRATH Abstract. Here we study discrete notions of curvature for piecewise flat triangulated 3-manifolds. Of particular
More informationTriangles and Squares David Eppstein, ICS Theory Group, April 20, 2001
Triangles and Squares David Eppstein, ICS Theory Group, April 20, 2001 Which unit-side-length convex polygons can be formed by packing together unit squares and unit equilateral triangles? For instance
More informationTight Cocone DIEGO SALUME SEPTEMBER 18, 2013
Tight Cocone DIEGO SALUME SEPTEMBER 18, 2013 Summary Problem: The Cocone algorithm produces surfaces with holes and artifacts in undersampled areas in the data. Solution: Extend the Cocone algorithm to
More informationNon-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 informationA non-partitionable Cohen-Macaulay simplicial complex, and implications for Stanley depth
A non-partitionable Cohen-Macaulay simplicial complex, and implications for Stanley depth Art Duval 1, Bennet Goeckner 2, Caroline Klivans 3, Jeremy Martin 2 1 University of Texas at El Paso, 2 University
More informationDimension-Independent Data Structures for Arbitrary Simplicial Complexes
Dimension-Independent Data Structures for Arbitrary Simplicial Complexes David Canino (canino.david@gmail.com) The Incidence Simplicial (IS) data structure The Generalized Indexed data structure with Adjacencies
More informationThe Borsuk-Ulam theorem- A Combinatorial Proof
The Borsuk-Ulam theorem- A Combinatorial Proof Shreejit Bandyopadhyay April 14, 2015 1 Introduction The Borsuk-Ulam theorem is perhaps among the results in algebraic topology having the greatest number
More informationTHE RISE, FALL AND RISE OF SIMPLICIAL COMPLEXES. Andrew Ranicki (Edinburgh) aar Warwick 2nd February, 2018
1 THE RISE, FALL AND RISE OF SIMPLICIAL COMPLEXES Andrew Ranicki (Edinburgh) http://www.maths.ed.ac.uk/ aar Warwick 2nd February, 2018 2 Simplicial complexes A simplicial complex is a combinatorial scheme
More informationCUBICAL 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 informationON CELLULAR RESOLUTION OF MONOMIAL IDEALS
ON CELLULAR RESOLUTION OF MONOMIAL IDEALS THE WORKSHOP ON COMPUTATIONAL DIFFERENTIAL ALGEBRA AND RELATED TOPICS SCHOOL OF MATHEMATICS, IPM JUNE 21-25, 2014 TEHRAN, IRAN RAHIM ZAARE-NAHANDI, UNIVERSITY
More informationCS 177 Homework 1. Julian Panetta. October 22, We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F:
CS 177 Homework 1 Julian Panetta October, 009 1 Euler Characteristic 1.1 Polyhedral Formula We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F: V E + F = 1 First,
More informationPortraits of Groups on Bordered Surfaces
Bridges Finland Conference Proceedings Portraits of Groups on Bordered Surfaces Jay Zimmerman Mathematics Department Towson University 8000 York Road Towson, MD 21252, USA E-mail: jzimmerman@towson.edu
More informationBorder operator for generalized maps
Border operator for generalized maps Sylvie Alayrangues, Samuel Peltier, Guillaume Damiand, Pascal Lienhardt To cite this version: Sylvie Alayrangues, Samuel Peltier, Guillaume Damiand, Pascal Lienhardt.
More informationSpa$al Analysis and Modeling (GIST 4302/5302) Guofeng Cao Department of Geosciences Texas Tech University
Spa$al Analysis and Modeling (GIST 4302/5302) Guofeng Cao Department of Geosciences Texas Tech University Class Outlines Spatial Point Pattern Regional Data (Areal Data) Continuous Spatial Data (Geostatistical
More informationIA : An Adjacency-Based Representation for Non-Manifold Simplicial Shapes in Arbitrary Dimensions
IA : An Adjacency-Based Representation for Non-Manifold Simplicial Shapes in Arbitrary Dimensions David Canino a, Leila De Floriani a, Kenneth Weiss b a Department of Computer Science, University of Genova,
More informationAn introduction to simplicial sets
An introduction to simplicial sets 25 Apr 2010 1 Introduction This is an elementary introduction to simplicial sets, which are generalizations of -complexes from algebraic topology. The theory of simplicial
More informationHistory of Topology. Semester I, Graham Ellis NUI Galway, Ireland
History of Topology Semester I, 2009-10 Graham Ellis NUI Galway, Ireland History of Topology Outline Lecture 1: What is topology? Euler circuits in graphs Lecture 2: Topological invariants: Euler-Poincaré
More informationThe 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 informationHOMOLOGY. Equivalently,
HOMOLOGY JOHN ROGNES 1. Homology 1.1. The Euler characteristic. The Euler characteristic of a compact triangulated surface X is defined to be the alternating sum χ(x) = V E + F where V, E and F are the
More informationThe Charney-Davis conjecture for certain subdivisions of spheres
The Charney-Davis conjecture for certain subdivisions of spheres Andrew Frohmader September, 008 Abstract Notions of sesquiconstructible complexes and odd iterated stellar subdivisions are introduced,
More informationMath 210 Manifold III, Spring 2018 Euler Characteristics of Surfaces Hirotaka Tamanoi
Math 210 Manifold III, Spring 2018 Euler Characteristics of Surfaces Hirotaka Tamanoi 1. Euler Characteristic of Surfaces Leonhard Euler noticed that the number v of vertices, the number e of edges and
More informationTopic: Orientation, Surfaces, and Euler characteristic
Topic: Orientation, Surfaces, and Euler characteristic The material in these notes is motivated by Chapter 2 of Cromwell. A source I used for smooth manifolds is do Carmo s Riemannian Geometry. Ideas of
More informationElementary Combinatorial Topology
Elementary Combinatorial Topology Frédéric Meunier Université Paris Est, CERMICS, Ecole des Ponts Paristech, 6-8 avenue Blaise Pascal, 77455 Marne-la-Vallée Cedex E-mail address: frederic.meunier@cermics.enpc.fr
More informationThe Game of Criss-Cross
Chapter 5 The Game of Criss-Cross Euler Characteristic ( ) Overview. The regions on a map and the faces of a cube both illustrate a very natural sort of situation: they are each examples of regions that
More information