Finite Group Databasebeta

#72244693

order4032
automorphism?
homologyAbelianization (H1) = C23×C3 · Schur multiplier (H2) = C24

Aliases

No aliases for this group.

Splittings

FittingC22×C4×C7 ⋊ C2×C3×D3
SylowC7 ⋊ C3×D4×S4

Subgroups

subgroupG/H
center, FrattiniC2C2×S4×AGL(1,𝔽7)
commutator, cosocleC2×C7×A4C23×C3
FittingC22×C4×C7C2×C3×D3
socleC23×C7C22×C3×D3
hypercenterC4S4×AGL(1,𝔽7)
hypocenterC7×A4C2×C3×D4
LCSG ▷ C2×C7×A4 ▷ C7×A4
UCSC1 ◁ C2 ◁ C4

968 conjugacy classes of subgroups; only the 74 normal subgroups are shown.

normal subgroups only

This group has 968 conjugacy classes of subgroups — too many to draw. Only its 74 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) = 15
transitive degreeμt(G) = 84

A minimal faithful permutation representation — 3 generators on 15 points:

(1,2)(3,4)(5,7,8,6)(9,10,15)(11,12,14);(2,4)(10,11)(12,14)(13,15);(2,4)(7,8)

Polycyclic presentation:

2^3,3,2,3,7,2^2|c^a=ce,c^b=ce,f^a=f^2,f^c=f^2,g^b=g^6,g^d=g^4,h^f=i,i^a=hi,i^c=hi,i^f=hi

Conjugacy classes & character table

89 conjugacy classes — view the full character table.

Relationships

maximal subgroup ofD4×S4×AGL(1,𝔽7)
maximal normal subgroup ofD4×S4×AGL(1,𝔽7)

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