| order | 2304 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C4 · Schur multiplier (H2) = C26 |
No aliases for this group.
| Sylow | C32 ⋊ C2×#2145 |
3092 conjugacy classes of subgroups.
| minimal degree | μ(G) = 38 |
| transitive degree | μt(G) = 96 |
A minimal faithful permutation representation — 4 generators on 38 points:
(34,35)(36,37);(2,8)(7,22)(9,24)(10,19)(11,28)(15,27)(23,26)(25,29)(33,34,35);(1,3)(2,7)(4,16)(5,20)(6,12)(8,22)(9,25)(10,26)(11,27)(13,31)(14,21)(15,28)(17,30)(18,32)(19,23)(24,29);(1,2)(3,11,12,28)(4,15)(5,19)(6,8)(7,13,22,30)(9,17)(10,21)(14,25,20,29)(16,26,32,23)(18,27)(24,31)(37,38)Polycyclic presentation:
2^8,3^2|a^2=e,f^2=g,g^2=h,b^a=bf,c^a=ch,e^b=eh,f^a=fg,f^b=fgh,g^a=gh,g^b=gh,i^a=i^2,i^d=i^2,j^a=i^2j,j^d=j^2156 conjugacy classes — view the full character table.
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, 3, 3]);;
gap> SetPower(coll, 1, F.5);;
gap> SetPower(coll, 6, F.7);;
gap> SetPower(coll, 7, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 6, 1, F.6*F.7);;
gap> SetConjugate(coll, 6, 2, F.6*F.7*F.8);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 2, F.7*F.8);;
gap> SetConjugate(coll, 9, 1, F.9^2);;
gap> SetConjugate(coll, 9, 4, F.9^2);;
gap> SetConjugate(coll, 10, 1, F.9^2*F.10);;
gap> SetConjugate(coll, 10, 4, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);