Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C29 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C22 | #46996 |
| commutator, Frattini, cosocle | C25 | C25 |
| LCS | G ▷ C25 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C22 ◁ C25 ◁ G | |
| LECS | G ▷ C25 ▷ C2 ▷ C1 | |
12405 conjugacy classes of subgroups.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 5 generators on 20 points:
(1,2,3,4)(5,6)(7,13)(8,16,17,11)(9,12)(10,15)(14,18,20,19);(14,20)(18,19);(2,4)(5,7,9,15)(6,10,12,13)(8,14,17,20)(11,18,16,19);(5,8)(6,11)(7,14)(9,17)(10,18)(12,16)(13,19)(15,20);(10,13)(18,19)Polycyclic presentation:
2^10|a^2=f,c^2=j,c^a=cg,c^b=cfgj,d^a=dgi,d^b=dh,e^a=eh,e^c=egi,f^d=fj,h^c=hj,i^a=ij88 conjugacy classes — view the full character table.
| maximal subgroup of | #72225747, #72238598, #72251306, … |
| maximal normal subgroup of | #72225747, #72238598, #72251306, … |
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.6);;
gap> SetPower(coll, 3, F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.6*F.7*F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.7*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.7*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 9, 1, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);