Finite Group Databasebeta

← Prev (#72339058) Next (#72339060) →

#72339059

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

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC2#72262839
commutator#2297C22×C4
Frattini, cosocle#35527C23
prime radical#72339039C2
LCSG ▷ #2297 ▷ C23×C4 ▷ C23 ▷ C2 ▷ C1
UCSC1 ◁ C2 ◁ C23 ◁ C23×C4 ◁ #35527 ◁ G
LECSG ▷ #35527 ▷ C23×C4 ▷ C23 ▷ C2 ▷ C1

2711 conjugacy classes of subgroups; only the 86 normal subgroups are shown.

normal subgroups only

This group has 2711 conjugacy classes of subgroups — too many to draw. Only its 86 normal subgroups are shown.

Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.

Full subgroup data →

Presentation

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

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

(4,16,17,18)(7,20,21,24)(8,22,23,25)(13,28,29,30);(1,2)(3,12)(4,8,17,23)(5,10)(6,11)(7,13,21,29)(9,19)(14,26)(15,27)(16,22,18,25)(20,28,24,30)(31,32);(1,3)(2,7)(4,13,17,29)(5,14,19,31)(6,15)(8,12,23,27)(9,20,10,24)(11,21)(16,28)(18,30)(22,32)(25,26)

Polycyclic presentation:

2^11|a^2=hj,b^2=hj,c^2=f,d^2=k,e^2=j,g^2=k,c^a=ce,c^b=cd,d^a=dg,d^b=djk,d^c=dij,e^b=egi,e^c=eh,e^d=ei,f^a=fhj,f^b=fijk,f^d=fk,f^e=fj,g^c=gi,g^d=gk,g^f=gk,h^b=hk,h^c=hj,h^d=hk,i^b=ik,i^c=ik,j^b=jk

Conjugacy classes & character table

56 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72339066
maximal normal subgroup of#72339066

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