Finite Group Databasebeta

#72268631

order1024
nilpotency class3
automorphism?
homologyAbelianization (H1) = C23×C4 · Schur multiplier (H2) = C24×C42

Aliases

No aliases for this group.

Subgroups

subgroupG/H
centerC22×C4D42
commutatorC23×C4C23×C4
Frattini, cosocleC24×C4C24
socleC23#2358
prime radicalC25H(5,𝔽2)
LCSG ▷ C23×C4 ▷ C2 ▷ C1
UCSC1 ◁ C22×C4 ◁ C24×C4 ◁ G
LECSG ▷ C24×C4 ▷ C2 ▷ C1

3971 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=e,b^2=e,c^2=h,d^2=gj,f^2=j,b^a=be,c^a=ci,c^b=cf,d^a=dfg,d^b=dg,d^c=di,f^b=fj,g^a=gj,h^b=hj

Conjugacy classes & character table

136 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72268636
maximal normal subgroup of#72268636

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