Finite Group Databasebeta

D9956 #72215050

order19912
automorphismAut(G) order 46594080
homologyAbelianization (H1) = C22 · Schur multiplier (H2) = C2

Aliases

dihedralD9956

Splittings

FittingC4×C19×C131 ⋊ C2
HallC19×C131 ⋊ D4
SylowC131 ⋊ D76
SylowC19 ⋊ D524

Subgroups

subgroupG/H
center, FrattiniC2C2×D2489
commutator, socle, cosocleC2×C19×C131C22
FittingC4×C19×C131C2
hypercenterC4D2489
hypocenterC19×C131D4
LCSG ▷ C2×C19×C131 ▷ C19×C131
UCSC1 ◁ C2 ◁ C4

32 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 154
transitive degreeμt(G) = 9956

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

Polycyclic presentation:

2^3,19,131|b^2=c,b^a=bc,d^a=d^18,e^a=e^130

Conjugacy classes & character table

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

Relationships

maximal subgroup ofD19912, D29868
maximal normal subgroup ofD19912
maximal quotient ofDic9956, D19912, D29868

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, 2, 2, 19, 131]);;
gap> SetPower(coll, 2, F.3);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 4, 1, F.4^18);;
gap> SetConjugate(coll, 5, 1, F.5^130);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);