Finite Group Databasebeta

#72299665

order1024
nilpotency class2
automorphism?
homologyAbelianization (H1) = C25 · Schur multiplier (H2) = C27×C42

Aliases

No aliases for this group.

Subgroups

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

15988 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 32
transitive degreeμt(G) = 512

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

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

Polycyclic presentation:

2^10|b^2=f,c^2=h,b^a=bj,c^a=ch,c^b=cfg,d^a=df,d^b=df,d^c=dfi,e^a=eh,e^b=eghij,e^c=eij,e^d=egh

Conjugacy classes & character table

118 conjugacy classes — view the full character table.

Relationships

Fitting subgroup of#72299680
maximal subgroup of#72299673, #72299680
maximal normal subgroup of#72299673, #72299680
maximal quotient of#72299919

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