Finite Group DatabasebetaFinite Group Databasebeta| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C24 |
No aliases for this group.
| Fitting | #63026 ⋊ D3 |
| subgroup | G/H | |
|---|---|---|
| center, hypercenter | C1 | G |
| commutator, cosocle | #3532⋊C3 | C22 |
| Frattini | C23 | C2×#1020 |
| Fitting | #63026 | D3 |
| socle | C22 | #87524 |
| hypocenter | #5464 | D4 |
| LCS | G ▷ #3532⋊C3 ▷ #5464 | |
| UCS | C1 | |
1118 conjugacy classes of subgroups; only the 22 normal subgroups are shown.
This group has 1118 conjugacy classes of subgroups — too many to draw. Only its 22 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 32 |
| transitive degree | μt(G) = 32 |
A minimal faithful permutation representation — 2 generators on 32 points:
(1,14,30,4,5,3,28,12)(2,9,31,24,8,11,32,10)(6,15,16,19,20,13,29,18)(7,25,26,23,21,22,27,17);(1,2)(3,17,16,11,4,31)(5,21,6,8,20,7)(9,19,26,14,10,30)(12,27,15,23,28,25)(13,24,29,22,18,32)Polycyclic presentation:
2^3,3,2^6|b^2=c,b^a=bc,d^b=d^2,e^a=ej,e^b=ef,e^d=f,f^a=fi,f^d=ef,g^a=gi,g^b=hi,g^c=gij,g^d=h,g^e=gi,g^f=gj,h^a=hij,h^b=gj,h^c=hj,h^d=gh,h^e=hj,h^f=hij,i^d=ij,j^b=ij,j^d=i33 conjugacy classes — view the full character table.
| maximal subgroup of | #72341071 |
| maximal normal subgroup of | #72341071 |
| maximal quotient of | #72285397, #72340915, #72341116, … |
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, 3, 2, 2, 2, 2, 2, 2]);;
gap> SetPower(coll, 2, F.3);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 4, 2, F.4^2);;
gap> SetConjugate(coll, 5, 1, F.5*F.10);;
gap> SetConjugate(coll, 5, 2, F.5*F.6);;
gap> SetConjugate(coll, 5, 4, F.6);;
gap> SetConjugate(coll, 6, 1, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.5*F.6);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 2, F.8*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 4, F.8);;
gap> SetConjugate(coll, 7, 5, F.7*F.9);;
gap> SetConjugate(coll, 7, 6, F.7*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.9*F.10);;
gap> SetConjugate(coll, 8, 2, F.7*F.10);;
gap> SetConjugate(coll, 8, 3, F.8*F.10);;
gap> SetConjugate(coll, 8, 4, F.7*F.8);;
gap> SetConjugate(coll, 8, 5, F.8*F.10);;
gap> SetConjugate(coll, 8, 6, F.8*F.9*F.10);;
gap> SetConjugate(coll, 9, 4, F.9*F.10);;
gap> SetConjugate(coll, 10, 2, F.9*F.10);;
gap> SetConjugate(coll, 10, 4, F.9);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);