Unlocking the Mysteries of 3-Manifolds and Zombies with Eric Samperton 🧟‍♂️

Explore the fascinating intersection of computational complexity, three-dimensional topology, and unexpected zombie analogies in Eric Samperton's talk from UC Davis. Dive into how finite groups and geometric topology reveal surprising insights!

About this video

Computation in geometric topology 14 December 2017 Abstract: Let G be a finite group, and let M be a three-manifold. I’ll discuss the computational complexity of the problem of counting homomorphisms of pi_1(M) to G. When G is nonabelian simple, we show that the problem is #P-complete. This conclusion holds even if we only consider integer homology three-spheres, or knot complements. The structure of the proof is inspired by topological quantum computing, except nothing is quantum. The main tools and ideas are Aut(G)-equivariant reversible circuits, joint surjectivity lemmas in group theory, mapping class group actions on G-representation sets, and stabilization results for G-covers a la Livingston and Dunfield-Thurston.

Video Information

Views
982

Total views since publication

Likes
9

User likes and reactions

Duration
01:03:20

Video length

Published
Dec 14, 2017

Release date

Quality
hd

Video definition

Related Trending Topics

LIVE TRENDS

This video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!

THIS VIDEO IS TRENDING!

This video is currently trending in United States under the topic 'reese witherspoon'.

Share This Video

SOCIAL SHARE

Share this video with your friends and followers across all major social platforms including X (Twitter), Facebook, Youtube, Pinterest, VKontakte, and Odnoklassniki. Help spread the word about great content!