Finite Group Databasebeta

#72321904

order2048
nilpotency class4
automorphism?
homologyAbelianization (H1) = C23×C42 · Schur multiplier (H2) = C28×C4

Aliases

No aliases for this group.

Subgroups

subgroupG/H
centerC22×C4C2×#442
commutatorC2×C8C23×C42
Frattini, cosocleC2×C4×C8C25
socleC23C22×#442
prime radicalC2×#60673C22
LCSG ▷ C2×C8 ▷ C4 ▷ C2 ▷ C1
UCSC1 ◁ C22×C4 ◁ C23×C42 ◁ C23×#322 ◁ G
LECSG ▷ C2×C4×C8 ▷ C2×C4 ▷ C2 ▷ C1

10328 conjugacy classes of subgroups.

Full subgroup data →

Presentation

transitive degreeμt(G) = 512

Polycyclic presentation:

2^11|b^2=h,c^2=f,d^2=fghk,f^2=i,g^2=j,h^2=jk,j^2=k,c^a=ci,c^b=cg,d^b=dj,e^c=eik,f^b=fk,g^c=gj,g^d=gk,h^c=hjk,h^d=hk,j^c=jk

Conjugacy classes & character table

272 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72322017
maximal normal subgroup of#72322017

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