Computational complexity and 3-manifolds and zombies
From MaRDI portal
Publication:6288926
Abstract: We show the problem of counting homomorphisms from the fundamental group of a homology -sphere to a finite, non-abelian simple group is #P-complete, in the case that is fixed and is the computational input. Similarly, deciding if there is a non-trivial homomorphism is NP-complete. In both reductions, we can guarantee that every non-trivial homomorphism is a surjection. As a corollary, for any fixed integer , it is NP-complete to decide whether admits a connected -sheeted covering. Our construction is inspired by universality results in topological quantum computation. Given a classical reversible circuit , we construct so that evaluations of with certain initialization and finalization conditions correspond to homomorphisms . An intermediate state of likewise corresponds to a homomorphism , where is a pointed Heegaard surface of of genus . We analyze the action on these homomorphisms by the pointed mapping class group and its Torelli subgroup . By results of Dunfield-Thurston, the action of is as large as possible when is sufficiently large; we can pass to the Torelli group using the congruence subgroup property of . Our results can be interpreted as a sharp classical universality property of an associated combinatorial -dimensional TQFT.
This page was built for publication: Computational complexity and 3-manifolds and zombies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6288926)