Finite Group Databasebeta

#72268898

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

Aliases

No aliases for this group.

Splittings

Fitting3−1+2×#518 ⋊ C2
Sylow3−1+2 ⋊ #3484

Subgroups

subgroupG/H
centerC22C24×AGL(1,ℤ/9)
commutator, cosocleC22×C9C25×C3
Frattini, socleC22×C3C24×C3×D3
Fitting3−1+2×#518C2
hypercenter#518AGL(1,ℤ/9)
hypocenterC9C3×#3484
LCSG ▷ C22×C9 ▷ C9
UCSC1 ◁ C22 ◁ #518

5869 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 21
transitive degreeμt(G) = 144

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

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

Polycyclic presentation:

2^5,3,2^2,3^2|d^2=h,i^3=j,c^b=cg,d^a=dh,d^b=dh,d^c=dh,e^c=eh,i^b=i^2j^2,i^c=i^2j^2,i^f=ij,j^b=j^2,j^c=j^2

Conjugacy classes & character table

268 conjugacy classes — view the full character table.

Relationships

maximal subgroup ofAGL(1,ℤ/9)×#3484
maximal normal subgroup ofAGL(1,ℤ/9)×#3484

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