Papers
Topics
Authors
Recent
2000 character limit reached

Coloring invariants of knots and links are often intractable (1907.05981v1)

Published 13 Jul 2019 in math.GT, cs.CC, and math.GR

Abstract: Let $G$ be a nonabelian, simple group with a nontrivial conjugacy class $C \subseteq G$. Let $K$ be a diagram of an oriented knot in $S3$, thought of as computational input. We show that for each such $G$ and $C$, the problem of counting homomorphisms $\pi_1(S3\setminus K) \to G$ that send meridians of $K$ to $C$ is almost parsimoniously $\mathsf{#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 $\mathsf{#P}$-complete. Where we previously used mapping class groups actions on closed, unmarked surfaces, we now use braid group actions.

Citations (6)

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.