ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a circle graph, and let I(G)I(G) be its independence complex. The size of the input is measured by the number of vertices of GG. Polynomial-time homotopy-type conjecture. The homotopy type of I(G)I(G) can be found in polynomial time with respect to the number of vertices of GG.

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 44-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 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.