Efficient collection in infinite polycyclic groups

  • Authors:

  • Volker Gebhardt

  • Affiliations:

  • School of Mathematics and Statistics, University of Sydney, Sydney, NSW 2006, Australia

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.