Finite Group Databasebeta

Dic3916 #72215246

order15664
automorphismAut(G) order 27568640
homologyAbelianization (H1) = C22 · Schur multiplier (H2) = C1

Aliases

dicyclicDic3916

Splittings

HallC11×C89 ⋊ Q16
SylowC89 ⋊ Dic44
SylowC11 ⋊ Dic356

Subgroups

subgroupG/H
centerC2D3916
commutator, cosocleC4×C11×C89C22
FrattiniC4C2×D979
FittingC8×C11×C89C2
socle, prime radicalC2×C11×C89D4
hypercenterC8D979
hypocenterC11×C89Q16
LCSG ▷ C4×C11×C89 ▷ C2×C11×C89 ▷ C11×C89
UCSC1 ◁ C2 ◁ C4 ◁ C8

36 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 116
transitive degreeμt(G) = 15664

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

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

Polycyclic presentation:

2^4,11,89|a^2=d,b^2=cd,c^2=d,b^a=bc,c^a=cd,e^a=e^10,f^a=f^88

Conjugacy classes & character table

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

Relationships

maximal subgroup ofDic7832, Dic11748
maximal normal subgroup ofDic7832
maximal quotient ofDic11748

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, 2, 11, 89]);;
gap> SetPower(coll, 1, F.4);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 5, 1, F.5^10);;
gap> SetConjugate(coll, 6, 1, F.6^88);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);