Return to Colloquia & Seminar listing
Computational complexity and 3-manifolds and zombies
Student-Run Geometry/Topology SeminarSpeaker: | Eric Samperton, UC Davis |
Location: | 2112 MSB |
Start time: | Tue, Mar 10 2015, 1:10PM |
We show that counting homomorphisms from fundamental groups of 3-manifolds to a fixed target group G is hard, when G is a finite, nonabelian, simple group. More precisely, deciding if a 3-manifold has fundamental group which admits a nontrivial map to G is NP-complete, and computing the number of nontrivial maps is #P-complete. We will start by giving a brief introduction to the relevant complexity classes. We then explain how the problem reduces to understanding the action of the mapping class group of a surface with boundary on the set of homomorphisms from that surface's fundamental group to G. This is joint work with my advisor, Greg Kuperberg.