#72271944

order	1536
automorphism	?
homology	Abelianization (H₁) = C₂⁴ · Schur multiplier (H₂) = C₂⁸

Aliases

No aliases for this group.

Splittings

Fitting	C₃×#63012 ⋊ C₂
Sylow	C₃ ⋊ #511853

Subgroups

	subgroup	G/H
center	C₂	#10943963
commutator, cosocle	C₂²×C₃×D₄	C₂⁴
Frattini	C₂²×D₄	C₂³×D₃
Fitting	C₃×#63012	C₂
socle	C₂×C₃	#32899
hypercenter	#63012	D₃
hypocenter	C₃	#511853
LCS	G ▷ C₂²×C₃×D₄ ▷ C₂²×C₃ ▷ C₂×C₃ ▷ C₃
UCS	C₁ ◁ C₂ ◁ C₂³ ◁ #518 ◁ #63012

5016 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degree	μ(G) = 19
transitive degree	μ_t(G) = 48

A minimal faithful permutation representation — 4 generators on 19 points:

(1,2,3)(6,12,14,13)(9,16,18,17);(12,13)(16,17);(2,3)(4,6)(5,9,11,18)(7,12)(8,14)(10,16,19,17)(13,15);(4,5)(6,9,14,18)(7,10)(8,11)(12,16,13,17)(15,19)

Polycyclic presentation:

2^9,3|a^2=h,b^2=gh,d^2=h,f^2=i,b^a=bg,c^b=ce,d^b=df,d^c=dh,e^d=eh,f^b=fi,f^c=fh,f^e=fi,g^a=gi,g^b=gi,h^b=hi,j^b=j^2

Conjugacy classes & character table

129 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	#72271950, D₃×#511853
maximal normal subgroup of	#72271950, D₃×#511853

GAP

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.8);;
gap> SetPower(coll, 2, F.7*F.8);;
gap> SetPower(coll, 4, F.8);;
gap> SetPower(coll, 6, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 2, F.4*F.6);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 10, 2, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);