Polynomial-time Khovanov homology and spectrum conjecture for fixed-strand closed braids
Statement
Let be a closed braid with a fixed number of strands, and measure complexity with respect to the number of crossings of . Polynomial-time Khovanov conjecture.
Computing the Khovanov homology of and determining the homotopy type of the geometric realization of its Khovanov homology, namely its Khovanov spectrum, should have polynomial time complexity.
Computing Jones and HOMFLYPT polynomials is NP-hard, and existing Khovanov-homology programs have exponential complexity, whereas HOMFLYPT polynomials of closed braids with a fixed number of strands admit polynomial-growth algorithms. A polynomial-time algorithm for these Khovanov invariants would enable computational testing of structural conjectures.
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.