Finite Group Databasebeta

#72231064

order5760
automorphism?
homologyAbelianization (H1) = C22 · Schur multiplier (H2) = C23

Aliases

No aliases for this group.

Splittings

FittingC3×C5×H(5,𝔽2) ⋊ C2×D3
derivedC3×C5×#997 ⋊ C22
SylowC5 ⋊ D3×#5935

Subgroups

subgroupG/H
center, Frattini, hypercenterC2#72231058
commutator, cosocle, hypocenterC3×C5×#997C22
FittingC3×C5×H(5,𝔽2)C2×D3
socleC2×C3×C5C2×#1020
LCSG ▷ C3×C5×#997
UCSC1 ◁ C2

1368 conjugacy classes of subgroups; only the 41 normal subgroups are shown.

normal subgroups only

This group has 1368 conjugacy classes of subgroups — too many to draw. Only its 41 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) = 16
transitive degreeμt(G) = 120

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

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

Polycyclic presentation:

2^2,3^2,5,2^5|f^2=j,g^2=j,c^a=c^2,d^b=d^2,e^a=e^4,e^b=e^4,f^a=fg,f^c=g,g^a=gj,g^c=fgj,g^f=gj,h^a=hi,h^c=i,h^g=hj,i^c=hi,i^f=ij

Conjugacy classes & character table

87 conjugacy classes — view the full character table.

Relationships

maximal subgroup ofD3×D5×#5935
maximal normal subgroup ofD3×D5×#5935

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