Finite Group DatabasebetaFinite Group Databasebeta| order | 1024 |
| nilpotency class | 3 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C28 |
No aliases for this group.
| subgroup | G/H | |
|---|---|---|
| center, socle | C23 | C2×#392 |
| commutator | C23×C4 | C23×C4 |
| Frattini, cosocle | C24×C4 | C24 |
| prime radical | C2×#9946 | C2 |
| LCS | G ▷ C23×C4 ▷ C22 ▷ C1 | |
| UCS | C1 ◁ C23 ◁ C23×C42 ◁ G | |
| LECS | G ▷ C24×C4 ▷ C22 ▷ C1 | |
6713 conjugacy classes of subgroups.
| transitive degree | μt(G) = 128 |
Polycyclic presentation:
2^10|a^2=h,b^2=f,c^2=f,d^2=gj,g^2=j,b^a=bh,d^a=de,d^b=degj,d^c=dj,e^a=ei,g^b=gj,h^d=hi124 conjugacy classes — view the full character table.
| maximal subgroup of | #72264063, #72264259, #72264390, … |
| maximal normal subgroup of | #72264063, #72264259, #72264390, … |
| maximal quotient of | #72280299, #72282419 |
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, 3, F.6);;
gap> SetPower(coll, 4, F.7*F.10);;
gap> SetPower(coll, 7, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.5);;
gap> SetConjugate(coll, 4, 2, F.4*F.5*F.7*F.10);;
gap> SetConjugate(coll, 4, 3, F.4*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.10);;
gap> SetConjugate(coll, 8, 4, F.8*F.9);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);