Coloring invariants of knots and links are often intractable

07/13/2019
by   Greg Kuperberg, et al.
0

Let G be a nonabelian, simple group with a nontrivial conjugacy class C ⊆ G. Let K be a diagram of an oriented knot in S^3, thought of as computational input. We show that for each such G and C, the problem of counting homomorphisms π_1(S^3∖ K) → G that send meridians of K to C is almost parsimoniously #P-complete. This work is a sequel to a previous result by the authors that counting homomorphisms from fundamental groups of integer homology 3-spheres to G is almost parsimoniously #P-complete. Where we previously used mapping class groups actions on closed, unmarked surfaces, we now use braid group actions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2022

Count-Free Weisfeiler–Leman and Group Isomorphism

We investigate the power of counting in Group Isomorphism. We first leve...
research
05/23/2018

Computational Complexity of Enumerative 3-Manifold Invariants

Fix a finite group G. We analyze the computational complexity of the pro...
research
10/31/2020

Shadowing for families of endomorphisms of generalized group shifts

Let G be a countable monoid and let A be an Artinian group (resp. an Art...
research
01/22/2002

Structure from Motion: Theoretical Foundations of a Novel Approach Using Custom Built Invariants

We rephrase the problem of 3D reconstruction from images in terms of int...
research
07/12/2017

Computational complexity and 3-manifolds and zombies

We show the problem of counting homomorphisms from the fundamental group...
research
09/26/2019

Coloring near-quadrangulations of the cylinder and the torus

Let G be a simple connected plane graph and let C_1 and C_2 be cycles in...

Please sign up or login with your details

Forgot password? Click here to reset