Joel Hass - Lecture 1 - Algorithms and complexity in the theory of knots and manifolds - 18/06/18

School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects (geomschool2018.univ-mlv.fr/)
Joel Hass (University of California at Davis, USA)
Algorithms and complexity in the theory of knots and manifolds
Abstract: These lectures will introduce algorithmic procedures to study Knots and 3-dimensional manifolds. Algorithmic questions have been part of the study of manifolds since the time of Dehn, and are finding increasing practicality as algorithms and hardware improve. The study of algorithmic procedures often points the way to interesting directions in the theoretical study of manifolds. We’ll begin by reviewing an easy algorithm to classify 2-manifolds, and then outline Markov's argument for the undecidability of 4-manifold recognition. We’ll then turn to 3-dimensions and and study the Unknotting Problem. Using Haken’s ideas on normal surfaces, we’ll describe algorithms that resolve this and related 3-manifold problems. Normal surfaces turn out to have many similarities to minimal surfaces, and we’ll see how this connection leads to an algorithm to recognize the 3-sphere. Finally we’ll discuss the complexity of topological algorithms, allowing us to connect their difficulty to that of problems in numerous other areas, and to get an idea of which problems are compuationally feasible.
1. - Introduction: Algorithmic procedures to study Knots and 3-Manifolds
- Initial attempts based on Reidemeister moves and monotonic simplifications
- Kneser’s Normal curves and normal surfaces and their relationship to minimal surfaces
- Normalization rpocedures for curves and surfaces
- Optional: Kneser’s Theorem on connect sums
----------------------------------
Vous pouvez nous rejoindre sur les réseaux sociaux pour suivre nos actualités.
Facebook : / instituthenripoincare
Twitter : / inhenripoincare
Instagram : / instituthenripoincare
LinkedIn : / 11054846