Finite Group Databasebeta

#72309253

order2048
nilpotency class6
automorphism?
homologyAbelianization (H1) = C2×C42 · Schur multiplier (H2) = C25×C4

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC22#152049
commutatorC4×M16C2×C42
Frattini, cosocleC2×#3151C23
prime radicalC2×#19745C22
LCSG ▷ C4×M16 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1
UCSC1 ◁ C22 ◁ C23 ◁ C23×C4 ◁ C2×C43 ◁ #6376438 ◁ G
LECSG ▷ C2×#3151 ▷ C42 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1

3315 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,11,14,18,13,20,15,19);(5,6,12,19)(7,11,8,15)(9,14,16,20)(10,13,17,18);(1,3,4,2)(6,13)(14,15)

Polycyclic presentation:

2^11|a^2=d,b^2=fg,c^2=dhi,d^2=j,f^2=ij,h^2=jk,i^2=k,b^a=bf,c^a=cj,c^b=ce,d^b=dijk,e^a=ej,e^b=ej,f^b=fh,f^c=fj,f^e=fk,g^a=ghij,g^b=gh,g^d=gj,g^f=gij,h^b=hi,h^g=hjk,i^b=ij,i^g=ik,j^b=jk

Conjugacy classes & character table

98 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72309267
maximal normal subgroup of#72309267

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