Finite Group Databasebeta

#72242074

order5616
automorphism?
homologyAbelianization (H1) = C22×C3 · Schur multiplier (H2) = C22

Aliases

No aliases for this group.

Splittings

Fitting, socleC22×C3×C13 ⋊ C2×C3×D3
derivedC3×A4×C13 ⋊ C22×C3
SylowC13 ⋊ C3×D3×S4

Subgroups

subgroupG/H
center, Frattini, hypercenterC1G
commutator, cosocle, hypocenterC3×A4×C13C22×C3
Fitting, socleC22×C3×C13C2×C3×D3
LCSG ▷ C3×A4×C13
UCSC1

326 conjugacy classes of subgroups; only the 33 normal subgroups are shown.

normal subgroups only

This group has 326 conjugacy classes of subgroups — too many to draw. Only its 33 normal subgroups are shown.

Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.

Full subgroup data →

Presentation

minimal degreeμ(G) = 20
transitive degreeμt(G) = 156

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

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

Polycyclic presentation:

2^2,3^3,13,2^2|d^a=d^2,e^b=e^2,f^a=f^12,f^b=f^12,f^c=f^9,g^a=gh,g^d=h,h^d=gh

Conjugacy classes & character table

63 conjugacy classes — view the full character table.

Relationships

maximal subgroup ofD3×S4×D13⋊C3
maximal normal subgroup ofD3×S4×D13⋊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", "g", "h");;
gap> coll := SingleCollector(F, [2, 2, 3, 3, 3, 13, 2, 2]);;
gap> SetConjugate(coll, 4, 1, F.4^2);;
gap> SetConjugate(coll, 5, 2, F.5^2);;
gap> SetConjugate(coll, 6, 1, F.6^12);;
gap> SetConjugate(coll, 6, 2, F.6^12);;
gap> SetConjugate(coll, 6, 3, F.6^9);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 4, F.8);;
gap> SetConjugate(coll, 8, 4, F.7*F.8);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);