Embeddings and Tverberg-Type Problems: New Algorithms and Undecidability Results
Offered By: Applied Algebraic Topology Network via YouTube
Course Description
Overview
Explore computational topology in this conference talk that presents two new results. Delve into the algorithmic embeddability problem and its undecidability in higher dimensions. Discover the r-Tverberg problem, a generalization of embeddability, and learn about its polynomial-time decidability in the metastable range of dimensions. Gain insights into piecewise-linear embeddings, simplicial complexes, and Euclidean space as the speaker discusses joint work on these complex topological challenges.
Syllabus
Introduction
Embedding Problem
Artwork Problem
Embeddings
Metastable Range of Dimensions
Undecidability
Equivalent Maps
Metastable Range
Taught by
Applied Algebraic Topology Network
Related Courses
Quantum Algorithm for Simulating Real Time Evolution of Lattice HamiltoniansSimons Institute via YouTube History of Geometry IV - The Emergence of Higher Dimensions - Sociology and Pure Maths
Insights into Mathematics via YouTube Families
Joint Mathematics Meetings via YouTube Sobolev Regularity for Maximal Operators
Hausdorff Center for Mathematics via YouTube Ergodicity in Smooth Dynamics 1
ICTP Mathematics via YouTube