Finite Group Databasebeta

D11128 #72215819

order22256
automorphismAut(G) order 56619264
homologyAbelianization (H1) = C22 · Schur multiplier (H2) = C2

Aliases

dihedralD11128

Splittings

FittingC8×C13×C107 ⋊ C2
HallC13×C107 ⋊ D8
SylowC107 ⋊ D104
SylowC13 ⋊ D856

Subgroups

subgroupG/H
centerC2D5564
commutator, cosocleC4×C13×C107C22
FrattiniC4C2×D1391
FittingC8×C13×C107C2
socleC2×C13×C107D4
hypercenterC8D1391
hypocenterC13×C107D8
LCSG ▷ C4×C13×C107 ▷ C2×C13×C107 ▷ C13×C107
UCSC1 ◁ C2 ◁ C4 ◁ C8

44 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 128
transitive degreeμt(G) = 11128

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

Polycyclic presentation:

2^4,13,107|b^2=cd,c^2=d,b^a=bc,c^a=cd,e^a=e^12,f^a=f^106

Conjugacy classes & character table

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

Relationships

maximal subgroup ofD22256
maximal normal subgroup ofD22256
maximal quotient ofDic11128, D22256

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, 13, 107]);;
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^12);;
gap> SetConjugate(coll, 6, 1, F.6^106);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);