Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C25×C4 · Schur multiplier (H2) = C217 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, Frattini, socle, cosocle | C24 | C26 |
| commutator | C23 | C25×C4 |
| prime radical | C26×D4 | C2 |
| LCS | G ▷ C23 ▷ C1 | |
| UCS | C1 ◁ C24 ◁ G | |
| LECS | G ▷ C24 ▷ C1 | |
425789 conjugacy classes of subgroups.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 6 generators on 20 points:
(5,6)(7,8);(1,2)(3,4)(5,6)(7,8)(9,10)(11,12);(2,4)(6,8)(9,10,11,12)(15,19)(18,20);(14,17)(18,20);(13,14)(15,18)(16,17)(19,20);(1,2)(3,4)(5,6)(7,8)(9,10)(11,12)(13,15)(14,18)(16,19)(17,20)Polycyclic presentation:
2^10|c^2=hi,c^a=ch,c^b=cg,e^d=egj,f^c=fj256 conjugacy classes — view the full character table.
| maximal subgroup of | #72235118, #72235921, #72236046, … |
| maximal normal subgroup of | #72235118, #72235921, #72236046, … |
| maximal quotient of | #72251097, #72251196, #72296167, … |
| automorphism group of | #1572 |
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.8*F.9);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 5, 4, F.5*F.7*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);