arXiv · 0908.3393
Can one classify finite Postnikov pieces?
Abstract
We compare the classical approach of constructing finite Postnikov systems by k-invariants and the global approach of Dwyer, Kan, and Smith. We concentrate on the case of 3-stage Postnikov pieces and provide examples where a classification is feasible. In general though the computational difficulty of the global approach is equivalent to that of the classical one.
Explore related subjects
Keep this discovery
Jesper M. Moller, Jerome Scherer. 2009-08-24. Can one classify finite Postnikov pieces?. https://doi.org/10.1112/blms%2Fbdq027
Cite the original work for its findings. Save a collection to share your selection of sources.