Computational Algebra Seminar: Eick -- A survey of algorithms for polycyclic groups

Speaker: Bettina Eick (Braunschweig)
Title: A survey of algorithms for polycyclic groups
Time & Place: 15.00-16.00, Thursday 26 Feb, SMRI Seminar Rm
Abstract:
What do polycyclic groups look like and how can one compute with such 
groups? The basics of this have been known for a long time and this 
talk recalls them briefly. It then describes various special types of
polycyclic groups and some of their algorithmic methods: finite soluble 
groups, finitely generated nilpotent groups, polycyclic crystallographic 
groups, polycyclic groups arising from algebraic number fields are interesting
examples. The talk also highlights some recent advances in this area and
mentions some open problems.