Can one classify finite Postnikov pieces?

The classical approach of constructing finite Postnikov systems by k-invariants is compared with 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 difficul...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Bulletin of the London Mathematical Society 2010-08, Vol.42 (4), p.661-672
Hauptverfasser: Møller, Jesper M., Scherer, Jérôme
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The classical approach of constructing finite Postnikov systems by k-invariants is compared with 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. …all mathematics leads, doesn’t it, sooner or later, to some kind of human suffering. ‘Against the Day’, Thomas Pynchon
ISSN:0024-6093
1469-2120
DOI:10.1112/blms/bdq027