| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C24 · Schur multiplier (H2) = C29 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C23 | C2×B(4,𝔽2) |
| commutator, Frattini, cosocle | C23×D4 | C24 |
| LCS | G ▷ C23×D4 ▷ C22 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C23 ◁ C23×C4 ◁ C22×C4×D4 ◁ G | |
| LECS | G ▷ C23×D4 ▷ C22 ▷ C2 ▷ C1 | |
8507 conjugacy classes of subgroups.
| minimal degree | μ(G) = 20 |
| transitive degree | μt(G) = 128 |
A minimal faithful permutation representation — 4 generators on 20 points:
(1,2)(3,4)(5,6,8,10)(7,9,11,12);(5,7)(6,9)(8,11)(10,12)(15,19);(7,11)(9,12)(14,17)(18,20);(2,4)(13,14)(15,17)(16,18)(19,20)Polycyclic presentation:
2^10|a^2=g,c^b=cg,d^a=dh,d^b=df,d^c=de,e^b=ei,f^c=fij,f^e=fj,i^d=ij94 conjugacy classes — view the full character table.
| maximal subgroup of | #72234433 |
| maximal normal subgroup of | #72234433 |
| maximal quotient of | #72232814, #72262089 |
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.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 4, 2, F.4*F.6);;
gap> SetConjugate(coll, 4, 3, F.4*F.5);;
gap> SetConjugate(coll, 5, 2, F.5*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.9*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 9, 4, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);