Finite Group Databasebeta

#72269511

order3520
automorphism?
homologyAbelianization (H1) = C24×C5 · Schur multiplier (H2) = C25

Aliases

No aliases for this group.

Splittings

FittingC2×C11×C22⋊C4 ⋊ C2×C5
Hall#10623021 ⋊ C5
HallC11⋊C5 ⋊ #546
SylowC11 ⋊ C5×#546

Subgroups

subgroupG/H
center, FrattiniC22C23×AGL(1,𝔽11)
commutator, socle, cosocleC22×C11C24×C5
FittingC2×C11×C22⋊C4C2×C5
hypercenterC2×C22⋊C4AGL(1,𝔽11)
hypocenterC11C5×#546
LCSG ▷ C22×C11 ▷ C11
UCSC1 ◁ C22 ◁ C2×C22⋊C4

668 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^4,5,2^2,11|c^2=g,d^2=g,c^b=cg,d^a=df,d^c=dg,h^c=h^10,h^e=h^9

Conjugacy classes & character table

145 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72269537, #546×AGL(1,𝔽11), #72269586
maximal normal subgroup of#72269537, #546×AGL(1,𝔽11), #72269586

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