Are Two Given Maps Homotopic? An Algorithmic Viewpoint

Investor logo

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Science. Official publication website can be found on muni.cz.
Authors

FILAKOVSKÝ Marek VOKŘÍNEK Lukáš

Year of publication 2020
Type Article in Periodical
Magazine / Source Foundations of Computational Mathematics
MU Faculty or unit

Faculty of Science

Citation
Web https://doi.org/10.1007/s10208-019-09419-x
Doi http://dx.doi.org/10.1007/s10208-019-09419-x
Keywords Homotopy; Suspension; Polycyclic group; Algorithm
Description This paper presents two algorithms. The first decides the existence of a pointed homotopy between given simplicial maps f, g : X -> Y, and the second computes the group [Sigma X, Y]* of pointed homotopy classes of maps from a suspension; in both cases, the target Y is assumed simply connected. More generally, these algorithms work relative to A subset of X.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.