Finite Group Databasebeta

#72260190

order2232
automorphism?
homologyAbelianization (H1) = C2×C3 · Schur multiplier (H2) = C2

Aliases

No aliases for this group.

Splittings

Fitting, socleC22×C31 ⋊ C3×D3
derivedA4×C31 ⋊ C2×C3
SylowC31 ⋊ C3×S4

Subgroups

subgroupG/H
center, Frattini, hypercenterC1G
commutator, cosocle, hypocenterA4×C31C2×C3
Fitting, socleC22×C31C3×D3
LCSG ▷ A4×C31
UCSC1

48 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 35
transitive degreeμt(G) = 124

A minimal faithful permutation representation — 2 generators on 35 points:

(1,4,3,2)(6,10,11,7,8,12)(9,18,19,13,14,26)(15,28,29,21,22,34)(16,27,23,24,20,17)(25,35,32,31,30,33);(2,3,4)(5,6,9,15,23,11,10,16,25,32,19,27,18,22,30,29,34,35,28,14,20,26,33,31,24,8,12,17,21,13,7)

Polycyclic presentation:

2,3^2,31,2^2|c^a=c^2,d^a=d^30,d^b=d^25,e^a=ef,e^c=f,f^c=ef

Conjugacy classes & character table

35 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72260216, S4×D31⋊C3
maximal normal subgroup of#72260216, S4×D31⋊C3

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