Finite Group Databasebeta

D1020 #72210102

order2040
automorphismAut(G) order 261120
homologyAbelianization (H1) = C22 · Schur multiplier (H2) = C2

Aliases

dihedralD1020

Splittings

FittingC3×C4×C5×C17 ⋊ C2
HallC3×C5×C17 ⋊ D4
HallC5×C17 ⋊ D12
HallC3×C17 ⋊ D20
SylowC17 ⋊ D60
HallC3×C5 ⋊ D68
SylowC5 ⋊ D204
SylowC3 ⋊ D340

Subgroups

subgroupG/H
center, FrattiniC2C2×D255
commutator, socle, cosocleC2×C3×C5×C17C22
FittingC3×C4×C5×C17C2
hypercenterC4D255
hypocenterC3×C5×C17D4
LCSG ▷ C2×C3×C5×C17 ▷ C3×C5×C17
UCSC1 ◁ C2 ◁ C4

64 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 29
transitive degreeμt(G) = 1020

A minimal faithful permutation representation — 2 generators on 29 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);(2,4)(6,7)(9,12)(10,11)(14,29)(15,28)(16,27)(17,26)(18,25)(19,24)(20,23)(21,22)

Polycyclic presentation:

2^3,3,5,17|b^2=c,b^a=bc,d^a=d^2,e^a=e^4,f^a=f^16

Conjugacy classes & character table

513 conjugacy classes — view the full character table.

Relationships

maximal subgroup ofD3060, D2040, D5100, …
maximal normal subgroup ofD2040
maximal quotient ofD3060, D2040, D5100, …

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");;
gap> coll := SingleCollector(F, [2, 2, 2, 3, 5, 17]);;
gap> SetPower(coll, 2, F.3);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 4, 1, F.4^2);;
gap> SetConjugate(coll, 5, 1, F.5^4);;
gap> SetConjugate(coll, 6, 1, F.6^16);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);