Finite Group Databasebeta

#72259391

order2688
automorphism?
homologyAbelianization (H1) = C25×C3 · Schur multiplier (H2) = C29

Aliases

No aliases for this group.

Splittings

FittingC7×D42 ⋊ C2×C3
Hall#11743676 ⋊ C3
HallΓL(1,𝔽8) ⋊ #3498
SylowC7 ⋊ C3×#3498

Subgroups

subgroupG/H
center, FrattiniC22C24×AGL(1,𝔽7)
commutator, socle, cosocleC22×C7C25×C3
FittingC7×D42C2×C3
hypercenterD42AGL(1,𝔽7)
hypocenterC7C3×#3498
LCSG ▷ C22×C7 ▷ C7
UCSC1 ◁ C22 ◁ D42

3496 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 19
transitive degreeμt(G) = 224

A minimal faithful permutation representation — 5 generators on 19 points:

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

Polycyclic presentation:

2^5,3,2^2,7|c^2=h,b^a=bg,c^a=ch,c^b=ch,d^a=dg,e^d=eh,i^c=i^6,i^f=i^4

Conjugacy classes & character table

157 conjugacy classes — view the full character table.

Relationships

maximal subgroup ofAGL(1,𝔽7)×#3498
maximal normal subgroup ofAGL(1,𝔽7)×#3498

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