Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C23 · Schur multiplier (H2) = C26 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #10336 |
| commutator, Frattini, cosocle | C22×#121 | C23 |
| LCS | G ▷ C22×#121 ▷ C24 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C24 ◁ C22×#121 ◁ G | |
| LECS | G ▷ C22×#121 ▷ C24 ▷ C22 ▷ C1 | |
2995 conjugacy classes of subgroups; only the 63 normal subgroups are shown.
This group has 2995 conjugacy classes of subgroups — too many to draw. Only its 63 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 3 generators on 24 points:
(1,2)(3,6,8,5)(4,7)(9,10)(11,17,20,21)(12,13,22,23)(14,16)(15,18)(19,24);(2,5)(6,7)(9,11,14,20)(10,15,16,24)(12,21,22,17)(13,19,23,18);(1,3)(2,6,7,5)(4,8)(9,12,14,22)(10,13,16,23)(11,15)(17,19)(18,21)(20,24)Polycyclic presentation:
2^10|a^2=f,b^2=ij,c^2=hij,d^2=ij,b^a=bd,c^a=cfgij,c^b=ce,d^a=dg,d^b=dij,d^c=dh,e^a=eghj,e^c=eij,e^d=eij,f^b=fgij,f^c=fi,f^d=fi,f^e=fij,g^a=gi,g^c=gij,h^a=hj,h^b=hij52 conjugacy classes — view the full character table.
| maximal subgroup of | #72227687, #72227770, #72266226 |
| maximal normal subgroup of | #72227687, #72227770, #72266226 |
| maximal quotient of | #72316377 |
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, 1, F.6);;
gap> SetPower(coll, 2, F.9*F.10);;
gap> SetPower(coll, 3, F.8*F.9*F.10);;
gap> SetPower(coll, 4, F.9*F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.4);;
gap> SetConjugate(coll, 3, 1, F.3*F.6*F.7*F.9*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.9*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.7*F.8*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, 2, F.6*F.7*F.9*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.9*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.9*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);