Finite Group Databasebeta

D28325 #72291706

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

Aliases

dihedralD28325

Splittings

Fitting, derived, HallC11×C25×C103 ⋊ C2
HallC25×C103 ⋊ D11
HallC11×C103 ⋊ D25
HallC11×C25 ⋊ D103
SylowC103 ⋊ D275
SylowC25 ⋊ D1133
SylowC11 ⋊ D2575

Subgroups

subgroupG/H
center, hypercenterC1G
commutator, Fitting, cosocle, hypocenterC11×C25×C103C2
FrattiniC5D5665
socleC5×C11×C103D5
LCSG ▷ C11×C25×C103
UCSC1

24 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 139
transitive degreeμt(G) = 28325

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

Polycyclic presentation:

2,5,11,103,5|b^5=e,b^a=b^4e^4,c^a=c^10,d^a=d^102,e^a=e^4

Conjugacy classes & character table

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