The Topological Complexity of Pure Graph Braid Groups Is Stably Maximal
Offered By: Applied Algebraic Topology Network via YouTube
Course Description
Overview
Explore a proof of Farber's conjecture on the topological complexity of configuration spaces of graphs in this 49-minute conference talk. Delve into an argument that avoids cohomology and instead focuses on group theoretic estimates for higher topological complexity, following the work of Farber–Oprea and Grant–Lupton–Oprea. Gain insights into pure graph braid groups and their stably maximal topological complexity as presented by Ben Knudsen at the Applied Algebraic Topology Network.
Syllabus
Ben Knudsen (7/28/22): The topological complexity of pure graph braid groups is stably maximal
Taught by
Applied Algebraic Topology Network
Related Courses
Autodiagnosis and the Dynamical Emergence Theory of Basic ConsciousnessSanta Fe Institute via YouTube Surfaces in 3-Manifolds and the Thurston Norm
Fields Institute via YouTube Enrique Torres-Giese - Sequential Motion Planning Assisted by Group Actions
Applied Algebraic Topology Network via YouTube Steve Scheirer - Relative Topological Complexity and Configuration Spaces
Applied Algebraic Topology Network via YouTube Jamie Scott - Applications of Surgery to a Generalized Rudyak Conjecture
Applied Algebraic Topology Network via YouTube