Dic₈₀₄₀ #72272445

order	32160
automorphism	?
homology	Abelianization (H₁) = C₂² · Schur multiplier (H₂) = C₁

Aliases

dicyclic

Dic₈₀₄₀

Splittings

Hall	C₃×C₅×C₆₇ ⋊ Q₃₂
Hall	C₅×C₆₇ ⋊ Dic₂₄
Hall	C₃×C₆₇ ⋊ Dic₄₀
Sylow	C₆₇ ⋊ Dic₁₂₀
Hall	C₃×C₅ ⋊ Dic₅₃₆
Sylow	C₅ ⋊ Dic₁₆₀₈
Sylow	C₃ ⋊ Dic₂₆₈₀

Subgroups

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

96 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degree	μ(G) = 107
transitive degree	μ_t(G) = 32160

A minimal faithful permutation representation — 2 generators on 107 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);(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,40)(38,39)(42,107)(43,106)(44,105)(45,104)(46,103)(47,102)(48,101)(49,100)(50,99)(51,98)(52,97)(53,96)(54,95)(55,94)(56,93)(57,92)(58,91)(59,90)(60,89)(61,88)(62,87)(63,86)(64,85)(65,84)(66,83)(67,82)(68,81)(69,80)(70,79)(71,78)(72,77)(73,76)(74,75)

Polycyclic presentation:

2^5,3,5,67|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^4,h^a=h^66

Conjugacy classes & character table

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

Relationships

maximal subgroup of	Dic₁₆₀₈₀
maximal normal subgroup of	Dic₁₆₀₈₀

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, 5, 67]);;
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^4);;
gap> SetConjugate(coll, 8, 1, F.8^66);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);

Dic8040 #72272445