ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite group, let LL be a link, and define

HL(G)=∣Hom⁡(π1(S3∖L),G)∣.H_L(G)=\left|\operatorname{Hom}(\pi_1(S^3\setminus L),G)\right|.

An FPRAS is a fully polynomial randomized approximation scheme, and a group is solvable if it has a finite derived series terminating in the trivial group.

Finite-group link-invariant conjecture. (a) There exists an FPRAS for computing HL(G)H_L(G) for any finite group GG. (b) If GG is solvable, then there is a polynomial-time algorithm for exact computation of HL(G)H_L(G).

The invariant arises from the modular category Rep⁡(DG)\operatorname{Rep}(D G), where DGD G is the Drinfeld double of GG. Its computational complexity had not been studied in the source, so both the randomized approximation claim and the exact solvable-group claim were presented as conjectural.

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.