Finite Group Databasebeta

D6060 #72212033

order12120
automorphismAut(G) order 9696000
homologyAbelianization (H1) = C22 · Schur multiplier (H2) = C2

Aliases

dihedralD6060

Splittings

FittingC3×C4×C5×C101 ⋊ C2
HallC3×C5×C101 ⋊ D4
HallC5×C101 ⋊ D12
HallC3×C101 ⋊ D20
SylowC101 ⋊ D60
HallC3×C5 ⋊ D404
SylowC5 ⋊ D1212
SylowC3 ⋊ D2020

Subgroups

subgroupG/H
center, FrattiniC2C2×D1515
commutator, socle, cosocleC2×C3×C5×C101C22
FittingC3×C4×C5×C101C2
hypercenterC4D1515
hypocenterC3×C5×C101D4
LCSG ▷ C2×C3×C5×C101 ▷ C3×C5×C101
UCSC1 ◁ C2 ◁ C4

64 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 113
transitive degreeμt(G) = 6060

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

Polycyclic presentation:

2^3,3,5,101|b^2=c,b^a=bc,d^a=d^2,e^a=e^4,f^a=f^100

Conjugacy classes & character table

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

Relationships

maximal subgroup ofD12120, D18180, D30300
maximal normal subgroup ofD12120
maximal quotient ofD12120, Dic6060, D18180, …

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, 101]);;
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^100);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);