Finite Group Databasebeta

#72209897

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

Aliases

No aliases for this group.

Splittings

Fitting, Sylow#7514145 ⋊ C3
derived#31077 ⋊ C2×C3

Subgroups

subgroupG/H
center, socleC2#58990⋊C3
commutator, cosocle, hypocenter#31077C2×C3
FrattiniC22×C4C2×C22⋊A4
Fitting#7514145C3
hypercenterC4#3532⋊C3
LCSG ▷ #31077
UCSC1 ◁ C2 ◁ C4

1123 conjugacy classes of subgroups; only the 22 normal subgroups are shown.

normal subgroups only

This group has 1123 conjugacy classes of subgroups — too many to draw. Only its 22 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,3,2^8|e^2=j,f^2=j,h^2=j,b^a=bi,c^a=cgij,c^b=cd,d^a=dg,d^b=c,e^b=ef,e^c=eh,e^d=eg,f^a=fj,f^b=e,f^c=fghij,f^d=fghj,f^e=fj,g^b=gi,g^c=gj,g^f=gj,h^a=hj,h^b=ghij,h^c=hj,h^d=hj,h^e=hj,i^b=gj,i^c=ij,i^d=ij,i^e=ij

Conjugacy classes & character table

35 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72209903
maximal normal subgroup of#72209903
maximal quotient of#72227867, #72228000, #72228050

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