Algorithmic solvability of the lifting-extension problem

DOI10.1007/s00454-016-9855-6zbMath1373.55018arXiv1307.6444OpenAlexW2963587701MaRDI QIDQ2358826

Lukáš Vokřínek, Marek Krčál, Martin Čadek

Publication date: 16 June 2017

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

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

zbMATH Keywords

homotopy classessimplicial complexesequivariantembeddabilityalgorithmic computationMoore-Postnikov towerlifting-extension problemequivariant fiberwise

Mathematics Subject Classification ID

Homotopy groups, general; sets of homotopy classes (55Q05) Equivariant operations and obstructions in algebraic topology (55S91)

Related Items (10)

Algorithmic solvability of the lifting-extension problem ⋮ Computing homotopy classes for diagrams ⋮ Rational homotopy type and computability ⋮ Hardness of almost embedding simplicial complexes in \(\mathbb {R}^d\) ⋮ Stability of intersections of graphs in the plane and the van Kampen obstruction ⋮ Decidability of the extension problem for maps into odd-dimensional spheres ⋮ A user's guide to the topological Tverberg conjecture ⋮ Are two given maps homotopic? An algorithmic viewpoint ⋮ Computing simplicial representatives of homotopy group elements ⋮ Invariants of graph drawings in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Survey article: an elementary illustrated introduction to simplicial sets
• Decidability of the extension problem for maps into odd-dimensional spheres
• Hardness of embedding simplicial complexes in \(\mathbb R^d\)
• Finite computability of Postnikov complexes
• Homologie des espaces fibrés
• Are two given maps homotopic? An algorithmic viewpoint
• Algorithmic solvability of the lifting-extension problem
• Extendability of continuous maps is undecidable
• Plongements de polyedres dans le domaine metastable
• Equivariant cohomology theories
• \(H\)-spaces from a homotopy point of view
• Obstruction theory in fiber spaces
• Moore-Postnikov systems for non-simple fibrations
• On the groups \(H(\Pi,n)\). II
• Effective chain complexes for twisted products
• Computing the abelian heap of unpointed stable homotopy classes of maps
• Heaps and unpointed stable homotopy theory
• Computing All Maps into a Sphere
• Constructing homotopy equivalences of chain complexes of free ZG-modules
• Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler

This page was built for publication: Algorithmic solvability of the lifting-extension problem