Finite Group Databasebeta

#72246407

order28224
automorphism?
homologyAbelianization (H1) = C23×C32 · Schur multiplier (H2) = C23×C3

Aliases

No aliases for this group.

Splittings

FittingC72×#100 ⋊ C2×C32
Hall#72246218 ⋊ C32
HallΓL(1,𝔽8)2 ⋊ #453
SylowC72 ⋊ C32×#453

Subgroups

subgroupG/H
centerC2#72246104
commutator, cosocleC2×C4×C72C23×C32
FrattiniC2×C4C22×ΓL(1,𝔽8)⋊AGL(1,𝔽7)
FittingC72×#100C2×C32
socleC2×C72C32×#120
hypercenter#100ΓL(1,𝔽8)⋊AGL(1,𝔽7)
hypocenterC72C32×#453
LCSG ▷ C2×C4×C72 ▷ C2×C72 ▷ C72
UCSC1 ◁ C2 ◁ C2×C4 ◁ #100

2352 conjugacy classes of subgroups.

Full subgroup data →

Presentation

transitive degreeμt(G) = 168

Polycyclic presentation:

2^3,3^2,2^3,7^2|g^2=h,b^a=bg,c^a=ch,c^b=cf,f^a=fh,g^a=gh,g^b=gh,g^c=gh,i^a=i^6,i^b=i^6,i^d=j,i^e=i^2,j^a=j^6,j^b=j^6,j^d=i^5j^3,j^e=j^2

Conjugacy classes & character table

232 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#453×ΓL(1,𝔽8)⋊AGL(1,𝔽7)
maximal normal subgroup of#453×ΓL(1,𝔽8)⋊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", "j");;
gap> coll := SingleCollector(F, [2, 2, 2, 3, 3, 2, 2, 2, 7, 7]);;
gap> SetPower(coll, 7, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 2, F.7*F.8);;
gap> SetConjugate(coll, 7, 3, F.7*F.8);;
gap> SetConjugate(coll, 9, 1, F.9^6);;
gap> SetConjugate(coll, 9, 2, F.9^6);;
gap> SetConjugate(coll, 9, 4, F.10);;
gap> SetConjugate(coll, 9, 5, F.9^2);;
gap> SetConjugate(coll, 10, 1, F.10^6);;
gap> SetConjugate(coll, 10, 2, F.10^6);;
gap> SetConjugate(coll, 10, 4, F.9^5*F.10^3);;
gap> SetConjugate(coll, 10, 5, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);