Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C82 · Schur multiplier (H2) = C2×C8 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center | C8 | #1368 |
| commutator | C16 | C82 |
| Frattini, cosocle | C4×#346 | C22 |
| socle | C2 | #93269 |
| prime radical | C23 | #1384 |
| LCS | G ▷ C16 ▷ C8 ▷ C4 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C8 ◁ C22×C8 ◁ C42×C8 ◁ C4×#346 ◁ G | |
| LECS | G ▷ C4×#346 ▷ C22×C8 ▷ C4 ▷ C2 ▷ C1 | |
298 conjugacy classes of subgroups; only the 135 normal subgroups are shown.
This group has 298 conjugacy classes of subgroups — too many to draw. Only its 135 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 64 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 2 generators on 64 points:
(1,2)(3,13,14,40,16,41,28,42)(4,18,20,48)(5,23)(6,27)(7,12)(8,15,30,44,31,45,36,43)(9,21,34,54)(10,29)(11,25)(17,47,24,33,46,61,58,62)(19,50,51,64,53,32,52,37)(22,39,55,49)(26,57)(35,63,60,56)(38,59);(1,3)(2,8,27,30,12,31,10,36)(4,19,20,53)(5,24)(6,28)(7,16)(9,33,35,61,34,62,60,47)(11,37,57,50,38,64,23,32)(13,39,40,18,41,49,42,48)(14,29)(15,21,45,54)(17,25)(22,51,55,52)(26,58)(43,63,44,56)(46,59)Polycyclic presentation:
2^10|a^2=c,b^2=ceh,c^2=f,d^2=g,e^2=h,g^2=i,i^2=j,b^a=bd,c^b=cij,d^a=dg,d^b=dg,d^c=dj,e^a=eij,e^b=eij,f^b=fj,g^a=gi,g^b=gi,h^a=hj,h^b=hj,i^a=ij,i^b=ij136 conjugacy classes — view the full character table.
| maximal subgroup of | #72225326, #72225331, #72227097, … |
| maximal normal subgroup of | #72225326, #72225331, #72227097, … |
| maximal quotient of | #72227251 |
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.3);;
gap> SetPower(coll, 2, F.3*F.5*F.8);;
gap> SetPower(coll, 3, F.6);;
gap> SetPower(coll, 4, F.7);;
gap> SetPower(coll, 5, F.8);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 9, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.4);;
gap> SetConjugate(coll, 3, 2, F.3*F.9*F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.9*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.9*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.10);;
gap> SetConjugate(coll, 8, 2, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);