Abstract
We describe an algorithm which enables us to compute the homology of Ω(X 1 ⋎X 2) in terms of the homologies of ΩX 1 and ΩX 2 (where ΩX is the loop space ofX). A computer program implementing this algorithm is then presented.
Zusammenfassung
Wir beschreiben einen Algorithmus, der die Homologie von Ω(X 1 ⋎X 2) durch die Homologien von ΩX 1 und ΩX 2 ausdrückt (ΩX ist der Loopraum vonX). Eine Pascal-Implementierung des Algorithmus wird vorgestellt.
Similar content being viewed by others
References
Kan, D. M.: A combinatorial definition of homotopy groups. Ann. of Math.67, 282–312 (1958).
Katz, E.: A Kunneth formula for coproducts of simplicial groups. Proc. Amer. Math. Soc.61, 117–121 (1976).
Dula, G., Katz, E.: Computation of the homology of Ω(X ⋎ Y). To appear in Annali de Matematica Pura ed Applicata.
Jensen, K., Wirth, N.: PASCAL user manual and report, 2nd ed. Berlin-Heidelberg-New York: Springer 1976.
Knuth, D.: The art of computer-programming, Vol. 1: Fundamental algorithms, pp. 258–265. Addison-Wesley 1969.
Miller, C.: The topology of rotation groups. Ann. of Math.57, 90–114 (1953).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Glinert, E.P., Katz, E. Algorithm 40 An algorithm for the integral homology of certain topological groups. Computing 23, 381–391 (1979). https://doi.org/10.1007/BF02254866
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02254866