Decidability of the extension problem for maps into odd-dimensional spheres

DOI10.1007/S00454-016-9835-XMaRDI QIDQ512251zbMATH OpenOpenAlexFDO

Authors Lukáš Vokřínek

Publication date 24 February 2017

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.3758

zbMATH Keywords

computationhigher differencehomotopy class

Mathematics Subject Classification ID

Equivariant homotopy theory in algebraic topology (55P91) Homotopy groups of special spaces (55Q52) Obstruction theory in algebraic topology (55S35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: In a recent paper, it was shown that the problem of existence of a continuous map $XoY$ extending a given map $AoY$ defined on a subspace $AsubseteqX$ is undecidable, even for $Y$ an even-dimensional sphere. In the present paper, we prove that the same problem for $Y$ an odd-dimensional sphere is decidable. More generally, the same holds for any $d$-connected target space $Y$ whose homotopy groups $p{i}_{k}Y$ are finite for $k>2d$.

Recommendations

• Extendability of continuous maps is undecidable
• Extending continuous maps, polynomiality and undecidability
• Computing all maps into a sphere
• Algorithmic solvability of the lifting-extension problem
• Extendability of certain maps

Cites work

• Algorithmic solvability of the lifting-extension problem
• Are two given maps homotopic? An algorithmic viewpoint
• Computing all maps into a sphere
• Extendability of continuous maps is undecidable
• scientific article; zbMATH DE number 206022 (Why is no real title available?)
• scientific article; zbMATH DE number 3198628 (Why is no real title available?)
• Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension
• Robust satisfiability of systems of equations

Cited in

(7)

• Computing simplicial representatives of homotopy group elements
• Algorithmic solvability of the lifting-extension problem
• Extendability of continuous maps is undecidable
• Extendability of simplicial maps is undecidable
• Computing all maps into a sphere
• Extending continuous maps, polynomiality and undecidability
• Rational homotopy type and computability

This page was built for publication: Decidability of the extension problem for maps into odd-dimensional spheres

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