---
_id: '6563'
abstract:
- lang: eng
  text: "This paper presents two algorithms. The first decides the existence of a
    pointed homotopy between given simplicial maps \U0001D453,\U0001D454:\U0001D44B→\U0001D44C,
    and the second computes the group [\U0001D6F4\U0001D44B,\U0001D44C]∗ 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 \U0001D434⊆\U0001D44B."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Marek
  full_name: Filakovský, Marek
  id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87
  last_name: Filakovský
- first_name: Lukas
  full_name: Vokřínek, Lukas
  last_name: Vokřínek
citation:
  ama: Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint.
    <i>Foundations of Computational Mathematics</i>. 2020;20:311-330. doi:<a href="https://doi.org/10.1007/s10208-019-09419-x">10.1007/s10208-019-09419-x</a>
  apa: Filakovský, M., &#38; Vokřínek, L. (2020). Are two given maps homotopic? An
    algorithmic viewpoint. <i>Foundations of Computational Mathematics</i>. Springer
    Nature. <a href="https://doi.org/10.1007/s10208-019-09419-x">https://doi.org/10.1007/s10208-019-09419-x</a>
  chicago: Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An
    Algorithmic Viewpoint.” <i>Foundations of Computational Mathematics</i>. Springer
    Nature, 2020. <a href="https://doi.org/10.1007/s10208-019-09419-x">https://doi.org/10.1007/s10208-019-09419-x</a>.
  ieee: M. Filakovský and L. Vokřínek, “Are two given maps homotopic? An algorithmic
    viewpoint,” <i>Foundations of Computational Mathematics</i>, vol. 20. Springer
    Nature, pp. 311–330, 2020.
  ista: Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic
    viewpoint. Foundations of Computational Mathematics. 20, 311–330.
  mla: Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic
    Viewpoint.” <i>Foundations of Computational Mathematics</i>, vol. 20, Springer
    Nature, 2020, pp. 311–30, doi:<a href="https://doi.org/10.1007/s10208-019-09419-x">10.1007/s10208-019-09419-x</a>.
  short: M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020)
    311–330.
date_created: 2019-06-16T21:59:14Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2023-08-17T13:50:44Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s10208-019-09419-x
external_id:
  arxiv:
  - '1312.2337'
  isi:
  - '000522437400004'
intvolume: '        20'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1312.2337
month: '04'
oa: 1
oa_version: Preprint
page: 311-330
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P31312
  name: Algorithms for Embeddings and Homotopy Theory
publication: Foundations of Computational Mathematics
publication_identifier:
  eissn:
  - '16153383'
  issn:
  - '16153375'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Are two given maps homotopic? An algorithmic viewpoint
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 20
year: '2020'
...