Computer search for nilpotent complexes. (English) Zbl 0898.55010

The authors, together with a team of undergraduate students at Fordham University, used computers to search for three-dimensional finite nilpotent complexes over groups of the form \(\mathbb{Z}_n\oplus \mathbb{Z}_m\). Such complexes were eventually found for \(\mathbb{Z}_2\oplus \mathbb{Z}_6\), \(\mathbb{Z}_2\oplus \mathbb{Z}_{10}\), and \(\mathbb{Z}_3\oplus \mathbb{Z}_6\). The present paper describes the strategy for constructing nilpotent complexes of dimension three, and some of the issues in implementing the computer search. The main computational issues are “normalizing” matrices, especially to the Smith normal form, and mapping matrices over \(\mathbb{Z}\) to matrices over \(\mathbb{Z}_p\) for various primes \(p\). The authors conclude with a summary of the complexes discovered and open questions.


55P99 Homotopy theory


Full Text: DOI Euclid EuDML EMIS


[1] Brown K. S., Comment. Math. Helv. 52 (1) pp 111– (1977) · Zbl 0351.55009
[2] Dror, E. ”A generalization of the Whitehead theorem”. Symposium on Algebraic Topology. Edited by: Hilton, P. J. pp.13–22. Berlin: Springer. [Dror 1971], (Battelle Center, Seattle, 1971), Lecture Notes in Math. 249
[3] Lewis R. H., Trans. Amer. Math. Soc. 290 (2) pp 747– (1985)
[4] Lewis R. H., ”Fermat: A computer algebra system for Macs” (1996)
[5] Milnor J., Ann. of Math. (2) 63 pp 272– (1956) · Zbl 0071.17302
[6] DOI: 10.1007/978-1-4612-4576-6
[7] Snyder C. M., B.A. thesis, in: The search for three-dimensional nilpotent complexes of finite abelian fundamental group: an algorithm (1989)
[8] Spanier E. H., Algebraic topology (1966) · Zbl 0145.43303
[9] Xu J., Master’s thesis, in: On the construction of finite three-dimensional nilpotent spaces (1992)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.