#72229347

order	3600
automorphism	?
homology	Abelianization (H₁) = C₄² · Schur multiplier (H₂) = C₃×C₄

Aliases

No aliases for this group.

Splittings

derived, Hall	C₃²×C₅² ⋊ C₄²
Sylow	C₅² ⋊ C₄×C₃⋊Dic₃
Sylow	C₃² ⋊ #87830

Subgroups

	subgroup	G/H
center, Frattini, hypercenter	C₂	#14268425
commutator, hypocenter	C₃²×C₅²	C₄²
Fitting, socle	C₂×C₃²×C₅²	C₂×C₄
prime radical, cosocle	C₂×C₃²×C₅⋊D₅	C₂²
LCS	G ▷ C₃²×C₅²
UCS	C₁ ◁ C₂

456 conjugacy classes of subgroups; only the 93 normal subgroups are shown.

normal subgroups only

This group has 456 conjugacy classes of subgroups — too many to draw. Only its 93 normal subgroups are shown.

Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.

Full subgroup data →

Presentation

minimal degree	μ(G) = 20
transitive degree	μ_t(G) = 180

A minimal faithful permutation representation — 3 generators on 20 points:

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

Polycyclic presentation:

2^4,3^2,5^2|a^2=d,b^2=c,e^a=e^2,f^a=f^2,g^a=g^4,g^b=g^3,g^c=g^4,h^a=g^3h,h^b=h^3,h^c=h^4

Conjugacy classes & character table

108 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	C₃⋊D₃×#87830, C₂×#72229347, #72231502, …
maximal normal subgroup of	C₃⋊D₃×#87830, C₂×#72229347, #72231502, …
maximal quotient of	C₂×#72229347

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