Finite Group Databasebeta

#72259959

order4800
automorphism?
homologyAbelianization (H1) = C23×C4 · Schur multiplier (H2) = C26

Aliases

No aliases for this group.

Splittings

FittingC3×C4×C52 ⋊ C22×C4
HallC3×C52 ⋊ C2×C4×D4
SylowC52 ⋊ C2×#893
SylowC3 ⋊ D4×D5⋊AGL(1,𝔽5)

Subgroups

subgroupG/H
center, FrattiniC2C2×D3×D5⋊AGL(1,𝔽5)
commutator, socleC2×C3×C52C23×C4
FittingC3×C4×C52C22×C4
prime radicalD52×D12C2
cosocleC2×C3×C5⋊D5C24
hypercenterC4D3×D5⋊AGL(1,𝔽5)
hypocenterC3×C52C2×C4×D4
LCSG ▷ C2×C3×C52 ▷ C3×C52
UCSC1 ◁ C2 ◁ C4

1892 conjugacy classes of subgroups.

Full subgroup data →

Presentation

transitive degreeμt(G) = 120

Polycyclic presentation:

2^6,3,5^2|a^2=e,b^2=e,c^2=e,d^2=e,b^a=bf,c^b=cf,g^d=g^2,h^a=h^2,h^b=h^3,h^c=h^3,h^d=h^3,h^e=h^4,i^a=h^3i^3,i^b=i^3,i^c=i^3,i^d=i^3,i^e=i^4

Conjugacy classes & character table

114 conjugacy classes — view the full character table.

Relationships

maximal subgroup ofD3×D4×D5⋊AGL(1,𝔽5)
maximal normal subgroup ofD3×D4×D5⋊AGL(1,𝔽5)

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