#72335129

order	2048
nilpotency class	2
automorphism	?
homology	Abelianization (H₁) = C₂⁷ · Schur multiplier (H₂) = C₂²⁰

Aliases

No aliases for this group.

Subgroups

	subgroup	G/H
center, commutator, Frattini, socle, cosocle	C₂⁴	C₂⁷
LCS	G ▷ C₂⁴ ▷ C₁
UCS	C₁ ◁ C₂⁴ ◁ G
LECS	G ▷ C₂⁴ ▷ C₁

At least 14409 conjugacy classes of subgroups; only the 39372 normal subgroups are shown.

Full subgroup data →

Presentation

minimal degree	μ(G) = 24
transitive degree	μ_t(G) = 128

A minimal faithful permutation representation — 7 generators on 24 points:

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

Polycyclic presentation:

2^11|g^2=j,b^a=bh,c^b=ck,d^a=dk,d^c=dk,g^a=ghi,g^b=gj,g^c=gjk,g^d=gi,g^e=ghi,g^f=gj

Conjugacy classes & character table

302 conjugacy classes — view the full character table.

Relationships

maximal subgroup of	C₂×#72335129
maximal normal subgroup of	C₂×#72335129
maximal quotient of	#72335164, C₂×#72335129

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