Finite Group Databasebeta

D4293 #72211366

order8586
automorphismAut(G) order 12054744
homologyAbelianization (H1) = C2 · Schur multiplier (H2) = C1

Aliases

dihedralD4293

Splittings

Fitting, derived, HallC53×C81 ⋊ C2
SylowC81 ⋊ D53
SylowC53 ⋊ D81

Subgroups

subgroupG/H
center, hypercenterC1G
commutator, Fitting, cosocle, hypocenterC53×C81C2
FrattiniC27D159
socleC3×C53D27
LCSG ▷ C53×C81
UCSC1

20 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 134
transitive degreeμt(G) = 4293

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

Polycyclic presentation:

2,3,53,3^3|b^3=d,d^3=e,e^3=f,b^a=b^2d^2e^2f^2,c^a=c^52,d^a=d^2e^2f^2,e^a=e^2f^2,f^a=f^2

Conjugacy classes & character table

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

Relationships

maximal subgroup ofC2×D4293, D12879, D21465, …
maximal normal subgroup ofC2×D4293
maximal quotient ofC2×D4293, Dic4293, D12879, …

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