| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C214×C4 |
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 | |
48943 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 24 points:
(11,15)(13,16);(2,4)(6,8)(18,21)(22,24);(5,6)(7,8)(9,10,12,14)(11,16,15,13)(19,23)(22,24);(2,4)(5,6,7,8)(9,10)(11,13)(12,14)(15,16)(17,18)(19,24)(20,21)(22,23);(17,19)(18,22)(20,23)(21,24);(1,2)(3,4)(5,6)(7,8)(9,11)(10,13)(12,15)(14,16)Polycyclic presentation:
2^10|c^2=j,d^2=i,c^b=ci,d^b=dg,d^c=dij,e^c=egi,e^d=egi,f^a=fj,f^b=fh,f^c=fj,f^d=fh148 conjugacy classes — view the full character table.
| maximal subgroup of | #72332480 |
| maximal normal subgroup of | #72332480 |
| maximal quotient of | #72333332, #72333349, #72336430, … |
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.10);;
gap> SetPower(coll, 4, F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.9*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.7*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.8);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);