determine whether a permutation group is semi-primitive
determine whether a permutation group is quasi-primitive
IsSemiprimitive( G, domain )
IsQuasiprimitive( G, domain )
: PermutationGroup : a permutation group
: set(posint) : (optional) a G-invariant subset of the support of G
A permutation group G is quasi-primitive if each of its non-trivial normal subgroups is transitive.
A permutation group G is semi-primitive if each of its non-trivial normal subgroups either is transitive or semi-regular.
Because every non-trivial normal subgroup of a primitive permutation group is transitive, it is clear that semi-primitivity and quasi-primitivity are generalizations of primitivity. In particular, every primitive permutation group is both semi-primitive and quasi-primitive. It also follows from the definitions that a quasi-primitive permutation group is semi-primitive.
The IsQuasiprimitive( G ) command returns true if the permutation group G is quasi-primitive, and returns the value false otherwise.
The IsSemiprimitive( G ) command returns true if the permutation group G is semi-primitive, and returns false if it is not.
The optional domain argument, which must be a G-invariant set, can be used to specify a particular domain of action for G. By default, domain is equal to the support of G, that is, the set of points displaced by some element of G.
Since symmetric groups are primitive, they are also both semi-primitive and quasi-primitive.
G ≔ Symm⁡4
The cyclic group of order 6 is semi-primitive, but not quasi-primitive.
G ≔ CyclicGroup⁡6
G ≔ TransitiveGroup⁡24,707:
The following groups fail to be semi-primitive (hence, also quasi-primitive) since they are not even transitive.
G ≔ Group⁡Perm⁡1,2,3,Perm⁡4,5
G ≔ CyclicGroup⁡72,'mindegree'
orbs ≔ map⁡Elements,Orbits⁡G
A ≔ RestrictedPermGroup⁡G,orbs1
Download Help Document