Towards Efficient Algorithms in Computational Topology
Abstract: At the turn of the 19th and 20th centuries, Henri Poincaré published a series of six papers that revolutionized topology, the branch of mathematics concerned with robust properties of shapes (in a very general sense) that remain unchanged by continuous deformation.
In these papers Poincaré laid the foundations of homology theory, an algebraic framework for quantifying the components, holes and voids of shapes, which has become a cornerstone of topological data analysis (TDA) hundred years later. He also posed his famous conjecture, which was resolved in a celebrated effort by Perelman only in 2003, providing a major driving force behind many advances in modern 3-dimensional topology.
In the first part of my talk I outline the basic ideas and premises of topological data analysis, and invite the audience to GUDHI, an open-source C++ library with a Python interface actively developed at INRIA, that provides state-of-the-art algorithms and data structures for TDA.
Then, for the second part, we switch gears and restrict our focus to 3-manifolds: shapes that locally look like the 3-dimensional Euclidean space, but globally can be highly complex and non-linear. 3-manifolds naturally appear in various contexts, such as the theory of knots and links, astronomy, or theoretical physics. Here a key challenge concerns the possibility of finding "nice" combinatorial descriptions of these shapes that allow their efficient algorithmic study.
Joint work in progress with Clément Maria.