| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C26 · Schur multiplier (H2) = C212 |
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 | |
24175 conjugacy classes of subgroups.
| minimal degree | μ(G) = 28 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 6 generators on 28 points:
(1,2)(3,4)(6,9)(10,12)(14,17)(15,19)(23,27)(25,28);(2,4)(7,11)(10,12)(21,22,24,26)(23,25,27,28);(6,9)(10,12)(15,19)(18,20)(23,27)(25,28);(2,4)(7,11)(10,12)(13,14)(15,20)(16,17)(18,19)(21,22,24,26)(23,28,27,25);(2,4)(5,6)(7,12)(8,9)(10,11)(13,14)(15,20)(16,17)(18,19)(21,22)(23,28)(24,26)(25,27);(1,2)(3,4)(5,7)(6,10)(8,11)(9,12)(13,15)(14,18)(16,19)(17,20)(21,23)(22,25)(24,27)(26,28)Polycyclic presentation:
2^10|b^2=hj,d^2=hj,b^a=bh,d^a=dg,e^a=eghi,e^b=ehj,e^c=ehi,e^d=ehj,f^a=fgj,f^b=fi,f^c=fgj,f^d=fgij,f^e=fgij124 conjugacy classes — view the full character table.
| maximal subgroup of | #72297910 |
| maximal normal subgroup of | #72297910 |
| maximal quotient of | #72298619 |
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, 2, F.8*F.10);;
gap> SetPower(coll, 4, F.8*F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 5, 1, F.5*F.7*F.8*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.8*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.8*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.7*F.10);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.7*F.10);;
gap> SetConjugate(coll, 6, 4, F.6*F.7*F.9*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.7*F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);