Computer Search for Nilpotent Complexes
    Robert H. Lewis and Guy D. Moore
    
    CONTENTS
    1. 2. 3. 4. Introduction Nilpotent Modules and Spaces Construction of Nilpotent Complexes Via Cellular Chains Computer Representation of Chain Complexes and Homology Modules 5. The Programs 6. An Alternate Approach and Future Work Electronic Availability References
    
    The concept of nilpotency for a topological space is a generalization of simple connectivity. That it is a fruitful generalization was shown by Dror, Kan, Bousfield, Hilton, and others. In 1977 Brown and Kahn proved that the dimension of a nilpotent complex can be read from the ordinary homology groups, just as in the case of a simply connected complex. They also showed that if a nilpotent complex has finite and nontrivial fundamental group, its dimension must be at least 3. In 1985 Lewis showed that for any finite nilpotent group there is a (not necessarily finite) three-dimensional nilpotent complex with that fundamental group. The smallest finite nilpotent group for which it was unknown whether a finite threedimensional nilpotent complex exists was Z 2 Z 6 . Z Z The authors, together with a team of undergraduate students at Fordham University, used computers to search for threedimensional finite nilpotent complexes over groups of the form Z n Z m . Such complexes were eventually found for Z 2 Z 6 , Z Z Z Z Z 2 Z 10 , and Z 3 Z 6 . Z Z Z Z This article 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 Z to matrices over Z p Z Z for various primes p. We conclude with a summary of the complexes discovered and open questions.
    
    1. INTRODUCTION
    
    Theorem 1.1.
    
    c A K Peters, Ltd. 1058-6458/1997 $0.50 per page Experimental Mathematics 6:3, page 239
    
    240
    
    Experimental Mathematics, Vol. 6 (1997), No. 3
    
    Theorem 1.2 (Whitehead).
    
    Theorem 1.3 (Whitehead).
    
    Theorem 1.4 (Dror). 2. NILPOTENT MODULES AND SPACES
    
    Lewis and Moore: Computer Search for Nilpotent Complexes
    
    241
    
    Definition 2.1.
    
    3. CONSTRUCTION OF NILPOTENT COMPLEXES VIA CELLULAR CHAINS
    
    (3.1)
    
    242
    
    Experimental Mathematics, Vol. 6 (1997), No. 3
    
    4. COMPUTER REPRESENTATION OF CHAIN COMPLEXES AND HOMOLOGY MODULES
    
    1.
    
    Theorem 3.1.
    
    2.
    
    Lewis and Moore: Computer Search for Nilpotent Complexes
    
    243
    
    4A. Representation of -modules
    
    (4.1)
    
    4C. Computation of Homology -modules
    
    Theorem 4.1.
    
    4B. Representation of Equivariant Chain Complexes
    
    244
    
    Experimental Mathematics, Vol. 6 (1997), No. 3
    
    5. THE PROGRAMS
    
    Lewis and Moore: Computer Search for Nilpotent Complexes
    
    245
    
    ELECTRONIC AVAILABILITY
    
    REFERENCES
    
    TABLE 1.
    
    6. AN ALTERNATE APPROACH AND FUTURE WORK
    
    246
    
    Experimental Mathematics, Vol. 6 (1997), No. 3

Add Comment

To add a comment, you need to login or signup (you can signup without leaving this page)