Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 45 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 11 tok/s Pro
GPT-5 High 19 tok/s Pro
GPT-4o 88 tok/s Pro
Kimi K2 214 tok/s Pro
GPT OSS 120B 460 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
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)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Summary

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

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

Follow-Up Questions

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