Search 6,000+ CA Community College Courses
The Topological Complexity of Pure Graph Braid Groups Is Stably Maximal

The Topological Complexity of Pure Graph Braid Groups Is Stably Maximal

Applied Algebraic Topology Network via YouTube Direct link

Ben Knudsen (7/28/22): The topological complexity of pure graph braid groups is stably maximal

1 of 1

1 of 1

Ben Knudsen (7/28/22): The topological complexity of pure graph braid groups is stably maximal

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

The Topological Complexity of Pure Graph Braid Groups Is Stably Maximal

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Ben Knudsen (7/28/22): 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.

Sign up for free
Someone learning on their laptop while sitting on the floor.