Generation of groups of square-free order. (Q2455751)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5205235
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generation of groups of square-free order. |
scientific article; zbMATH DE number 5205235 |
Statements
Generation of groups of square-free order. (English)
0 references
26 October 2007
0 references
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).
0 references
finite group databases
0 references
groups of square-free order
0 references
algorithms
0 references
numbers of groups
0 references
power-conjugate presentations
0 references
0 references
0.8951578
0 references
0.89507914
0 references
0.8944301
0 references
0.8848747
0 references
0 references
0.88031965
0 references
0.8790095
0 references
