Finite Group Databasebeta

#72332976

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

Aliases

No aliases for this group.

Subgroups

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

At least 7011 conjugacy classes of subgroups; only the 1103 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:

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

Polycyclic presentation:

2^10|a^2=i,b^2=fij,c^2=i,d^2=hi,e^2=fij,b^a=bf,d^a=dg,d^b=dfgij,d^c=dh,e^a=efj,e^c=efij,e^d=efgij

Conjugacy classes & character table

142 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72333231, #72333253, #72333340
maximal normal subgroup of#72333231, #72333253, #72333340

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