Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 2 - Algorithms for polycyclic groups

  • Edited by C. M. Campbell, University of St Andrews, Scotland, M. R. Quick, University of St Andrews, Scotland, E. F. Robertson, University of St Andrews, Scotland, C. M. Roney-Dougal, University of St Andrews, Scotland, D. I. Stewart, University of Manchester
  • Book:
    Groups St Andrews 2022 in Newcastle
    Published online:
    21 November 2024
    Print publication:
    12 December 2024, pp 53-73

  • Summary

    This paper gives a survey about the currently used methods for computing with polycyclic groups. It discusses the different representations for polycyclic groups, gives a brief outline of many existing methods and considers two algorithms in a little more detail: the Frattini subgroup algorithm and the methods for solving the conjugacy problem. The final section of the paper exhibits some open problems.