Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 5 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C24 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #139486 |
| commutator | C22×C22⋊C4 | C22×C4 |
| Frattini, cosocle | #2308 | C23 |
| prime radical | #35346 | C22 |
| LCS | G ▷ C22×C22⋊C4 ▷ C24 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ C25 ◁ #35346 ◁ G | |
| LECS | G ▷ #2308 ▷ C24 ▷ C22 ▷ C2 ▷ C1 | |
1685 conjugacy classes of subgroups; only the 77 normal subgroups are shown.
This group has 1685 conjugacy classes of subgroups — too many to draw. Only its 77 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 3 generators on 32 points:
(1,2,4,8)(3,11,13,26,12,25,27,32)(5,9,15,23)(6,10,16,22)(7,18,20,14,19,29,31,28)(17,24,30,21);(1,3)(2,7,10,19)(4,13,16,27)(5,14)(6,12)(8,20)(9,11,24,25)(15,18,30,29)(17,28)(21,26)(22,31)(23,32);(3,12)(5,17)(7,19)(11,25)(15,30)(18,29)Polycyclic presentation:
2^10|a^2=d,b^2=f,d^2=h,e^2=hij,b^a=be,c^a=cfghij,c^b=cfhi,d^b=dg,d^c=dh,e^a=eghij,e^c=ehi,e^d=eij,f^a=fhij,f^d=fj,g^a=gi,g^b=gj,g^d=gj,g^e=gj,h^b=hj,i^a=ij,i^b=ij49 conjugacy classes — view the full character table.
| maximal subgroup of | #72310535, #72310537, #72310540, … |
| maximal normal subgroup of | #72310535, #72310537, #72310540, … |
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.4);;
gap> SetPower(coll, 2, F.6);;
gap> SetPower(coll, 4, F.8);;
gap> SetPower(coll, 5, F.8*F.9*F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.6*F.7*F.8*F.9*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.6*F.8*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.7*F.8*F.9*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.9*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.8*F.9*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*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);