Finite Group Databasebeta

#72241662

order7992
automorphism?
homologyAbelianization (H1) = C2×C9 · Schur multiplier (H2) = C2

Aliases

No aliases for this group.

Splittings

Fitting, socleC22×C37 ⋊ D3×C9
derivedA4×C37 ⋊ C2×C9
SylowC37 ⋊ C9×S4

Subgroups

subgroupG/H
center, Frattini, hypercenterC1G
commutator, hypocenterA4×C37C2×C9
Fitting, socleC22×C37D3×C9
prime radical#72241650C3
cosocleA4×C37⋊C3C2×C3
LCSG ▷ A4×C37
UCSC1

74 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 41
transitive degreeμt(G) = 148

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

(1,4,3,2)(6,22,36,12,26,21,15,11,24,7,14,34,9,28,13,16,8,20)(10,27,23,30,41,37,33,29,35,17,32,25,19,40,31,38,18,39);(2,3,4)(5,6,10,20,34,40,39,13,25,8,15,12,14,27,31,19,26,38,18,29,33,28,30,37,32,22,9,16,11,23,21,35,41,36,24,17,7)

Polycyclic presentation:

2,3^3,37,2^2|b^3=c,d^a=d^2,e^a=e^36,e^b=e^9,e^c=e^26,f^a=fg,f^d=g,g^d=fg

Conjugacy classes & character table

53 conjugacy classes — view the full character table.

Relationships

maximal subgroup ofS4×#66526⋊C2
maximal normal subgroup ofS4×#66526⋊C2

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