Finite Group Databasebeta

#72306383

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

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC2#494682
commutatorC22×Q8C23×C4
Frattini, cosocleC2×#124C24
prime radical#6499860C2
LCSG ▷ C22×Q8 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1
UCSC1 ◁ C2 ◁ C23 ◁ #525 ◁ #62836 ◁ G
LECSG ▷ C2×#124 ▷ C2×C4 ▷ C22 ▷ C2 ▷ C1

2792 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=e,d^2=egj,e^2=i,f^2=j,g^2=j,h^2=j,b^a=bj,c^a=cij,c^b=cij,d^a=df,d^b=dfgj,d^c=dj,e^d=eh,f^a=fh,f^b=fj,f^c=fj,f^d=fhj,f^e=fij,g^a=ghj,g^b=gj,g^d=gh,g^e=gij,h^a=hi,h^d=hi,h^f=hj,h^g=hj,i^d=ij

Conjugacy classes & character table

76 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72306386
maximal normal subgroup of#72306386

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