Finite Group Databasebeta

D21600 #72275176

order43200
automorphism?
homologyAbelianization (H1) = C22 · Schur multiplier (H2) = C2

Aliases

dihedralD21600

Splittings

FittingC25×C27×C32 ⋊ C2
HallC25×C27 ⋊ D32
SylowC27 ⋊ D800
SylowC25 ⋊ D864

Subgroups

subgroupG/H
centerC2D10800
commutator, cosocleC16×C25×C27C22
FrattiniC5×C9×C16C2×D15
FittingC25×C27×C32C2
socleC2×C3×C5D720
hypercenterC32D675
hypocenterC25×C27D32
LCSG ▷ C16×C25×C27 ▷ C8×C25×C27 ▷ C4×C25×C27 ▷ C2×C25×C27 ▷ C25×C27
UCSC1 ◁ C2 ◁ C4 ◁ C8 ◁ C16 ◁ C32

204 conjugacy classes of subgroups; only the 75 normal subgroups are shown.

normal subgroups only

This group has 204 conjugacy classes of subgroups — too many to draw. Only its 75 normal subgroups are shown.

Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.

Full subgroup data →

Presentation

minimal degreeμ(G) = 84
transitive degreeμt(G) = 21600

A minimal faithful permutation representation — 2 generators on 84 points:

(1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32)(33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59)(60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84);(2,32)(3,31)(4,30)(5,29)(6,28)(7,27)(8,26)(9,25)(10,24)(11,23)(12,22)(13,21)(14,20)(15,19)(16,18)(34,59)(35,58)(36,57)(37,56)(38,55)(39,54)(40,53)(41,52)(42,51)(43,50)(44,49)(45,48)(46,47)(61,84)(62,83)(63,82)(64,81)(65,80)(66,79)(67,78)(68,77)(69,76)(70,75)(71,74)(72,73)

Polycyclic presentation:

2^6,3,5,3,5,3|b^2=cd,c^2=de,d^2=ef,e^2=f,g^3=i,h^5=j,i^3=k,b^a=bc,c^a=cd,d^a=de,e^a=ef,g^a=g^2i^2k^2,h^a=h^4j^4,i^a=i^2k^2,j^a=j^4,k^a=k^2

Conjugacy classes & character table

10803 conjugacy classes. The character table is too large to display.

GAP

Past the SmallGroups library coverage — no SmallGroups id. Construct it from its polycyclic presentation:

gap> F := FreeGroup(IsSyllableWordsFamily, "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 3, 5, 3, 5, 3]);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4*F.5);;
gap> SetPower(coll, 4, F.5*F.6);;
gap> SetPower(coll, 5, F.6);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetPower(coll, 9, F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 4, 1, F.4*F.5);;
gap> SetConjugate(coll, 5, 1, F.5*F.6);;
gap> SetConjugate(coll, 7, 1, F.7^2*F.9^2*F.11^2);;
gap> SetConjugate(coll, 8, 1, F.8^4*F.10^4);;
gap> SetConjugate(coll, 9, 1, F.9^2*F.11^2);;
gap> SetConjugate(coll, 10, 1, F.10^4);;
gap> SetConjugate(coll, 11, 1, F.11^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);