Simplicial complex

Abstract: This chapter discusses various elements of algebraic topology. Topology is a powerful tool in classical analysis and is connected with technology and natural sciences via its applications, while topology itself uses methods of algebra and set theory. A simplicial complex is defined as a finite family of simplexes containing all the faces of its simplexes, and such that the intersection of the closures of each two of its elements is either empty or equal to the closure of their common face. The dimension of a complex is defined as the least upper bound of the dimensions of its simplexes.

Abstract: The Complex of Curves on a Surface is a simplicial complex whose vertices are homotopy classes of simple closed curves, and whose simplices are sets of homotopy classes which can be realized disjointly. It is not hard to see that the complex is finite-dimensional, but locally infinite. It was introduced by Harvey as an analogy, in the context of Teichmuller space, for Tits buildings for symmetric spaces, and has been studied by Harer and Ivanov as a tool for understanding mapping class groups of surfaces. In this paper we prove that, endowed with a natural metric, the complex is hyperbolic in the sense of Gromov. In a certain sense this hyperbolicity is an explanation of why the Teichmuller space has some negative-curvature properties in spite of not being itself hyperbolic: Hyperbolicity in the Teichmuller space fails most obviously in the regions corresponding to surfaces where some curve is extremely short. The complex of curves exactly encodes the intersection patterns of this family of regions (it is the "nerve" of the family), and we show that its hyperbolicity means that the Teichmuller space is "relatively hyperbolic" with respect to this family. A similar relative hyperbolicity result is proved for the mapping class group of a surface. We also show that the action of pseudo-Anosov mapping classes on the complex is hyperbolic, with a uniform bound on translation distance.

Abstract: Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. Starting with motivating problems in both mathematics and computer science and building up from classic topics in geometric and algebraic topology, the third part of the text advances to persistent homology. This point of view is critically important in turning a mostly theoretical field of mathematics into one that is relevant to a multitude of disciplines in the sciences and engineering. The main approach is the discovery of topology through algorithms. The book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles. Thus the text could serve equally well in a course taught in a mathematics department or computer science department.