Finite Group Databasebeta

#72306497

order2048
nilpotency class4
automorphism?
homologyAbelianization (H1) = C24×C4 · Schur multiplier (H2) = C215

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC22C2×#20585
commutatorC23×C4C24×C4
Frattini, cosocleC23×D4C25
prime radicalC2×#10586186C2
LCSG ▷ C23×C4 ▷ C22 ▷ C2 ▷ C1
UCSC1 ◁ C22 ◁ C23×C4 ◁ C2×#62811 ◁ G
LECSG ▷ C23×D4 ▷ C22 ▷ C2 ▷ C1

Only the 4384 normal subgroups are shown; non-normal subgroups are omitted.

Full subgroup data →

Presentation

Polycyclic presentation:

2^11|d^2=f,e^2=k,i^2=k,c^b=cj,d^a=dh,d^b=dk,d^c=dg,e^a=ek,e^d=ei,f^a=fk,f^e=fj,g^b=gk,h^d=hk,i^d=ijk,i^e=ik,i^f=ik,j^d=jk

Conjugacy classes & character table

200 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72306524
maximal normal subgroup of#72306524

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