GroupTheory
SemiDihedralGroup
construct a semi-dihedral group as a permutation group or a finitely presented group
QuasiDihedralGroup
construct a quasi-dihedral group as a permutation group or a finitely presented group
Calling Sequence
Parameters
Description
Examples
SemiDihedralGroup( n, formopt )
QuasiDihedralGroup( n, formopt )
n
-
algebraic; understood to be an integer greater than 1
formopt
equation; (optional) equation of the form form = "fpgroup" or form = "permgroup" (default)
The semi-dihedral of degree n is a non-abelian group of order 8⁢n which contains a cyclic subgroup of order 4⁢n for n>1. It is defined by a presentation of the form
xy,|,xn=y2,,,xy=x-1
The SemiDihedralGroup( n ) command returns a semi-dihedral group, either as a permutation group (the default) or as a finitely presented group.
You can specify the form of the group returned explicitly by passing one of the options 'form' = "permgroup" or 'form' = "fpgroup".
If the parameter n is not a positive integer, then a symbolic group representing the semi-dihedral group of order 8*n is returned.
If n is a power of 2, the resulting group is a quasi-dihedral group. In other words, a quasi-dihedral group is a semi-dihedral 2-group. (This is analogous to the fact that a quaternion group is a dicyclic 2-group.) A semi-dihedral group is nilpotent only if it is quasi-dihedral.
The QuasiDihedralGroup( n ) command returns a quasi-dihedral group of order 2n−1, provided that n is an integer greater than 1. If n is a non-numeric algebraic expression, then a symbolic group representing the quasi-dihedral group of order 2n−1 is returned.
with⁡GroupTheory:
G≔SemiDihedralGroup⁡21
G≔SD21
GroupOrder⁡G
168
ClassNumber⁡G
48
IsNilpotent⁡G
false
IsSupersoluble⁡G
true
GroupOrder⁡DerivedSubgroup⁡G
21
IsCyclic⁡DerivedSubgroup⁡G
The center of a semi-dihedral group is always cyclic, but the order depends upon whether n is odd or even. For odd n, the center has order 4.
IsCyclic⁡Center⁡G
GroupOrder⁡Center⁡G
4
For even n, the center has order 2.
GroupOrder⁡Center⁡SemiDihedralGroup⁡20
2
seq⁡GroupOrder⁡Center⁡SemiDihedralGroup⁡n,n=2..20
2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2
The permutation representation used in Maple is always transitive, but imprimitive.
IsTransitive⁡G
IsPrimitive⁡G
Blocks⁡G
1,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,43,45,47,49,51,53,55,57,59,61,63,65,67,69,71,73,75,77,79,81,83,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,44,46,48,50,52,54,56,58,60,62,64,66,68,70,72,74,76,78,80,82,84
orseq⁡IsPrimitive⁡SemiDihedralGroup⁡n,n=2..20
andseq⁡IsTransitive⁡SemiDihedralGroup⁡n,n=2..20
Use the form = "fpgroup" option to construct a finitely presented semi-dihedral group.
G≔SemiDihedralGroup⁡6,form=fpgroup
G≔SD6
Note that dihedral and semi-dihedral groups of the same order are non-isomorphic.
AreIsomorphic⁡SemiDihedralGroup⁡4,DihedralGroup⁡16
Display⁡CharacterTable⁡SemiDihedralGroup⁡5
C
1a
2a
2b
2c
4a
4b
4c
4d
5a
5b
10a
10b
20a
20b
20c
20d
|C|
1
5
χ__1
χ__2
−1
−I
I
χ__3
χ__4
χ__5
χ__6
χ__7
χ__8
χ__9
−2
0
−2⁢I
2⁢I
−135−−125−1
−125−−135
−−135+−125+1
−135−−125
−1110+−1910
−1310+−1710
−−1310−−1710
−−1110−−1910
χ__10
χ__11
χ__12
χ__13
χ__14
χ__15
χ__16
G≔QuasiDihedralGroup⁡2
G≔QD2
16
seq⁡GroupOrder⁡QuasiDihedralGroup⁡n,n=2..8
16,32,64,128,256,512,1024
IsRegularPGroup⁡QuasiDihedralGroup⁡11
A≔QuasiDihedralGroup⁡3,form=fpgroup
A≔QD3
B≔SemiDihedralGroup⁡4,form=fpgroup
B≔SD4
AreIsomorphic⁡A,B
See Also
GroupTheory[CharacterTable]
GroupTheory[ClassNumber]
GroupTheory[GroupOrder]
Download Help Document