#72319600

order	1024
nilpotency class	4
automorphism	?
homology	Abelianization (H₁) = C₂⁵ · Schur multiplier (H₂) = C₂⁸

Aliases

No aliases for this group.

Subgroups

	subgroup	G/H
center, socle	C₂³	C₂³×D₈
commutator, Frattini, cosocle	C₂²×C₈	C₂⁵
LCS	G ▷ C₂²×C₈ ▷ C₄ ▷ C₂ ▷ C₁
UCS	C₁ ◁ C₂³ ◁ C₄×#123 ◁ C₈×#123 ◁ G
LECS	G ▷ C₂²×C₈ ▷ C₄ ▷ C₂ ▷ C₁

3328 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|b^2=fi,c^2=h,e^2=hj,f^2=ij,i^2=j,b^a=bf,c^a=cfg,c^b=cfij,d^c=dhj,e^a=eg,e^c=ehj,e^d=ehj,f^a=fi,f^c=fi,i^a=ij,i^c=ij

Conjugacy classes & character table

118 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72319668
maximal normal subgroup of	#72319668

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