Finite Group DatabasebetaFinite Group Databasebeta| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C25 |
No aliases for this group.
| Fitting | C3×#7310 ⋊ C2 |
| Sylow | C3 ⋊ #139743 |
1630 conjugacy classes of subgroups; only the 99 normal subgroups are shown.
This group has 1630 conjugacy classes of subgroups — too many to draw. Only its 99 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| transitive degree | μt(G) = 48 |
Polycyclic presentation:
2^9,3|a^2=d,b^2=f,b^a=bde,c^a=cde,c^b=cfi,d^b=dh,d^c=dh,e^a=eh,e^b=eg,e^c=eh,f^a=fgh,f^d=fi,g^a=gi,g^c=gi,h^b=hi,j^c=j^269 conjugacy classes — view the full character table.
| maximal subgroup of | #72231808, #72231814, D3×#139743 |
| maximal normal subgroup of | #72231808, #72231814, D3×#139743 |
| maximal quotient of | #72270528 |
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, 3]);;
gap> SetPower(coll, 1, F.4);;
gap> SetPower(coll, 2, F.6);;
gap> SetConjugate(coll, 2, 1, F.2*F.4*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.4*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.6*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.7);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 6, 1, F.6*F.7*F.8);;
gap> SetConjugate(coll, 6, 4, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 10, 3, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);