Finite Group Databasebeta

D30912 #72297192

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

Aliases

dihedralD30912

Splittings

FittingC3×C7×C23×C64 ⋊ C2
HallC3×C7×C23 ⋊ D64
HallC7×C23 ⋊ D192
HallC3×C23 ⋊ D448
SylowC23 ⋊ D1344
HallC3×C7 ⋊ D1472
SylowC7 ⋊ D4416
SylowC3 ⋊ D10304

Subgroups

subgroupG/H
centerC2D15456
commutator, cosocleC3×C7×C23×C32C22
FrattiniC32C2×D483
FittingC3×C7×C23×C64C2
socleC2×C3×C7×C23D32
hypercenterC64D483
hypocenterC3×C7×C23D64
LCSG ▷ C3×C7×C23×C32 ▷ C3×C7×C16×C23 ▷ C3×C7×C8×C23 ▷ C3×C4×C7×C23 ▷ C2×C3×C7×C23 ▷ C3×C7×C23
UCSC1 ◁ C2 ◁ C4 ◁ C8 ◁ C16 ◁ C32 ◁ C64

160 conjugacy classes of subgroups; only the 59 normal subgroups are shown.

normal subgroups only

This group has 160 conjugacy classes of subgroups — too many to draw. Only its 59 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) = 97
transitive degreeμt(G) = 30912

A minimal faithful permutation representation — 2 generators on 97 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,85,86,87,88,89,90,91,92,93,94,95,96,97);(2,64)(3,63)(4,62)(5,61)(6,60)(7,59)(8,58)(9,57)(10,56)(11,55)(12,54)(13,53)(14,52)(15,51)(16,50)(17,49)(18,48)(19,47)(20,46)(21,45)(22,44)(23,43)(24,42)(25,41)(26,40)(27,39)(28,38)(29,37)(30,36)(31,35)(32,34)(66,67)(69,74)(70,73)(71,72)(76,97)(77,96)(78,95)(79,94)(80,93)(81,92)(82,91)(83,90)(84,89)(85,88)(86,87)

Polycyclic presentation:

2^7,3,7,23|b^2=cd,c^2=de,d^2=ef,e^2=fg,f^2=g,b^a=bc,c^a=cd,d^a=de,e^a=ef,f^a=fg,h^a=h^2,i^a=i^6,j^a=j^22

Conjugacy classes & character table

15459 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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 3, 7, 23]);;
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*F.7);;
gap> SetPower(coll, 6, F.7);;
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, 6, 1, F.6*F.7);;
gap> SetConjugate(coll, 8, 1, F.8^2);;
gap> SetConjugate(coll, 9, 1, F.9^6);;
gap> SetConjugate(coll, 10, 1, F.10^22);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);