Finite Group Databasebeta

#72268637

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

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC23#1270
commutatorC2×C42C4×C8
Frattini, cosocleC2×C4×#95C22
prime radicalC25#99
LCSG ▷ C2×C42 ▷ C22×C4 ▷ C22 ▷ C1
UCSC1 ◁ C23 ◁ C24×C4 ◁ C2×C4×#95 ◁ G
LECSG ▷ C2×C4×#95 ▷ C23×C4 ▷ C22 ▷ C1

1465 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=c,b^2=e,c^2=g,d^2=hj,f^2=j,b^a=bd,c^b=cf,d^a=dfh,d^b=dhj,d^c=di,f^a=fi,f^b=fj,g^b=gj,h^a=hj

Conjugacy classes & character table

112 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72268639
maximal normal subgroup of#72268639

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