An algorithm computing homotopy groups.

DOI10.1016/S0378-4754(96)00021-3MaRDI QIDQ1565828zbMATH OpenOpenAlexWikidataFDO

Authors Pedro Real

Publication date 27 May 2003

Published in Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0378-4754(96)00021-3

zbMATH Keywords

computer algebrahomologyhomotopy groupstopology

Mathematics Subject Classification ID

Homotopy groups, general; sets of homotopy classes (55Q05) Spectral sequences and homology of fiber spaces in algebraic topology (55R20)

Recommendations

• An algorithm for low dimensional group homology.
• Computing the homology of groups: the geometric way.
• scientific article; zbMATH DE number 704014
• scientific article; zbMATH DE number 3106555
• Homological algebra programming.
• Discrete Geometry for Computer Imagery
• Algorithmically finite groups.

Cites work

• A combinatorial definition of homotopy groups
• Finite computability of Postnikov complexes
• scientific article; zbMATH DE number 3994552 (Why is no real title available?)
• scientific article; zbMATH DE number 3297895 (Why is no real title available?)
• The computability problem in algebraic topology

Cited in

(10)

• An algorithm for computing homology groups
• A combinatorial tool for computing the effective homotopy of iterated loop spaces
• An algorithm for low dimensional group homology.
• Computing simplicial representatives of homotopy group elements
• Extendability of continuous maps is undecidable
• Computing all maps into a sphere
• scientific article; zbMATH DE number 3106555 (Why is no real title available?)
• Rational homotopy type and computability
• P systems and computational algebraic topology
• Computing the homology of universal covers via effective homology and discrete vector fields

This page was built for publication: An algorithm computing homotopy groups.

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