IsRegular - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.

Online Help

All Products    Maple    MapleSim


GroupTheory

  

IsRegular

  

determine whether a permutation group is regular

  

IsSemiRegular

  

determine whether a permutation group is semi-regular

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

IsRegular( G, dom )

IsSemiRegular( G, dom )

Parameters

G

-

: PermutationGroup : a permutation group

dom

-

: {set,list}(posint) : (optional) a domain on which G acts

Description

• 

A permutation group G (acting on the set1,2,,n is semi-regular if the stabilizer of any point is trivial. If, in addition, G acts transitively, then it is said to be regular. This means that the action of G is permutation isomorphic  to the action of G on itself by (right) translation.

• 

Every Abelian transitive permutation group is regular.

• 

The IsRegular( G ) command returns true if the permutation group G is regular, and returns false otherwise. The IsSemiRegular( G ) command returns true if the permutation group G is semi-regular, and returns false otherwise. The group G must be an instance of a permutation group.

• 

The dom option can be used to specify the domain on which G acts.

• 

For regularity in the sense of P. Hall, for groups of prime power order, see GroupTheory[IsRegularPGroup].

Examples

withGroupTheory:

GGroupPerm1,2,Perm1,2,3,4,5

G1,2,34,5,1,2

(1)

IsRegularG

false

(2)

IsRegularCyclicGroup6

true

(3)

IsRegularCyclicGroup6,:-mindegree

false

(4)

GGroupPerm1,2,3,4

G1,23,4

(5)

IsSemiRegularG

true

(6)

IsRegularG

false

(7)

GGroupPerm1,2,3,4,5

G1,23,4,5

(8)

IsSemiRegularG

false

(9)

GGroupPerm2,3,4,Perm2,3

G2,3,4,2,3

(10)

IsSemiRegularG

false

(11)

IsSemiRegularGroupPerm2,3,4,Perm5,6,7

false

(12)

GGroupPerm1,2,3,4,5,6

G1,2,34,5,6

(13)

IsSemiRegularG

true

(14)

GGroupPerm1,2,3,Perm4,5,6

G1,2,3,4,5,6

(15)

IsSemiRegularG

false

(16)

IsRegularG,1,2,3

true

(17)

IsRegularG,4,5,6

true

(18)

The symmetric group in its natural permutation representation is not regular.

IsRegularSymm3

false

(19)

But there is a regular permutation representation of degree 6 (the order of the group).

IsRegularTransitiveGroup6,2

true

(20)

AreIsomorphicSymm3,TransitiveGroup6,2

true

(21)

The quaternion group of order 8 has a regular representation of degree 8.

AreIsomorphicTransitiveGroup8,5,QuaternionGroup

true

(22)

IsRegularTransitiveGroup8,5

true

(23)

We construct a diagonal embedding into the direct square.

GDirectProductTransitiveGroup8,5,TransitiveGroup8,5

G1,2,3,84,5,6,7,1,7,3,52,6,8,4,9,10,11,1612,13,14,15,9,15,11,1310,14,16,12

(24)

IsSemiRegularG

false

(25)

gensGeneratorsG:

This is the diagonal subgroup.

HSubgroupgens1·gens3,gens2·gens4,G

H1,2,3,84,5,6,79,10,11,1612,13,14,15,1,7,3,52,6,8,49,15,11,1310,14,16,12

(26)

AreIsomorphicH,QuaternionGroup

true

(27)

IsSemiRegularH

true

(28)

Frobenius groups are never regular.

IsRegularFrobeniusGroup15000,3

false

(29)

Let's find all the regular groups of degree 34. First, we create an iterator for all the transitive groups of that degree.

itAllTransitiveGroups34,output=iterator

it⟨Transitive Groups Iterator: 34/1 .. 34/115⟩

(30)

Create an Array in which to store the transitive group IDs of those that are found to be regular.

AArray:

Now iterate over the groups and check for regularity.  Since we already know that the groups are transitive, we avoid the redundant transitivity check and test only for semi-regularity.

forid,GinitdoifIsSemiRegularGthen`,=`A,idendifenddo:

seqA

34,1,34,2

(31)

See Also

GroupTheory

GroupTheory[CyclicGroup]

GroupTheory[FrobeniusGroup]

GroupTheory[Group]

GroupTheory[IsRegularPGroup]

GroupTheory[IsTransitive]

GroupTheory[Stabilizer]

GroupTheory[SymmetricGroup]

GroupTheory[TransitiveGroup]

Perm