Can one classify finite Postnikov systems?

TY - JOUR

T1 - Can one classify finite Postnikov systems?

AU - Møller, Jesper Michael

AU - Scherer, Jerome

PY - 2010/8

Y1 - 2010/8

N2 - 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

AB - 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

KW - Faculty of Science

U2 - 10.1112/blms/bdq027

DO - 10.1112/blms/bdq027

M3 - Journal article

SN - 0024-6093

VL - 42

SP - 661

EP - 672

JO - Bulletin of the London Mathematical Society

JF - Bulletin of the London Mathematical Society

IS - 4

ER -