Displaying 221 – 240 of 306

Showing per page

Computing homology.

Kaczynski, Tomasz, Mischaikow, Konstantin, Mrozek, Marian (2003)

Homology, Homotopy and Applications

Computing Reidemeister classes

Davide Ferrario (1998)

Fundamenta Mathematicae

In order to compute the Nielsen number N(f) of a self-map f: X → X, some Reidemeister classes in the fundamental group π 1 ( X ) need to be distinguished. In this paper some algebraic results are given which allow distinguishing Reidemeister classes and hence computing the Reidemeister number of some maps. Examples of computations are presented.

Computing the abelian heap of unpointed stable homotopy classes of maps

Lukáš Vokřínek (2013)

Archivum Mathematicum

An algorithmic computation of the set of unpointed stable homotopy classes of equivariant fibrewise maps was described in a recent paper [4] of the author and his collaborators. In the present paper, we describe a simplification of this computation that uses an abelian heap structure on this set that was observed in another paper [5] of the author. A heap is essentially a group without a choice of its neutral element; in addition, we allow it to be empty.

Conjugation spaces.

Hausmann, Jean-Claude, Holm, Tara, Puppe, Volker (2005)

Algebraic & Geometric Topology

Connected covers and Neisendorfer's localization theorem

C. McGibbon, J. Møller (1997)

Fundamenta Mathematicae

Our point of departure is J. Neisendorfer's localization theorem which reveals a subtle connection between some simply connected finite complexes and their connected covers. We show that even though the connected covers do not forget that they came from a finite complex their homotopy-theoretic properties are drastically different from those of finite complexes. For instance, connected covers of finite complexes may have uncountable genus or nontrivial SNT sets, their Lusternik-Schnirelmann category...

Currently displaying 221 – 240 of 306