On Postnikov-true families of complexes and the Adams completion

Aristide Delenau; Peter Hilton

Displaying similar documents to “On Postnikov-true families of complexes and the Adams completion”

Localization of nilpotent fibre maps.

Irene Llerena (1982)

Collectanea Mathematica

Similarity:

Restoration of structure

Peter Hilton, Joseph Roitberg (1981)

Cahiers de Topologie et Géométrie Différentielle Catégoriques

Similarity:

Infinitesimal computations in topology

Dennis Sullivan (1977)

Publications Mathématiques de l'IHÉS

Similarity:

Cochains and homotopy type

Michael A. Mandell (2006)

Publications Mathématiques de l'IHÉS

Similarity:

Finite type nilpotent spaces are weakly equivalent if and only if their singular cochains are quasi-isomorphic as E algebras. The cochain functor from the homotopy category of finite type nilpotent spaces to the homotopy category of E algebras is faithful but not full.

Rational nilpotent groups as subgroups of self-homotopy equivalences

Salvina Piccarreta (2001)

Cahiers de Topologie et Géométrie Différentielle Catégoriques

Similarity:

Localization and cohomology of nilpotent groups

Peter Hilton (1973)

Cahiers de Topologie et Géométrie Différentielle Catégoriques

Similarity:

Nullification functors and the homotopy type of the classifying space for proper bundles.

Flores , Ramón J. (2005)

Algebraic & Geometric Topology

Similarity:

Relative epimorphisms and monomorphisms in homotopy theory

Peter Hilton, Joseph Roitberg (1987)

Compositio Mathematica

Similarity:

Nilpotent subgroups of the group of fibre homotopy equivalences.

Yves Félix, Jean-Claude Thomas (1995)

Publicacions Matemàtiques

Similarity:

Let ξ = (E, p, B, F) be a Hurewicz fibration. In this paper we study the space L(ξ) consisting of fibre homotopy self equivalences of ξ inducing by restriction to the fibre a self homotopy equivalence of F belonging to the group G. We give in particular conditions implying that π(L(ξ)) is finitely generated or that L(ξ) has the same rational homotopy type as aut(F).