Finite Group Databasebeta

#72226041

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

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC22#20609
commutatorC22×D4C23×C4
Frattini, cosocleC22×#41C24
prime radical#7819605C2
LCSG ▷ C22×D4 ▷ C23 ▷ C2 ▷ C1
UCSC1 ◁ C22 ◁ C22×C4 ◁ C22×H(5,𝔽2) ◁ G
LECSG ▷ C22×#41 ▷ C23 ▷ C2 ▷ C1

5891 conjugacy classes of subgroups.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|b^2=e,e^2=j,b^a=bf,c^a=chi,c^b=cg,d^b=dij,e^a=eh,e^d=ej,f^b=fh,f^c=fi,g^a=gi,g^f=gj,i^b=ij

Conjugacy classes & character table

73 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72226174, #72238428, #72262734, …
maximal normal subgroup of#72226174, #72238428, #72262734, …
maximal quotient of#72226043, #72226082, #72237585, …

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