| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C29 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | C22×B(4,𝔽2) |
| commutator, Frattini, cosocle | C22×D4 | C25 |
| LCS | G ▷ C22×D4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C22×D4 ◁ C2×D42 ◁ G | |
| LECS | G ▷ C22×D4 ▷ C22 ▷ C2 ▷ C1 | |
5880 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 5 generators on 24 points:
(2,5)(6,7)(9,10)(11,17)(12,16)(13,15)(14,18)(19,22)(20,21)(23,24);(9,10)(11,17)(12,16)(13,21,20,15)(14,18)(19,23,24,22);(1,2)(3,7)(4,5)(6,8)(9,11)(10,14)(12,18)(13,19)(15,23)(16,17)(20,24)(21,22);(1,3,4,8)(2,6,5,7);(2,5)(6,7)(10,15)(11,18)(14,22)(16,21)(17,23)(19,24)Polycyclic presentation:
2^10|b^2=h,d^2=fj,b^a=bh,c^a=cf,c^b=cj,d^c=dfj,e^a=eg,e^b=eg,e^c=ef,g^b=gi,h^e=hi,h^g=hj,i^a=ij,i^b=ij88 conjugacy classes — view the full character table.
| maximal subgroup of | #72317521, #72319130, #72319361 |
| maximal normal subgroup of | #72317521, #72319130, #72319361 |
| maximal quotient of | #72318211 |
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, 4, F.6*F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.6*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.7);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.6);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 8, 5, F.8*F.9);;
gap> SetConjugate(coll, 8, 7, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);