Generation of groups of square-free order. (Q2455751): Difference between revisions

Algorithms to deal fast and comprehensively with groups of square-free order are presented, aiming to support the following operations: count, list, build and identify. The presentation is nicely illustrated by examples and the timings are discussed: the time depends heavily on the chosen power-conjugate presentation (the shortest and the longest time differ by a factor of 100 for a sample of twenty randomly chosen presentations of the same group).