YoVDO

Embeddings and Tverberg-Type Problems: New Algorithms and Undecidability Results

Offered By: Applied Algebraic Topology Network via YouTube

Tags

Computational Topology Courses Algorithms Courses Embeddings Courses Higher Dimensions Courses

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

Information Theory
The Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera