ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let bb be a braid with a fixed number of strands, let b^\widehat{b} denote its closure, and let the number of crossings of bb be the input size. Przytycki–Silvero conjecture. Computing the Khovanov homology Kh⁡(b^)\operatorname{Kh}(\widehat{b}) 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 33-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 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.