Finite Group Databasebeta

#72264303

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

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC23C2×#386
commutatorC23×C4C23×C4
Frattini, cosocleC24×C4C24
prime radicalC22×#447C22
LCSG ▷ C23×C4 ▷ C22 ▷ C1
UCSC1 ◁ C23 ◁ C23×C42 ◁ G
LECSG ▷ C24×C4 ▷ C22 ▷ C1

5939 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=f,c^2=fh,d^2=eh,e^2=j,g^2=j,c^a=cfh,d^a=de,d^b=dg,d^c=dfhj,e^a=ei,e^b=ej,e^d=eij,f^d=fij,g^a=gj,g^b=gj,h^d=hij

Conjugacy classes & character table

112 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72264313, #72264346, #72264554
maximal normal subgroup of#72264313, #72264346, #72264554

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