Finite Group Databasebeta

#72227993

order1024
nilpotency class4
automorphism?
homologyAbelianization (H1) = C2×C42 · Schur multiplier (H2) = C2×C42

Aliases

No aliases for this group.

Subgroups

subgroupG/H
centerC2×C4#1560
commutatorC2×C42C2×C42
Frattini, cosocleC2×C43C23
socleC22#7631
prime radicalC25#99
LCSG ▷ C2×C42 ▷ C2×C4 ▷ C2 ▷ C1
UCSC1 ◁ C2×C4 ◁ C23×C4 ◁ C22×C43 ◁ G
LECSG ▷ C2×C43 ▷ C22×C4 ▷ C2 ▷ C1

2275 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 20
transitive degreeμt(G) = 32

A minimal faithful permutation representation — 3 generators on 20 points:

(5,6)(7,14,16,20,17,19,15,10)(8,12)(9,13)(11,18);(1,2,3,4)(5,7)(6,10)(8,16)(9,17)(11,19)(12,14)(13,20)(15,18);(7,15,17,16)(10,14,20,19)

Polycyclic presentation:

2^10|a^2=d,b^2=f,c^2=i,d^2=i,e^2=hj,g^2=j,b^a=be,c^a=ci,c^b=cgh,d^b=dg,e^a=egh,e^b=ehj,g^b=gj,h^a=hj,i^b=ij

Conjugacy classes & character table

136 conjugacy classes — view the full character table.

Relationships

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