PermGroupOps.StrongGenerators( G )
PermGroupOps.StrongGenerators
returns a list of strong generators for
the permutation group G. If a stabilizer chain for G is already
known, PermGroupOps.StrongGenerators
returns a strong generating set
corresponding to this stabilizer chain. Otherwise a stabilizer chain
with the lexicographically smallest reduced base is computed and a strong
Stabilizer Chains).
gap> s4 := Group( (1,2,3,4), (1,2) );; gap> Base( s4 ); [ 1, 2, 3 ] gap> PermGroupOps.StrongGenerators( s4 ); [ (3,4), (2,3,4), (1,2), (1,2,3,4) ]
GAP 3.4.4