Polynomial-time homotopy-type conjecture for independence complexes of circle graphs
Statement
Let be a circle graph, and let be its independence complex. The size of the input is measured by the number of vertices of . Polynomial-time homotopy-type conjecture. The homotopy type of can be found in polynomial time with respect to the number of vertices of .
This algorithmic conjecture is closely related to Adamaszek's question and would imply polynomial-time determination of the extreme Khovanov spectrum in the relevant setting. The paper establishes polynomial-time computation for independence complexes associated with -braid diagrams, while the general circle-graph problem remains open.
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.