Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C29×C42 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C25 | C25 |
| LCS | G ▷ C25 ▷ C1 | |
| UCS | C1 ◁ C25 ◁ G | |
| LECS | G ▷ C25 ▷ C1 | |
35775 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 5 generators on 24 points:
(2,4)(6,7)(10,12)(13,14)(15,16);(6,7)(10,12)(14,15)(17,18)(19,22)(20,21)(23,24);(2,4)(5,6,8,7)(9,10,11,12)(13,15,16,14)(18,21)(19,23);(2,4)(6,7)(17,18)(19,24)(20,21)(22,23);(1,2,3,4)(5,7,8,6)(17,19,20,23)(18,22,21,24)Polycyclic presentation:
2^10|c^2=g,e^2=h,b^a=bj,c^a=cg,c^b=cf,d^c=di,e^a=efgh,e^b=efgi,e^c=efghi,e^d=eh136 conjugacy classes — view the full character table.
| maximal subgroup of | #72331469, #72331497, #72331511, … |
| maximal normal subgroup of | #72331469, #72331497, #72331511, … |
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, 3, F.7);;
gap> SetPower(coll, 5, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.6);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.6*F.7*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.6*F.7*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.6*F.7*F.8*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.8);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);