Finite Group Databasebeta

D27117 #72290445

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

Aliases

dihedralD27117

Splittings

Fitting, derived, HallC9×C23×C131 ⋊ C2
HallC23×C131 ⋊ D9
HallC9×C131 ⋊ D23
HallC9×C23 ⋊ D131
SylowC131 ⋊ D207
SylowC23 ⋊ D1179
SylowC9 ⋊ D3013

Subgroups

subgroupG/H
center, hypercenterC1G
commutator, Fitting, cosocle, hypocenterC9×C23×C131C2
FrattiniC3D9039
socleC3×C23×C131D3
LCSG ▷ C9×C23×C131
UCSC1

24 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 163
transitive degreeμt(G) = 27117

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

Polycyclic presentation:

2,3,23,131,3|b^3=e,b^a=b^2e^2,c^a=c^22,d^a=d^130,e^a=e^2

Conjugacy classes & character table

13560 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, 23, 131, 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^22);;
gap> SetConjugate(coll, 4, 1, F.4^130);;
gap> SetConjugate(coll, 5, 1, F.5^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);