Computing homotopy classes for diagrams
From MaRDI portal
Publication:6050228
DOI10.1007/s00454-023-00513-0zbMath1529.55017arXiv2104.10152OpenAlexW3154638618MaRDI QIDQ6050228
Publication date: 12 October 2023
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.10152
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Obstruction theory in algebraic topology (55S35) Equivariant homotopy theory in algebraic topology (55P91)
Cites Work
- Finite computability of Postnikov complexes
- Constructive algebraic topology
- Are two given maps homotopic? An algorithmic viewpoint
- Algorithmic solvability of the lifting-extension problem
- Extendability of continuous maps is undecidable
- On the groups \(H(\Pi,n)\). I
- On the groups \(H(\Pi,n)\). II
- Effective homology for homotopy colimit and cofibrant replacement
- Heaps and unpointed stable homotopy theory
- Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the $r$-Metastable Range
- Computing All Maps into a Sphere
- Systems of Fixed Point Sets
- Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension
- Equivariant cohomology theories
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing homotopy classes for diagrams