Polynomial-time conjecture for Khovanov homology of fixed-strand closed braids
Statement
Let be a braid with a fixed number of strands, let denote its closure, and let the number of crossings of be the input size. Przytycki–Silvero conjecture. Computing the Khovanov homology of a closed braid with fixed number of strands has polynomial time complexity with respect to the number of crossings. The conjecture concerns whether the tractability known for the Jones polynomial of fixed-strand braid closures extends to Khovanov homology. The paper proves this in the case of -braids and studies related algorithms for more general braids, while the general fixed-strand claim remains open in the supplied context.
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.