Finite Group Databasebeta

#72339924

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

Aliases

No aliases for this group.

Subgroups

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

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

Polycyclic presentation:

2^10|b^2=g,c^2=j,d^2=hij,b^a=bf,c^b=ci,d^a=dh,d^b=dfgij,d^c=dij,e^b=efhj,e^d=efhj

Conjugacy classes & character table

160 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72339934, #72339935, #72339937, …
maximal normal subgroup of#72339934, #72339935, #72339937, …
maximal quotient of#72340106

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