Finite Group Databasebeta

Dic10800 #72274841

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

Aliases

dicyclicDic10800

Splittings

HallC25×C27 ⋊ Q64
SylowC27 ⋊ Dic400
SylowC25 ⋊ Dic432

Subgroups

subgroupG/H
centerC2D10800
commutator, cosocleC16×C25×C27C22
FrattiniC5×C9×C16C2×D15
FittingC25×C27×C32C2
socle, prime radicalC2×C3×C5D720
hypercenterC32D675
hypocenterC25×C27Q64
LCSG ▷ C16×C25×C27 ▷ C8×C25×C27 ▷ C4×C25×C27 ▷ C2×C25×C27 ▷ C25×C27
UCSC1 ◁ C2 ◁ C4 ◁ C8 ◁ C16 ◁ C32

180 conjugacy classes of subgroups; only the 75 normal subgroups are shown.

normal subgroups only

This group has 180 conjugacy classes of subgroups — too many to draw. Only its 75 normal subgroups are shown.

Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.

Full subgroup data →

Presentation

minimal degreeμ(G) = 116
transitive degreeμt(G) = 43200

A minimal faithful permutation representation — 2 generators on 116 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,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34)(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);(1,33,17,49)(2,34,18,50)(3,35,19,51)(4,36,20,52)(5,37,21,53)(6,38,22,54)(7,39,23,55)(8,40,24,56)(9,41,25,57)(10,42,26,58)(11,43,27,59)(12,44,28,60)(13,45,29,61)(14,46,30,62)(15,47,31,63)(16,48,32,64)(66,91)(67,90)(68,89)(69,88)(70,87)(71,86)(72,85)(73,84)(74,83)(75,82)(76,81)(77,80)(78,79)(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^6,3,5,3,5,3|a^2=f,b^2=cd,c^2=de,d^2=ef,e^2=f,g^3=i,h^5=j,i^3=k,b^a=bc,c^a=cd,d^a=de,e^a=ef,g^a=g^2i^2k^2,h^a=h^4j^4,i^a=i^2k^2,j^a=j^4,k^a=k^2

Conjugacy classes & character table

10803 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", "h", "i", "j", "k");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 3, 5, 3, 5, 3]);;
gap> SetPower(coll, 1, F.6);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4*F.5);;
gap> SetPower(coll, 4, F.5*F.6);;
gap> SetPower(coll, 5, F.6);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetPower(coll, 9, F.11);;
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, 5, 1, F.5*F.6);;
gap> SetConjugate(coll, 7, 1, F.7^2*F.9^2*F.11^2);;
gap> SetConjugate(coll, 8, 1, F.8^4*F.10^4);;
gap> SetConjugate(coll, 9, 1, F.9^2*F.11^2);;
gap> SetConjugate(coll, 10, 1, F.10^4);;
gap> SetConjugate(coll, 11, 1, F.11^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);