Finite Group Databasebeta

Dic13944 #72290289

order55776
automorphism?
homologyAbelianization (H1) = C22 · Schur multiplier (H2) = C1

Aliases

dicyclicDic13944

Splittings

HallC3×C7×C83 ⋊ Q32
HallC7×C83 ⋊ Dic24
HallC3×C83 ⋊ Dic56
SylowC83 ⋊ Dic168
HallC3×C7 ⋊ Dic664
SylowC7 ⋊ Dic1992
SylowC3 ⋊ Dic4648

Subgroups

subgroupG/H
centerC2D13944
commutator, cosocleC3×C7×C8×C83C22
FrattiniC8C2×D1743
FittingC3×C7×C16×C83C2
socle, prime radicalC2×C3×C7×C83D8
hypercenterC16D1743
hypocenterC3×C7×C83Q32
LCSG ▷ C3×C7×C8×C83 ▷ C3×C4×C7×C83 ▷ C2×C3×C7×C83 ▷ C3×C7×C83
UCSC1 ◁ C2 ◁ C4 ◁ C8 ◁ C16

96 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 125
transitive degreeμt(G) = 55776

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

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

Polycyclic presentation:

2^5,3,7,83|a^2=e,b^2=cd,c^2=de,d^2=e,b^a=bc,c^a=cd,d^a=de,f^a=f^2,g^a=g^6,h^a=h^82

Conjugacy classes & character table

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