TY - JOUR AB - A central problem of algebraic topology is to understand the homotopy groups πœ‹π‘‘(𝑋) of a topological space X. For the computational version of the problem, it is well known that there is no algorithm to decide whether the fundamental group πœ‹1(𝑋) of a given finite simplicial complex X is trivial. On the other hand, there are several algorithms that, given a finite simplicial complex X that is simply connected (i.e., with πœ‹1(𝑋) trivial), compute the higher homotopy group πœ‹π‘‘(𝑋) for any given 𝑑β‰₯2 . However, these algorithms come with a caveat: They compute the isomorphism type of πœ‹π‘‘(𝑋) , 𝑑β‰₯2 as an abstract finitely generated abelian group given by generators and relations, but they work with very implicit representations of the elements of πœ‹π‘‘(𝑋) . Converting elements of this abstract group into explicit geometric maps from the d-dimensional sphere 𝑆𝑑 to X has been one of the main unsolved problems in the emerging field of computational homotopy theory. Here we present an algorithm that, given a simply connected space X, computes πœ‹π‘‘(𝑋) and represents its elements as simplicial maps from a suitable triangulation of the d-sphere 𝑆𝑑 to X. For fixed d, the algorithm runs in time exponential in size(𝑋) , the number of simplices of X. Moreover, we prove that this is optimal: For every fixed 𝑑β‰₯2 , we construct a family of simply connected spaces X such that for any simplicial map representing a generator of πœ‹π‘‘(𝑋) , the size of the triangulation of 𝑆𝑑 on which the map is defined, is exponential in size(𝑋) . AU - FilakovskΓ½, Marek AU - Franek, Peter AU - Wagner, Uli AU - Zhechev, Stephan Y ID - 6774 IS - 3-4 JF - Journal of Applied and Computational Topology SN - 2367-1726 TI - Computing simplicial representatives of homotopy group elements VL - 2 ER -