Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

The Topological Complexity of Pure Graph Braid Groups Is Stably Maximal

Applied Algebraic Topology Network via YouTube

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

Reviews

Start your review of The Topological Complexity of Pure Graph Braid Groups Is Stably Maximal

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.