Finite Group Databasebeta

Dic4268 #72215674

order17072
automorphismAut(G) order 32778240
homologyAbelianization (H1) = C22 · Schur multiplier (H2) = C1

Aliases

dicyclicDic4268

Splittings

HallC11×C97 ⋊ Q16
SylowC97 ⋊ Dic44
SylowC11 ⋊ Dic388

Subgroups

subgroupG/H
centerC2D4268
commutator, cosocleC4×C11×C97C22
FrattiniC4C2×D1067
FittingC8×C11×C97C2
socle, prime radicalC2×C11×C97D4
hypercenterC8D1067
hypocenterC11×C97Q16
LCSG ▷ C4×C11×C97 ▷ C2×C11×C97 ▷ C11×C97
UCSC1 ◁ C2 ◁ C4 ◁ C8

36 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 124
transitive degreeμt(G) = 17072

A minimal faithful permutation representation — 2 generators on 124 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,117,118,119,120,121,122,123,124);(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,124)(30,123)(31,122)(32,121)(33,120)(34,119)(35,118)(36,117)(37,116)(38,115)(39,114)(40,113)(41,112)(42,111)(43,110)(44,109)(45,108)(46,107)(47,106)(48,105)(49,104)(50,103)(51,102)(52,101)(53,100)(54,99)(55,98)(56,97)(57,96)(58,95)(59,94)(60,93)(61,92)(62,91)(63,90)(64,89)(65,88)(66,87)(67,86)(68,85)(69,84)(70,83)(71,82)(72,81)(73,80)(74,79)(75,78)(76,77)

Polycyclic presentation:

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

Conjugacy classes & character table

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

Relationships

maximal subgroup ofDic8536, Dic12804
maximal normal subgroup ofDic8536
maximal quotient ofDic12804

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