The groups of order 256 (Q810626): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 11:06, 30 January 2024

scientific article
Language Label Description Also known as
English
The groups of order 256
scientific article

    Statements

    The groups of order 256 (English)
    0 references
    0 references
    1991
    0 references
    The algorithm that has been used by the author for the complete classification of all (56092) groups of order 256 (up to isomorphism) was proposed by \textit{M. F. Newman} [Lect. Notes Math. 573, 73-84 (1977; Zbl 0519.20018)]. The author has described this algorithm and an implementation in detail in a previous paper [J. Symb. Comput. 9, 677-698 (1990; Zbl 0736.20001)]. This paper gives details of an extension of the algorithm that was necessary in order to be able also to classify the 5- and 6-generator groups among the groups of order 256 and gives a summary of the results of the computation. The complete list of these groups is available with the computational group theory systems CAYLEY and GAP in a form that allows further work with these groups using these computational group theory systems.
    0 references
    p-group generation
    0 references
    nilpotient quotient algorithm
    0 references
    5- and 6-generator groups
    0 references
    groups of order 256
    0 references
    CAYLEY
    0 references
    GAP
    0 references
    computational group theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references