#72306331

order	2048
nilpotency class	5
automorphism	?
homology	Abelianization (H₁) = C₂⁴×C₄ · Schur multiplier (H₂) = C₂¹⁰

Aliases

No aliases for this group.

Subgroups

	subgroup	G/H
center, socle	C₂	C₂×#496225
commutator	C₂²×Q₈	C₂⁴×C₄
Frattini, cosocle	C₂×#124	C₂⁵
prime radical	#72306293	C₂
LCS	G ▷ C₂²×Q₈ ▷ C₂×C₄ ▷ C₂² ▷ C₂ ▷ C₁
UCS	C₁ ◁ C₂ ◁ C₂⁴ ◁ C₂³×#41 ◁ C₂×#62812 ◁ G
LECS	G ▷ C₂×#124 ▷ C₂×C₄ ▷ C₂² ▷ C₂ ▷ C₁

At least 8007 conjugacy classes of subgroups; only the 1214 normal subgroups are shown.

Full subgroup data →

Presentation

Polycyclic presentation:

2^11|a^2=f,b^2=k,c^2=j,d^2=fhj,e^2=fgj,f^2=j,g^2=k,h^2=k,i^2=k,b^a=bj,d^a=dg,d^b=dghk,d^c=dghij,e^a=eh,e^b=eghk,e^c=eghij,e^d=egh,f^d=fi,f^e=fik,g^a=gi,g^c=gj,g^d=gik,g^e=gi,g^f=gjk,h^a=hik,h^c=hj,h^d=hik,h^e=hi,h^f=hjk,i^a=ij,i^d=ij,i^e=ij,i^g=ik,i^h=ik,j^d=jk,j^e=jk

Conjugacy classes & character table

128 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72306485
maximal normal subgroup of	#72306485
automorphism group of	#11917

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