Finite Group Databasebeta

Dic14824 #72292085

order59296
automorphism?
homologyAbelianization (H1) = C22 · Schur multiplier (H2) = C1

Aliases

dicyclicDic14824

Splittings

HallC17×C109 ⋊ Q32
SylowC109 ⋊ Dic136
SylowC17 ⋊ Dic872

Subgroups

subgroupG/H
centerC2D14824
commutator, cosocleC8×C17×C109C22
FrattiniC8C2×D1853
FittingC16×C17×C109C2
socle, prime radicalC2×C17×C109D8
hypercenterC16D1853
hypocenterC17×C109Q32
LCSG ▷ C8×C17×C109 ▷ C4×C17×C109 ▷ C2×C17×C109 ▷ C17×C109
UCSC1 ◁ C2 ◁ C4 ◁ C8 ◁ C16

48 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 158
transitive degreeμt(G) = 59296

A minimal faithful permutation representation — 2 generators on 158 points:

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

Polycyclic presentation:

2^5,17,109|a^2=e,b^2=cd,c^2=de,d^2=e,b^a=bc,c^a=cd,d^a=de,f^a=f^16,g^a=g^108

Conjugacy classes & character table

14827 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", "g");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 17, 109]);;
gap> SetPower(coll, 1, F.5);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4*F.5);;
gap> SetPower(coll, 4, F.5);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 4, 1, F.4*F.5);;
gap> SetConjugate(coll, 6, 1, F.6^16);;
gap> SetConjugate(coll, 7, 1, F.7^108);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);