Dic₅₀₅₀ #72216635

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

Aliases

dicyclic

Dic₅₀₅₀

Splittings

Hall	C₂₅×C₁₀₁ ⋊ Q₈
Sylow	C₁₀₁ ⋊ Dic₅₀
Sylow	C₂₅ ⋊ Dic₂₀₂

Subgroups

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

36 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degree	μ(G) = 134
transitive degree	μ_t(G) = 20200

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

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

Polycyclic presentation:

2^3,5,101,5|a^2=c,b^2=c,d^5=f,b^a=bc,d^a=d^4f^4,e^a=e^100,f^a=f^4

Conjugacy classes & character table

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

Relationships

maximal subgroup of	Dic₁₀₁₀₀, Dic₁₅₁₅₀
maximal normal subgroup of	Dic₁₀₁₀₀
maximal quotient 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");;
gap> coll := SingleCollector(F, [2, 2, 2, 5, 101, 5]);;
gap> SetPower(coll, 1, F.3);;
gap> SetPower(coll, 2, F.3);;
gap> SetPower(coll, 4, F.6);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 4, 1, F.4^4*F.6^4);;
gap> SetConjugate(coll, 5, 1, F.5^100);;
gap> SetConjugate(coll, 6, 1, F.6^4);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);

Dic5050 #72216635