#72332370

order	1024
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₁

32883 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degree	μ(G) = 28
transitive degree	μ_t(G) = 128

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

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

Polycyclic presentation:

2^10|b^2=gj,c^2=i,b^a=bg,c^a=ci,c^b=ci,d^a=dh,d^b=dh,d^c=dh,e^a=egj,e^b=egj,e^c=egj,f^a=fi,f^c=fi,f^d=fj

Conjugacy classes & character table

136 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72332391
maximal normal subgroup of	#72332391
maximal quotient of	#72333326

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