GroupTheory
AgemoPGroup
construct an Agemo of a p-group
OmegaPGroup
construct an Omega of a p-group
Calling Sequence
Parameters
Description
Examples
AgemoPGroup( G )
AgemoPGroup( n, G )
OmegaPGroup( G )
OmegaPGroup( n, G )
G
-
: PermutationGroup; a permutation p-group, for a prime number p
n
: nonnegint; (optional) a non-negative integer, default n=1
If n is a non-negative integer, and G is a finite p-group, then the subgroup ℧n⁡G is defined to be the subgroup of G generated by elements of G of the form gpn, as g ranges over all elements of G.
The AgemoPGroup( n, G ) command computes the subgroup ℧n⁡G of G, where G is a permutation p-group, for some prime p.
The first argument n is optional and is equal to 1 by default. That is, the command AgemoPGroup( G ) is equivalent to AgemoPGroup( 1, G ).
For a p-group G, and a non-negative integer n, the subgroup Ωn⁡G is defined to be the subgroup generated by the elements g such that gpn = 1, for g∈G. That is, the subgroup generated by those members of G whose order divides pn.
The OmegaPGroup( n, G ) command computes Ωn⁡G for a permutation group G of prime power order.
When called with two arguments, n and G, the indicated subgroup Ωn⁡G is returned. When called with just one argument G, the subgroup Ω1⁡G is returned.
with⁡GroupTheory:
G ≔ DihedralGroup⁡8
G≔D8
A ≔ AgemoPGroup⁡G
A≔&Agemo;1⁡D8
IsCyclic⁡A
true
GroupOrder⁡A
4
A ≔ AgemoPGroup⁡2,G
A≔&Agemo;2⁡D8
2
AgemoPGroup⁡0,G
D8
G ≔ CyclicGroup⁡16807
G≔C16807
seq⁡GroupOrder⁡AgemoPGroup⁡n,G,n=0..5
16807,2401,343,49,7,1
G ≔ QuaternionGroup⁡5
G≔1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1617,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,1,31,9,232,30,10,223,29,11,214,28,12,205,27,13,196,26,14,187,25,15,178,24,16,32
W ≔ OmegaPGroup⁡G
W≔Ω1⁡1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,1617,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,1,31,9,232,30,10,223,29,11,214,28,12,205,27,13,196,26,14,187,25,15,178,24,16,32
GroupOrder⁡OmegaPGroup⁡2,G
32
G ≔ CyclicGroup⁡625
G≔C625
seq⁡GroupOrder⁡OmegaPGroup⁡n,G,n=0..4
1,5,25,125,625
While it is immediate from the definition that Ωn⁡G≤Ωn+1⁡G, for all n and any finite p-group G, equality may occur.
G ≔ SmallGroup⁡32,38:
GroupOrder⁡OmegaPGroup⁡1,G
16
However, we must eventually reach the entire group G.
GroupOrder⁡G=GroupOrder⁡OmegaPGroup⁡3,G
32=32
G ≔ WreathProduct⁡SmallGroup⁡27,4,CyclicGroup⁡3
G≔ < a permutation group on 81 letters with 4 generators >
W≔Ω1⁡ < a permutation group on 81 letters with 4 generators >
GroupOrder⁡W
19683
59049
G ≔ DirectProduct⁡QuaternionGroup⁡$4,CyclicGroup⁡4,DihedralGroup⁡16$3
G≔ < a permutation group on 84 letters with 15 generators >
GroupOrder⁡G
536870912
1048576
See Also
GroupTheory[CyclicGroup]
GroupTheory[DihedralGroup]
GroupTheory[DirectProduct]
GroupTheory[GroupOrder]
GroupTheory[IsCyclic]
GroupTheory[IsPGroup]
GroupTheory[QuaternionGroup]
GroupTheory[SmallGroup]
GroupTheory[WreathProduct]
Download Help Document