Special polycyclic generating sequences for finite soluble groups

Polycyclic generating sequences are known to be a powerful tool in the design of practical and efficient algorithms for computing in finite soluble groups. Here we describe a further development: the so-called special polycyclic generating sequences. We give an overview of their properties and introduce a practical algorithm for determining a special polycyclic generating sequence in a given finite soluble group.