Finite Group Databasebeta

#72256764

order1024
nilpotency class2
automorphism?
homologyAbelianization (H1) = C26 · Schur multiplier (H2) = C214

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, commutator, Frattini, socle, cosocleC24C26
LCSG ▷ C24 ▷ C1
UCSC1 ◁ C24 ◁ G
LECSG ▷ C24 ▷ C1

At least 11363 conjugacy classes of subgroups; only the 4077 normal subgroups are shown.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|b^2=h,c^2=ghi,d^2=ij,b^a=bh,c^a=chi,c^b=cg,d^a=di,d^b=dj,e^c=eij,e^d=eij,f^a=fj,f^b=fj,f^d=fij,f^e=fj

Conjugacy classes & character table

142 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72256795
maximal normal subgroup of#72256795

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