#72298577

order	2048
nilpotency class	2
automorphism	?
homology	Abelianization (H₁) = C₂⁶ · Schur multiplier (H₂) = C₂¹⁶

Aliases

No aliases for this group.

Subgroups

	subgroup	G/H
center, commutator, Frattini, socle, cosocle	C₂⁵	C₂⁶
LCS	G ▷ C₂⁵ ▷ C₁
UCS	C₁ ◁ C₂⁵ ◁ G
LECS	G ▷ C₂⁵ ▷ C₁

At least 19312 conjugacy classes of subgroups; only the 5496 normal subgroups are shown.

Full subgroup data →

Presentation

minimal degree	μ(G) = 24
transitive degree	μ_t(G) = 256

A minimal faithful permutation representation — 6 generators on 24 points:

(2,4)(14,16)(17,18)(19,22)(20,21)(23,24);(2,4)(5,6,7,8)(10,12)(13,14)(15,16)(17,18,20,21)(19,23,24,22);(5,6)(7,8)(9,10)(11,12)(17,18)(19,22)(20,21)(23,24);(2,4)(6,8)(9,10,11,12)(18,21)(22,23);(6,8)(10,12)(17,19)(18,22)(20,24)(21,23);(1,2)(3,4)(5,6)(7,8)(9,10)(11,12)(17,18)(19,23)(20,21)(22,24)

Polycyclic presentation:

2^11|b^2=hk,d^2=hik,b^a=bh,c^b=ci,d^a=dij,d^b=di,d^c=di,e^b=ehk,e^c=ej,e^d=ehik,f^a=fg,f^b=fgi,f^d=fgi,f^e=fi

Conjugacy classes & character table

224 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72298631
maximal normal subgroup of	#72298631

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