gap> n:=36;x:=PositionsProperty(List(AllSmallGroups(n)),G->Size(Center(G))=1); List(x,s->StructureDescription(SmallGroup(n,s))); 36 [ 9, 10 ] [ "(C3 x C3) : C4", ...
and irredundant list of isomorphism type representatives of groups is given.
Modular programming: putting functions together. How to check some conjecture for all groups of a given order. Objectives. Using the Small Groups Library.
If there are two arguments, a list gens and an element id , then Group( gens , id ) ... In the ordering given, they just add elm to the generators, remove duplicates ...
Primitive groups of equal degree and size are in no particular order. gap> g ...
A SmallGroups listing of all the finite groups of order up to 100, together
INTERNAL AD: Want to find out the GAP ID of a group using this wiki?
The output is a complete and irredundant list of isomorphism.
Given a linked list, write a function to reverse every k nodes (where k is an input to the function). Example: Input: 1->2->3->4->5->6->7->8- ...
Many specific finite groups have been considered, like for instance A4 [1], S4 [2], S3 [3], T7 [4], A5 [5],. ∆(27) [6], the group series ∆(6n2) [7], the ...