Finite Group Databasebeta

Dic14523 #72291276

order58092
automorphism?
homologyAbelianization (H1) = C4 · Schur multiplier (H2) = C1

Aliases

dicyclicDic14523

Splittings

derived, HallC3×C47×C103 ⋊ C4
HallC47×C103 ⋊ Dic3
HallC3×C103 ⋊ Dic47
HallC3×C47 ⋊ Dic103
SylowC103 ⋊ Dic141
SylowC47 ⋊ Dic309
SylowC3 ⋊ Dic4841

Subgroups

subgroupG/H
center, Frattini, hypercenterC2D14523
commutator, hypocenterC3×C47×C103C4
Fitting, socle, prime radical, cosocleC2×C3×C47×C103C2
LCSG ▷ C3×C47×C103
UCSC1 ◁ C2

24 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 157
transitive degreeμt(G) = 58092

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

Polycyclic presentation:

2^2,3,47,103|a^2=b,c^a=c^2,d^a=d^46,e^a=e^102

Conjugacy classes & character table

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