Approximation and exact computation conjecture for finite-group link homomorphism invariants
Statement
Let be a finite group, let be a link, and define
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 for any finite group . (b) If is solvable, then there is a polynomial-time algorithm for exact computation of .
The invariant arises from the modular category , where is the Drinfeld double of . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.