Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C215 |
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 | |
164601 conjugacy classes of subgroups.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 64 |
A minimal faithful permutation representation — 6 generators on 20 points:
(13,14)(15,18)(16,17)(19,20);(9,10)(11,12);(2,4)(5,6)(7,8)(9,10)(11,12)(13,14)(15,18)(16,17)(19,20);(6,8)(10,12)(14,17)(15,19);(5,6)(7,8)(9,10)(11,12)(13,14)(15,18)(16,17)(19,20);(1,2)(3,4)(13,15,16,19)(14,18,17,20)Polycyclic presentation:
2^10|f^2=g,d^a=dg,d^b=dh,d^c=dj,e^d=ej,f^c=fi,f^d=fg220 conjugacy classes — view the full character table.
| maximal subgroup of | #72256579, #72268589, #72268592, … |
| maximal normal subgroup of | #72256579, #72268589, #72268592, … |
| maximal quotient of | #72267140, #72286609, C22⋊C4×#2846, … |
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, 6, F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.7);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);