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.
- Publication:
-
arXiv e-prints
- Pub Date:
- August 2009
- DOI:
- 10.48550/arXiv.0908.3393
- arXiv:
- arXiv:0908.3393
- Bibcode:
- 2009arXiv0908.3393M
- Keywords:
-
- Mathematics - Algebraic Topology;
- 55S45 (Primary);
- 55R15;
- 55R70;
- 55P20;
- 22F50 (Secondary)
- E-Print:
- 13 pages