Are two given maps homotopic? An algorithmic viewpoint

M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics (2019).


Journal Article | Epub ahead of print | English
Author
;
Department
Abstract
This paper presents two algorithms. The first decides the existence of a pointed homotopy between given simplicial maps 𝑓,𝑔:𝑋→𝑌, and the second computes the group [𝛴𝑋,𝑌]∗ 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 𝐴⊆𝑋.
Publishing Year
Date Published
2019-05-29
Journal Title
Foundations of Computational Mathematics
ISSN
eISSN
IST-REx-ID

Cite this

Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 2019. doi:10.1007/s10208-019-09419-x
Filakovský, M., & Vokřínek, L. (2019). Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. https://doi.org/10.1007/s10208-019-09419-x
Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics, 2019. https://doi.org/10.1007/s10208-019-09419-x.
M. Filakovský and L. Vokřínek, “Are two given maps homotopic? An algorithmic viewpoint,” Foundations of Computational Mathematics, 2019.
Filakovský M, Vokřínek L. 2019. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics.
Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics, Springer Nature, 2019, doi:10.1007/s10208-019-09419-x.

Link(s) to Main File(s)
Access Level
OA Open Access

Export

Marked Publications

Open Data IST Research Explorer

Sources

arXiv 1312.2337

Search this title in

Google Scholar