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
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer