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
Introduction to Algebraic Topology (Part-I)Indian Institute of Technology Bombay via Swayam Introduction to Algebraic Topology (Part-II)
NPTEL via Swayam Intro to the Fundamental Group - Algebraic Topology with Tom Rocks Maths
Dr Trefor Bazett via YouTube Neural Sense Relations and Consciousness - A Diagrammatic Approach
Models of Consciousness Conferences via YouTube Classification of 2-Manifolds and Euler Characteristic - Differential Geometry
Insights into Mathematics via YouTube