| order | 1024 |
| nilpotency class | 2 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C42 · Schur multiplier (H2) = C27×C4 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, Frattini, cosocle | C2×C42 | C25 |
| commutator, socle | C23 | C23×C42 |
| prime radical | C2×#525 | C2×C4 |
| LCS | G ▷ C23 ▷ C1 | |
| UCS | C1 ◁ C2×C42 ◁ G | |
| LECS | G ▷ C2×C42 ▷ C22 ▷ C1 | |
5167 conjugacy classes of subgroups.
| minimal degree | μ(G) = 28 |
| transitive degree | μt(G) = 256 |
A minimal faithful permutation representation — 5 generators on 28 points:
(5,6,7,10,8,9,11,12);(2,4)(6,9)(10,12)(13,14,16,19,17,20,24,27)(15,21,23,28,22,18,25,26);(2,4);(1,2,3,4)(6,9)(10,12)(13,15)(14,18)(16,23)(17,22)(19,26)(20,21)(24,25)(27,28);(15,22)(18,21)(23,25)(26,28)Polycyclic presentation:
2^10|a^2=h,b^2=f,d^2=gi,f^2=i,h^2=j,b^a=bj,d^a=dj,d^b=dg,d^c=dgi,e^d=ei280 conjugacy classes — view the full character table.
| maximal subgroup of | #72320264 |
| maximal normal subgroup of | #72320264 |
| maximal quotient of | #72322207 |
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.8);;
gap> SetPower(coll, 2, F.6);;
gap> SetPower(coll, 4, F.7*F.9);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.10);;
gap> SetConjugate(coll, 4, 1, F.4*F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.7*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);