Open Access
2002 Computational aspects of group extensions and their applications in topology
Karel Dekimpe, Bettina Eick
Experiment. Math. 11(2): 183-200 (2002).


We describe algorithms to determine extensions of infinite polycyclic groups having certain properties. In particular, we are interested in torsion-free extensions and extensions whose Fitting subgroup has a minimal centre. Then we apply these methods in topological applications. We discuss the calculation of Betti numbers for compact manifolds, and we describe algorithmic approaches in classifying almost Bieberbach groups.


Download Citation

Karel Dekimpe. Bettina Eick. "Computational aspects of group extensions and their applications in topology." Experiment. Math. 11 (2) 183 - 200, 2002.


Published: 2002
First available in Project Euclid: 3 September 2003

zbMATH: 1101.20302
MathSciNet: MR1959262

Primary: 20-04
Secondary: 20F16 , 57-04 , 57M05 , 57M07

Keywords: algorithms for polycyclic groups , Almost crystallographic groups , Betti numbers , torsion-free extensions

Rights: Copyright © 2002 A K Peters, Ltd.

Vol.11 • No. 2 • 2002
Back to Top