Finite Group Databasebeta

← Prev (#72237983) Next (#72237985) →

#72237984

order2048
nilpotency class5
automorphism?
homologyAbelianization (H1) = C24 · Schur multiplier (H2) = C27

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC2#72216464
commutator, Frattini, cosocleC2×#381C24
LCSG ▷ C2×#381 ▷ C24 ▷ C22 ▷ C2 ▷ C1
UCSC1 ◁ C2 ◁ C23 ◁ C25 ◁ C2×#2613 ◁ G
LECSG ▷ C2×#381 ▷ C24 ▷ C22 ▷ C2 ▷ C1

7813 conjugacy classes of subgroups; only the 200 normal subgroups are shown.

normal subgroups only

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

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

Full subgroup data →

Presentation

transitive degreeμt(G) = 32

Polycyclic presentation:

2^11|c^2=j,d^2=k,e^2=ij,g^2=ik,b^a=bik,c^a=cf,c^b=cg,d^a=dhjk,d^c=de,e^a=ei,e^b=eh,e^c=eijk,e^d=eij,f^b=fik,f^d=fijk,g^a=gik,g^b=gik,g^c=gi,g^d=ghjk,g^e=gj,h^c=hj,h^d=hk,h^e=hk,h^g=hk,i^d=ik,j^b=jk,j^d=jk

Conjugacy classes & character table

71 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72237992, #72262537, #72262552
maximal normal subgroup of#72237992, #72262537, #72262552

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