Papers
Topics
Authors
Recent
Search
2000 character limit reached

Extendability of simplicial maps is undecidable

Published 2 Aug 2020 in math.AT and cs.CG | (2008.00492v2)

Abstract: We present a short proof of the \v{C}adek-Kr\v{c}\'al-Matou\v{s}ek-Vok\v{r}\'inek-Wagner result from the title (in the following form due to Filakovsk\'y-Wagner-Zhechev). For any fixed even $l$ there is no algorithm recognizing the extendability of the identity map of $Sl$ to a PL map $X\to Sl$ of given $2l$-dimensional simplicial complex $X$ containing a subdivision of $Sl$ as a given subcomplex. We also exhibit a gap in the Filakovsk\'y-Wagner-Zhechev proof that embeddability of complexes is undecidable in codimension $>1$.

Citations (7)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.