Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C214 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C24 | C26 |
| LCS | G ▷ C24 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ G | |
| LECS | G ▷ C24 ▷ C1 | |
42235 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 24 points:
(17,18)(19,21)(20,22)(23,24);(6,8)(11,15)(14,16);(5,6)(7,8)(10,13)(14,16)(17,18,20,22)(19,23,24,21);(2,4)(10,13)(11,15)(19,24)(21,23);(2,4)(9,10)(11,14)(12,13)(15,16)(17,19)(18,21)(20,24)(22,23);(1,2)(3,4)(9,11)(10,14)(12,15)(13,16)(17,18)(19,23)(20,22)(21,24)Polycyclic presentation:
2^10|c^2=g,c^a=cg,c^b=cj,e^c=eh,e^d=eh,f^b=fgh,f^c=fg,f^d=fgi,f^e=fghi148 conjugacy classes — view the full character table.
| maximal subgroup of | #72323275, C2×#72323268 |
| maximal normal subgroup of | #72323275, C2×#72323268 |
| maximal quotient of | #72323730, C2×#72323268, #72331609, … |
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> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.7*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.7);;
gap> SetConjugate(coll, 6, 4, F.6*F.7*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.7*F.8*F.9);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);