Determine the decidability and computational complexity of deciding whether a given 2-complex embeds in a 3-manifold, including the case of non-orientable surfaces of even…
Statement
Determine the decidability and computational complexity of deciding whether a given 2-complex embeds in a 3-manifold, including the case of non-orientable surfaces of even Euler genus and the related thickenability problem.
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.