Finite Group Databasebeta

← Prev (#72338978) Next (#72338980) →

#72338979

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

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC2#72216484
commutatorC22×H(5,𝔽2)C42
Frattini, prime radical, cosocle#6628901C22
LCSG ▷ C22×H(5,𝔽2) ▷ C23×D4 ▷ C24 ▷ C22 ▷ C2 ▷ C1
UCSC1 ◁ C2 ◁ C22 ◁ C24 ◁ C23×D4 ◁ #6628901 ◁ G
LECSG ▷ #6628901 ▷ C23×D4 ▷ C24 ▷ C22 ▷ C2 ▷ C1

5133 conjugacy classes of subgroups; only the 48 normal subgroups are shown.

normal subgroups only

This group has 5133 conjugacy classes of subgroups — too many to draw. Only its 48 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 — 2 generators on 32 points:

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

Polycyclic presentation:

2^11|a^2=e,b^2=cd,c^2=k,g^2=k,b^a=bc,c^a=cg,c^b=cf,d^a=dfgk,d^b=df,e^b=eg,e^c=ehk,e^d=ehi,f^a=fi,f^e=fj,g^a=gh,g^b=gik,g^c=gk,g^e=gk,g^f=gk,h^a=hk,h^b=hj,h^d=hk,i^a=ij,i^b=ik,i^c=ik,i^d=ik,j^b=jk

Conjugacy classes & character table

50 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72338980, #72338999, #72339002, …
maximal normal subgroup of#72338980, #72338999, #72339002, …

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