Computer Search for Nilpotent Complexes
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.
- scientific article; zbMATH DE number 4088510
- Computational experiments with nilpotent Lie algebras
- Computability of homotopy groups of nilpotent complexes
- Unified computational approach to nilpotent algebra classification problems
- Low-complexity computations for nilpotent subgroup problems
- Computing in Nilpotent Matrix Groups
- Computer Search for Large Sets of Idempotent Quasigroups
- Computing Schur complexes
- Complexity and nilpotent orbits
- Computing the homology of Koszul complexes
This page was built for publication: Computer Search for Nilpotent Complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376779)
