Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 4 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C27 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C2 | #213828 |
| commutator | C22×D4 | C23×C4 |
| Frattini, cosocle | C23×D4 | C24 |
| prime radical | #6499874 | C2 |
| LCS | G ▷ C22×D4 ▷ C23 ▷ C2 ▷ C1 | |
| UCS | C1 ◁ C2 ◁ C23 ◁ C23×D4 ◁ G | |
| LECS | G ▷ C23×D4 ▷ C23 ▷ C2 ▷ C1 | |
3185 conjugacy classes of subgroups.
Polycyclic presentation:
2^10|a^2=f,e^2=j,b^a=be,c^a=ceg,c^b=cj,d^b=dg,d^c=dg,e^a=eh,e^b=ej,e^d=ehi,f^b=fhj,f^c=fij,g^a=ghij,g^e=gj,h^c=hj,i^b=ij64 conjugacy classes — view the full character table.
| maximal subgroup of | #72216398, #72258966, #72262507, … |
| maximal normal subgroup of | #72216398, #72258966, #72262507, … |
| maximal quotient of | #72241350, #72252383, #72258350, … |
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, 5, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.5*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.10);;
gap> SetConjugate(coll, 4, 2, F.4*F.7);;
gap> SetConjugate(coll, 4, 3, F.4*F.7);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.10);;
gap> SetConjugate(coll, 5, 4, F.5*F.8*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.8*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.9*F.10);;
gap> SetConjugate(coll, 7, 1, F.7*F.8*F.9*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 9, 2, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);