Finite Group Databasebeta

D26883 #72290224

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

Aliases

dihedralD26883

Splittings

Fitting, derived, HallC9×C29×C103 ⋊ C2
HallC29×C103 ⋊ D9
HallC9×C103 ⋊ D29
HallC9×C29 ⋊ D103
SylowC103 ⋊ D261
SylowC29 ⋊ D927
SylowC9 ⋊ D2987

Subgroups

subgroupG/H
center, hypercenterC1G
commutator, Fitting, cosocle, hypocenterC9×C29×C103C2
FrattiniC3D8961
socleC3×C29×C103D3
LCSG ▷ C9×C29×C103
UCSC1

24 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 141
transitive degreeμt(G) = 26883

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

Polycyclic presentation:

2,3,29,103,3|b^3=e,b^a=b^2e^2,c^a=c^28,d^a=d^102,e^a=e^2

Conjugacy classes & character table

13443 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, 3, 29, 103, 3]);;
gap> SetPower(coll, 2, F.5);;
gap> SetConjugate(coll, 2, 1, F.2^2*F.5^2);;
gap> SetConjugate(coll, 3, 1, F.3^28);;
gap> SetConjugate(coll, 4, 1, F.4^102);;
gap> SetConjugate(coll, 5, 1, F.5^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);