Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C8 · Schur multiplier (H2) = C24 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center | C2×C4 | C2×#442 |
| commutator | C2×C8 | C23×C8 |
| Frattini, cosocle | C82 | C24 |
| socle | C22 | C2×#1580 |
| prime radical | #2215 | C8 |
| LCS | G ▷ C2×C8 ▷ C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2×C4 ◁ C2×C4×C8 ◁ #11402 ◁ G | |
| LECS | G ▷ C82 ▷ C42 ▷ C22 ▷ C1 | |
574 conjugacy classes of subgroups.
| minimal degree | μ(G) = 64 |
| transitive degree | μt(G) = 512 |
A minimal faithful permutation representation — 4 generators on 64 points:
(1,2)(3,8)(4,15)(5,10)(6,9)(7,11)(12,22)(13,21)(14,23)(16,20)(17,28)(18,24)(19,25)(26,31)(27,32)(29,30)(33,34)(35,47)(36,52)(37,56)(38,44)(39,59)(40,42)(41,49)(43,51)(45,54)(46,53)(48,63)(50,61)(55,64)(57,60)(58,62);(1,3,5,13,6,12,18,26,7,14,19,27,4,16,17,29)(2,8,10,21,9,22,24,31,11,23,25,32,15,20,28,30)(33,35,37,48,39,50,38,57,40,51,54,36,53,55,58,49)(34,41,44,61,46,52,56,47,42,60,62,64,59,63,45,43);(1,4,7,6)(2,9,11,15)(3,12,14,16)(5,17,19,18)(8,20,23,22)(10,24,25,28)(13,26,27,29)(21,30,32,31)(34,42)(41,60)(43,47)(44,62)(45,56)(46,59)(52,63)(61,64);(33,36,54,55,39,49,58,35,40,48,37,50,53,57,38,51)(34,43,44,60,46,61,56,63,42,47,62,41,59,64,45,52)Polycyclic presentation:
2^10|b^2=e,c^2=ij,d^2=fh,e^2=g,f^2=hj,g^2=i,h^2=j,b^a=bf,c^a=ci,c^b=cij,d^a=df,d^b=dh,e^a=eh,e^d=ej,f^a=fh,f^b=fj,g^a=gj,h^a=hj124 conjugacy classes — view the full character table.
| maximal subgroup of | #72320600, #72321171, #72321542, … |
| maximal normal subgroup of | #72320600, #72321171, #72321542, … |
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, 2, F.5);;
gap> SetPower(coll, 3, F.9*F.10);;
gap> SetPower(coll, 4, F.6*F.8);;
gap> SetPower(coll, 5, F.7);;
gap> SetPower(coll, 6, F.8*F.10);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.9*F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);