Finite Group Databasebeta

#72277459

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

Aliases

No aliases for this group.

Splittings

FittingC7×#518 ⋊ C2×C3
Hall#11742936 ⋊ C3
HallΓL(1,𝔽8) ⋊ #3490
SylowC7 ⋊ C3×#3490

Subgroups

subgroupG/H
center, FrattiniC22C24×AGL(1,𝔽7)
commutator, socle, cosocleC22×C7C25×C3
FittingC7×#518C2×C3
hypercenter#518AGL(1,𝔽7)
hypocenterC7C3×#3490
LCSG ▷ C22×C7 ▷ C7
UCSC1 ◁ C22 ◁ #518

2656 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 23
transitive degreeμt(G) = 112

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

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

Polycyclic presentation:

2^5,3,2^2,7|b^2=g,c^a=cg,d^c=dh,e^b=eh,i^a=i^6,i^f=i^2

Conjugacy classes & character table

166 conjugacy classes — view the full character table.

Relationships

maximal subgroup ofAGL(1,𝔽7)×#3490, #72277632, #72277873
maximal normal subgroup ofAGL(1,𝔽7)×#3490, #72277632, #72277873

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