Finite Group Databasebeta

#72218013

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

Aliases

No aliases for this group.

Splittings

Fitting, socle, derivedC32×C5×C7 ⋊ C22×C3
HallC32×C5×ΓL(1,𝔽8) ⋊ C22
HallC32×ΓL(1,𝔽8) ⋊ C2×D5
HallC5×C7 ⋊ C3×D32
SylowC7 ⋊ C3×(C3⋊D3)⋊D5
SylowC5 ⋊ (C3⋊AGL(1,𝔽7))⋊D3

Subgroups

subgroupG/H
center, Frattini, hypercenterC1G
commutator, Fitting, socle, cosocle, hypocenterC32×C5×C7C22×C3
LCSG ▷ C32×C5×C7
UCSC1

216 conjugacy classes of subgroups; only the 40 normal subgroups are shown.

normal subgroups only

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

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

Full subgroup data →

Presentation

Polycyclic presentation:

2^2,3^3,5,7|d^b=d^2,e^a=e^2,f^a=f^4,f^b=f^4,g^a=g^6,g^b=g^6,g^c=g^4

Conjugacy classes & character table

93 conjugacy classes — view the full character table.

Relationships

maximal subgroup ofD5×(C3⋊AGL(1,𝔽7))⋊D3, D32×C5⋊AGL(1,𝔽7), AGL(1,𝔽7)×(C3⋊D3)⋊D5
maximal normal subgroup ofD5×(C3⋊AGL(1,𝔽7))⋊D3, D32×C5⋊AGL(1,𝔽7), AGL(1,𝔽7)×(C3⋊D3)⋊D5

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