Algorithmic aspects of immersibility and embeddability

MaRDI QIDQ6507461arXivFDO

Authors Fedor Manin, Shmuel Weinberger

Mathematics Subject Classification ID

Embeddings and immersions in PL-topology (57Q35) Complexity of computation (including implicit computational complexity) (03D15) Immersions in differential topology (57R42)

Abstract: We analyze an algorithmic question about immersion theory: for which $m$, $n$, and $CAT=mathbfDiff$ or $mathbfPL$ is the question of whether an $m$-dimensional $CAT$-manifold is immersible in $mathbb{R}^n$ decidable? As a corollary, we show that the smooth embeddability of an $m$-manifold with boundary in $mathbb{R}^n$ is undecidable when $n-m$ is even and $11mgeq10n+1$.

This page was built for publication: Algorithmic aspects of immersibility and embeddability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6507461)