Finite Group Databasebeta

#72329976

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

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, commutator, Frattini, socle, cosocleC25C25
prime radicalC2×#16249C2
LCSG ▷ C25 ▷ C1
UCSC1 ◁ C25 ◁ G
LECSG ▷ C25 ▷ C1

At least 7069 conjugacy classes of subgroups; only the 1141 normal subgroups are shown.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|b^2=h,c^2=hi,e^2=gi,b^a=bj,c^a=ci,c^b=cf,d^b=dh,d^c=dhi,e^a=ei,e^b=efg,e^c=efhi,e^d=ei

Conjugacy classes & character table

148 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72331090, #72331237, #72331507
maximal normal subgroup of#72331090, #72331237, #72331507

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