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 | |
42641 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);(2,4)(9,10)(11,12)(13,14)(15,16)(20,24)(22,23);(5,6)(7,8)(10,14)(11,15)(17,18,21,19)(20,23,24,22);(2,4)(5,6)(7,8)(11,15)(12,16)(18,19)(20,24);(5,6,7,8)(9,11,13,15)(10,12,14,16)(17,19,21,18)(20,23,24,22);(1,2)(3,4)(5,6)(7,8)(9,12)(10,15)(11,14)(13,16)(17,20)(18,22)(19,23)(21,24)Polycyclic presentation:
2^10|c^2=i,e^2=ghi,c^a=ci,c^b=cg,d^a=di,d^c=di,e^a=ei,e^c=egh,e^d=eghi,f^b=fj,f^c=fi,f^d=fj,f^e=fh142 conjugacy classes — view the full character table.
| maximal subgroup of | #72232191, C2×#72232098, #72327243, … |
| maximal normal subgroup of | #72232191, C2×#72232098, #72327243, … |
| maximal quotient of | C2×#72232098, #72331162, #72331183, … |
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.9);;
gap> SetPower(coll, 5, F.7*F.8*F.9);;
gap> SetConjugate(coll, 3, 1, F.3*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.7*F.8*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.8);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);