Finite Group Databasebeta

#72309248

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

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC22#10018
commutatorC4×M16C22×C4
Frattini, cosocleC2×C4×M16C23
prime radicalC2×#33688C2
LCSG ▷ C4×M16 ▷ C2×C4 ▷ C2 ▷ C1
UCSC1 ◁ C22 ◁ C22×C4 ◁ C2×C4×M16 ◁ G
LECSG ▷ C2×C4×M16 ▷ C2×C4 ▷ C2 ▷ C1

1437 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=d,b^2=dg,d^2=i,f^2=hj,g^2=i,h^2=j,b^a=bg,c^a=cf,c^b=ce,d^b=di,d^c=dh,e^a=ei,f^b=fhi,f^c=fh,f^e=fj,g^b=gi,g^c=ghj,h^b=hj,h^c=hj,i^c=ij

Conjugacy classes & character table

70 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72309251
maximal normal subgroup of#72309251

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