Computing simplicial representatives of homotopy group elements-Reference-Cited by-同舟云学术

Computing simplicial representatives of homotopy group elements

Published:2018-09-25 Issue:3-4 Volume:2 Page:177-231
ISSN:2367-1726
Container-title:Journal of Applied and Computational Topology
language:en
Short-container-title:J Appl. and Comput. Topology

Author:

Filakovský Marek,Franek Peter,Wagner Uli,Zhechev Stephan

Funder

Austrian Science Fund

Publisher

Springer Science and Business Media LLC

Subject

General Earth and Planetary Sciences,General Environmental Science

Link

http://link.springer.com/content/pdf/10.1007/s41468-018-0021-5.pdf

Reference55 articles.

1. Adyan, S.I.: Algorithmic unsolvability of problems of recognition of certain properties of groups. Dokl. Akad. Nauk SSSR (NS) 103, 533–535 (1955)

2. Anick, D.J.: The computation of rational homotopy groups is # $$\wp $$ ℘ -hard. In: Proceedings of the Conference on Computers in Geometry and Topology, Chicago/IL, 1986, Lecture Notes in Pure and Application Mathematics, vol. 114, pp. 1–56 (1989)

3. Barratt, M.: Simplcial and Semisimplicial Complextes. Mimeographed Lecture Notes. Princeton University, Princeton (1956)

4. Berger, C.: An effective version of the Hurewicz theorem. Theses, Université Joseph-Fourier—Grenoble I, (1991). https://tel.archives-ouvertes.fr/tel-00339314

5. Berger, C.: Un groupoïde simplicial comme modèle de l’espace des chemins. Bull. Soc. Math. Fr. 123(1), 1–32 (1995)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithmic Aspects of Immersibility and Embeddability;International Mathematics Research Notices;2024-08-07

2. Computer Experiment in Teaching Mathematics;Doklady Mathematics;2023-07

3. COMPUTER EXPERIMENT IN TEACHING MATHEMATICS;Доклады Российской академии наук. Математика, информатика, процессы управления;2023-05-01