Computational aspects of group extensions and their applications in topology
Dekimpe, Karel ; Eick, Bettina
Experiment. Math., Tome 11 (2002) no. 3, p. 183-200 / Harvested from Project Euclid
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.
Publié le : 2002-05-14
Classification:  Almost crystallographic groups,  algorithms for polycyclic groups,  torsion-free extensions,  Betti numbers,  20-04,  20F16,  57-04,  57M05,  57M07
@article{1062621214,
     author = {Dekimpe, Karel and Eick, Bettina},
     title = {Computational aspects of group extensions and their applications in topology},
     journal = {Experiment. Math.},
     volume = {11},
     number = {3},
     year = {2002},
     pages = { 183-200},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1062621214}
}
Dekimpe, Karel; Eick, Bettina. Computational aspects of group extensions and their applications in topology. Experiment. Math., Tome 11 (2002) no. 3, pp.  183-200. http://gdmltest.u-ga.fr/item/1062621214/