Finite Group Databasebeta

Dic15327 #72293344

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

Aliases

dicyclicDic15327

Splittings

derived, HallC9×C13×C131 ⋊ C4
HallC13×C131 ⋊ Dic9
HallC9×C131 ⋊ Dic13
SylowC131 ⋊ Dic117
HallC9×C13 ⋊ Dic131
SylowC13 ⋊ Dic1179
SylowC9 ⋊ Dic1703

Subgroups

subgroupG/H
center, hypercenterC2D15327
commutator, hypocenterC9×C13×C131C4
FrattiniC2×C3D5109
Fitting, cosocleC2×C9×C13×C131C2
socle, prime radicalC2×C3×C13×C131D3
LCSG ▷ C9×C13×C131
UCSC1 ◁ C2

36 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

Polycyclic presentation:

2^2,3,13,131,3|a^2=b,c^3=f,c^a=c^2f^2,d^a=d^12,e^a=e^130,f^a=f^2

Conjugacy classes & character table

15330 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", "f");;
gap> coll := SingleCollector(F, [2, 2, 3, 13, 131, 3]);;
gap> SetPower(coll, 1, F.2);;
gap> SetPower(coll, 3, F.6);;
gap> SetConjugate(coll, 3, 1, F.3^2*F.6^2);;
gap> SetConjugate(coll, 4, 1, F.4^12);;
gap> SetConjugate(coll, 5, 1, F.5^130);;
gap> SetConjugate(coll, 6, 1, F.6^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);