Finite Group Databasebeta

#72335618

order1024
nilpotency class2
automorphism?
homologyAbelianization (H1) = C25 · Schur multiplier (H2) = C212

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, commutator, Frattini, socle, cosocleC25C25
LCSG ▷ C25 ▷ C1
UCSC1 ◁ C25 ◁ G
LECSG ▷ C25 ▷ C1

At least 8242 conjugacy classes of subgroups; only the 1689 normal subgroups are shown.

Full subgroup data →

Presentation

minimal degreeμ(G) = 20
transitive degreeμt(G) = 256

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

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

Polycyclic presentation:

2^10|a^2=f,b^2=fi,d^2=fghi,e^2=hj,b^a=bfj,c^a=cfj,c^b=cij,d^a=dg,d^b=dgh,d^c=dfi,e^a=efg,e^b=efghi,e^c=eij,e^d=efgij

Conjugacy classes & character table

172 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72335770, #72335780, #72335818
maximal normal subgroup of#72335770, #72335780, #72335818

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