Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C214 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, commutator, Frattini, socle, cosocle | C25 | C25 |
| LCS | G ▷ C25 ▷ C1 | |
| UCS | C1 ◁ C25 ◁ G | |
| LECS | G ▷ C25 ▷ C1 | |
50275 conjugacy classes of subgroups.
| minimal degree | μ(G) = 24 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 5 generators on 24 points:
(5,6,8,7)(9,10)(11,12)(17,18)(19,24)(20,22)(21,23);(2,4)(10,12)(14,16)(19,20)(22,24);(13,14)(15,16)(17,19,21,20)(18,22,23,24);(6,7)(17,18)(19,22)(20,24)(21,23);(1,2)(3,4)(5,7,8,6)(9,10)(11,12)(13,14)(15,16)(17,20,21,19)(18,22,23,24)Polycyclic presentation:
2^10|a^2=f,c^2=fg,e^2=g,b^a=bh,c^a=cfg,c^b=cj,d^a=df,e^b=egi,e^d=eg160 conjugacy classes — view the full character table.
| maximal subgroup of | #72323723, #72323729, #72323733, … |
| maximal normal subgroup of | #72323723, #72323729, #72323733, … |
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.6*F.7);;
gap> SetPower(coll, 5, F.7);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 3, 1, F.3*F.6*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.6);;
gap> SetConjugate(coll, 5, 2, F.5*F.7*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.7);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);