Finite Group Databasebeta

#72284558

order1024
nilpotency class5
automorphism?
homologyAbelianization (H1) = C23×C4 · Schur multiplier (H2) = C28

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC22C22×AΣL(1,𝔽16)
commutatorC22×D4C23×C4
Frattini, cosocleC2×#127C24
prime radicalC2×#23906C2
LCSG ▷ C22×D4 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1
UCSC1 ◁ C22 ◁ C25 ◁ C24×C4 ◁ C23×#127 ◁ G
LECSG ▷ C2×#127 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1

5937 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=g,h^2=j,c^a=cf,c^b=ce,d^c=dj,f^a=fh,g^c=ghj,g^f=gij,h^a=hi,h^c=hj,h^f=hj,h^g=hj,i^a=ij,i^c=ij

Conjugacy classes & character table

82 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72284608, #72284755, #72284811, …
maximal normal subgroup of#72284608, #72284755, #72284811, …

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