Finite Group Databasebeta

Dic5022 #72216618

order20088
automorphismAut(G) order 32542560
homologyAbelianization (H1) = C22 · Schur multiplier (H2) = C1

Aliases

dicyclicDic5022

Splittings

HallC31×C81 ⋊ Q8
SylowC81 ⋊ Dic62
SylowC31 ⋊ Dic162

Subgroups

subgroupG/H
centerC2C2×D2511
commutator, cosocleC2×C31×C81C22
FrattiniC2×C27C2×D93
FittingC4×C31×C81C2
socle, prime radicalC2×C3×C31C2×D27
hypercenterC4D2511
hypocenterC31×C81Q8
LCSG ▷ C2×C31×C81 ▷ C31×C81
UCSC1 ◁ C2 ◁ C4

60 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 120
transitive degreeμt(G) = 20088

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

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

Polycyclic presentation:

2^3,3,31,3^3|a^2=c,b^2=c,d^3=f,f^3=g,g^3=h,b^a=bc,d^a=d^2f^2g^2h^2,e^a=e^30,f^a=f^2g^2h^2,g^a=g^2h^2,h^a=h^2

Conjugacy classes & character table

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

Relationships

maximal subgroup ofDic10044, Dic15066
maximal normal subgroup ofDic10044
maximal quotient ofDic15066

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