Constructing groups of `small' order: recent results and open problems

DOI10.1007/978-3-319-70566-8_8MaRDI QIDQ4556573zbMATH OpenOpenAlexFDO

Authors B. Eick, Max Horn, A. Hulpke

Publication date 16 November 2018

Published in Algorithmic and Experimental Methods in Algebra, Geometry, and Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-70566-8_8

zbMATH Keywords

algorithmsenumerationdeterminationsmall groups

Mathematics Subject Classification ID

Automorphisms of abstract finite groups (20D45) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Extensions, wreath products, and other compositions of groups (20E22) History of group theory (20-03) Development of contemporary mathematics (01A65) Software, source code, etc. for problems pertaining to group theory (20-04)

Recommendations

• A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
• The groups of order at most 1000 except 512 and 768
• Construction of finite groups
• scientific article; zbMATH DE number 1302481
• Generation of groups of square-free order.

Cites work

• scientific article; zbMATH DE number 1195532 (Why is no real title available?)
• scientific article; zbMATH DE number 194815 (Why is no real title available?)
• scientific article; zbMATH DE number 1370593 (Why is no real title available?)
• scientific article; zbMATH DE number 5272192 (Why is no real title available?)
• scientific article; zbMATH DE number 3108440 (Why is no real title available?)
• A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
• Automorphism group computation and isomorphism testing in finite groups
• CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
• Construction of finite groups
• Counting groups: Gnus, Moas, and other exotica
• Groups and nilpotent Lie rings whose order is the sixth power of a prime.
• THE GROUPS OF ORDER qⁿ· p
• The \(p\)-group generation algorithm
• The construction of finite solvable groups revisited.
• The groups of order at most 2000
• The groups with order p^7 for odd prime p.

Cited in

(6)

• Groups whose orders factorise into at most four primes
• The construction of finite solvable groups revisited.
• The perfect groups of order up to two million
• On the number of groups of order 1024
• The enumeration of groups of order \(p^{n}q\) for \(n\leq 5\)
• Elementare Algorithmen aus der Gruppentheorie. (Elementary algorithms in group theory)

Describes a project that uses

Uses Software

• SglPPow
• GrpConst
• GroupExt
• AutPGrp
• SmallGroups Library
• ANUPQ
• GAP

This page was built for publication: Constructing groups of `small' order: recent results and open problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4556573)