D₁₁₀₈₈ #72215840

order	22176
automorphism	Aut(G) order 31933440
homology	Abelianization (H₁) = C₂² · Schur multiplier (H₂) = C₂

Aliases

dihedral

D₁₁₀₈₈

Splittings

Fitting	C₇×C₉×C₁₁×C₁₆ ⋊ C₂
Hall	C₇×C₉×C₁₁ ⋊ D₁₆
Hall	C₉×C₁₁ ⋊ D₁₁₂
Hall	C₇×C₁₁ ⋊ D₁₄₄
Hall	C₇×C₉ ⋊ D₁₇₆
Sylow	C₁₁ ⋊ D₁₀₀₈
Sylow	C₉ ⋊ D₁₂₃₂
Sylow	C₇ ⋊ D₁₅₈₄

Subgroups

	subgroup	G/H
center	C₂	D₅₅₄₄
commutator, cosocle	C₇×C₈×C₉×C₁₁	C₂²
Frattini	C₃×C₈	C₂×D₂₃₁
Fitting	C₇×C₉×C₁₁×C₁₆	C₂
socle	C₂×C₃×C₇×C₁₁	D₂₄
hypercenter	C₁₆	D₆₉₃
hypocenter	C₇×C₉×C₁₁	D₁₆
LCS	G ▷ C₇×C₈×C₉×C₁₁ ▷ C₄×C₇×C₉×C₁₁ ▷ C₂×C₇×C₉×C₁₁ ▷ C₇×C₉×C₁₁
UCS	C₁ ◁ C₂ ◁ C₄ ◁ C₈ ◁ C₁₆

168 conjugacy classes of subgroups; only the 63 normal subgroups are shown.

normal subgroups only

This group has 168 conjugacy classes of subgroups — too many to draw. Only its 63 normal subgroups are shown.

Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.

Full subgroup data →

Presentation

minimal degree	μ(G) = 43
transitive degree	μ_t(G) = 11088

A minimal faithful permutation representation — 2 generators on 43 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);(2,16)(3,15)(4,14)(5,13)(6,12)(7,11)(8,10)(18,25)(19,24)(20,23)(21,22)(27,32)(28,31)(29,30)(34,43)(35,42)(36,41)(37,40)(38,39)

Polycyclic presentation:

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

Conjugacy classes & character table

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

Relationships

maximal subgroup of	D₂₂₁₇₆
maximal normal subgroup of	D₂₂₁₇₆
maximal quotient of	Dic₁₁₀₈₈, D₂₂₁₇₆

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