ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an integer ellell with ℓ≥3\ell\geq 3, let q=eπi/ℓq=e^{\pi i/\ell}, and let JL(q2)J_L(q^2) denote the Jones polynomial of a link LL evaluated at q2q^2. An FPRAS is a fully polynomial randomized approximation scheme, and RPRP and NPNP are the standard randomized and nondeterministic polynomial-time complexity classes.

Jones-polynomial FPRAS conjecture. There is no FPRAS for evaluating JL(q2)J_L(q^2) except at the special points ℓ∈{1,2,3,4,6}\ell\in\{1,2,3,4,6\}, provided RP≠NPRP\neq NP.

At the exceptional points the Jones polynomial degenerates to a classical link invariant computable in polynomial time, whereas exact evaluation is #P\#P-hard at the other roots of unity described in the paper. The conjecture concerns the stronger approximation-complexity question.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.