In the ordering given, they just add elm to the generators, remove duplicates and identity elements, and test whether elm is already contained in G .
In general, having a group in GAP, information about the orders of its elements could be derived from its conjugacy classes and orders of their representatives, ...
The repair of such gaps resulted in the transfer of up to several kilobase pairs of information from a homologous template sequence to the site of P element ...
Just because the element of a group element is infinite does not necessarily mean that a computer program will be able to determine it. The documentation of ...
The first gap elements a[0..gap-1] are already in gapped order # keep adding one more element until the entire array is gap sorted for (i = gap; i < n; i += 1) ...
The default function GroupOps.SylowSubgroup computes the set of elements of p power order of G , starts with such an element of maximal order and computes ...
Every element of the sequence f is less than every element of the sequence g. A pregap ...
Here, we propose a new approach for increasing metasurface element dimensions and thereby relaxing fabrication constraints by using higher ...
10 ] ) gap> AvgOrdOfGroup(A); 2587393/259200 gap> time; 8108. Of course, for any given group the average order of its elements may be ...
Sorted lists (in general GAP implements a total ordering via < on all its objects, ...