Finite Group Databasebeta

D31625 #72301547

order63250
automorphism?
homologyAbelianization (H1) = C2 · Schur multiplier (H2) = C1

Aliases

dihedralD31625

Splittings

Fitting, derived, HallC11×C23×C125 ⋊ C2
HallC23×C125 ⋊ D11
HallC11×C125 ⋊ D23
HallC11×C23 ⋊ D125
SylowC125 ⋊ D253
SylowC23 ⋊ D1375
SylowC11 ⋊ D2875

Subgroups

subgroupG/H
center, hypercenterC1G
commutator, Fitting, cosocle, hypocenterC11×C23×C125C2
FrattiniC25D1265
socleC5×C11×C23D25
LCSG ▷ C11×C23×C125
UCSC1

32 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 159
transitive degreeμt(G) = 31625

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

Polycyclic presentation:

2,5,11,23,5^2|b^5=e,e^5=f,b^a=b^4e^4f^4,c^a=c^10,d^a=d^22,e^a=e^4f^4,f^a=f^4

Conjugacy classes & character table

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

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