Bijection conjecture for mixed and bordered-mixed complexes
Statement
A finitely generated mixed complex is a mixed complex of the form used in the paper with finite generation understood in the source, and a bordered-mixed complex is a tuple where is a -complex, is a type structure over the bordered algebra of the torus, and is a -homotopy equivalence. Consider these objects up to weak equivalence. Bijection conjecture for mixed and bordered-mixed complexes. Finitely-generated mixed complexes up to weak equivalence and bordered-mixed complexes up to weak equivalence are in natural bijection. The conjecture asserts that the bordered and unbordered mixed-complex descriptions encode equivalent classification data; no resolution is supplied in the source.
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.