Finite Group Databasebeta

#72309706

order1024
nilpotency class4
automorphism?
homologyAbelianization (H1) = C22×C42 · Schur multiplier (H2) = C26×C4

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC23C2×#442
commutatorC2×C8C22×C42
Frattini, cosocleC23×C8C24
prime radicalC22×#466C22
LCSG ▷ C2×C8 ▷ C4 ▷ C2 ▷ C1
UCSC1 ◁ C23 ◁ C24×C4 ◁ C23×#97 ◁ G
LECSG ▷ C23×C8 ▷ C4 ▷ C2 ▷ C1

3437 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=e,b^2=h,d^2=e,f^2=i,h^2=i,i^2=j,b^a=bf,c^a=cg,c^b=cg,d^b=dij,e^b=ej,f^a=fi,f^d=fj,h^a=hi,h^d=hj,i^a=ij

Conjugacy classes & character table

136 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72309712, D4×#12647, #72309946, …
maximal normal subgroup of#72309712, D4×#12647, #72309946, …

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