On Cohomotopy-sets in computational topology:
Discussion of homotopy groups in computational topology:
Martin Čadek, Marek Krčál, Jiří Matoušek, Lukáš Vokřínek, Uli Wagner, Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension, SIAM J. Comput., 43(5), 1728–1780 (arXiv:1211.3093, doi:10.1137/120899029)
Martin Čadek, Marek Krčál, Jiří Matoušek, Lukáš Vokřínek, Uli Wagner, Extendability of continuous maps is undecidable, Discrete Comput Geom (2014) 51: 24 (arXiv:1302.2370, doi:10.1007/s00454-013-9551-8)
On persistent Cohomotopy and its improvement over well groups:
Peter Franek, Marek Krčál, On Computability and Triviality of Well Groups, Discrete Comput Geom (2016) 56: 126 (arXiv:1501.03641, doi:10.1007/s00454-016-9794-2)
Peter Franek, Marek Krčál, Persistence of Zero Sets, Homology, Homotopy and Applications, Volume 19 (2017) Number 2 (arXiv:1507.04310, doi:10.4310/HHA.2017.v19.n2.a16)
Peter Franek, Marek Krčál, Cohomotopy groups capture robust Properties of Zero Sets via Homotopy Theory, talk at ACAT meeting 2015 (pfd slides)
Peter Franek, Marek Krčál, Hubert Wagner, Solving equations and optimization problems with uncertainty, J Appl. and Comput. Topology (2018) 1: 297 (arxiv:1607.06344, doi:10.1007/s41468-017-0009-6)
Last revised on May 22, 2022 at 10:02:16. See the history of this page for a list of all contributions to it.