Dic₁₃₃₅₉ #72289104

order	53436
automorphism	?
homology	Abelianization (H₁) = C₄ · Schur multiplier (H₂) = C₁

Aliases

dicyclic

Dic₁₃₃₅₉

Splittings

derived, Hall	C₃×C₆₁×C₇₃ ⋊ C₄
Hall	C₆₁×C₇₃ ⋊ Dic₃
Hall	C₃×C₇₃ ⋊ Dic₆₁
Hall	C₃×C₆₁ ⋊ Dic₇₃
Sylow	C₇₃ ⋊ Dic₁₈₃
Sylow	C₆₁ ⋊ Dic₂₁₉
Sylow	C₃ ⋊ Dic₄₄₅₃

Subgroups

	subgroup	G/H
center, Frattini, hypercenter	C₂	D₁₃₃₅₉
commutator, hypocenter	C₃×C₆₁×C₇₃	C₄
Fitting, socle, prime radical, cosocle	C₂×C₃×C₆₁×C₇₃	C₂
LCS	G ▷ C₃×C₆₁×C₇₃
UCS	C₁ ◁ C₂

24 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degree	μ(G) = 141
transitive degree	μ_t(G) = 53436

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

Polycyclic presentation:

2^2,3,61,73|a^2=b,c^a=c^2,d^a=d^60,e^a=e^72

Conjugacy classes & character table

13362 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, 61, 73]);;
gap> SetPower(coll, 1, F.2);;
gap> SetConjugate(coll, 3, 1, F.3^2);;
gap> SetConjugate(coll, 4, 1, F.4^60);;
gap> SetConjugate(coll, 5, 1, F.5^72);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);

Dic13359 #72289104