Efficient Collection in Infinite Polycyclic Groups

摘要

We present and analyse an algorithm for collection in polycyclic groups which has better complexity in terms of the exponents occurring in the collected words than previously used collection algorithms, and yields a much better performance especially for infinite polycyclic groups.