Computing Homotopy Types Using Crossed N-Cubes of Groups
classification
🧮 math.AT
keywords
algebraicdescriptionsgroupshomotopysomecasescompletelycomputable
read the original abstract
The aim of this paper is to explain how, through the work of a number of people, some algebraic structures related to groupoids have yielded algebraic descriptions of homotopy n-types. Further, these descriptions are explicit, and in some cases completely computable, in a way not possible with the traditional Postnikov systems, or with other models, such as simplicial groups.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.