Undecidability of simplicial-complex embeddability outside the metastable range
Statement
For fixed positive integers , let denote the decision problem that, given a finite simplicial complex of dimension , asks whether admits a piecewise-linear embedding into . The report proves that is algorithmically undecidable whenever .
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.