Finite Group Databasebeta

#72310269

order1024
nilpotency class4
automorphism?
homologyAbelianization (H1) = C23×C4 · Schur multiplier (H2) = C25×C4

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, socleC23C2×#442
commutatorC22×C8C23×C4
Frattini, cosocleC23×C8C24
prime radical#498795C2
LCSG ▷ C22×C8 ▷ C4 ▷ C2 ▷ C1
UCSC1 ◁ C23 ◁ C24×C4 ◁ C23×#97 ◁ G
LECSG ▷ C23×C8 ▷ C4 ▷ C2 ▷ C1

2788 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 28
transitive degreeμt(G) = 128

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

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

Polycyclic presentation:

2^10|a^2=e,c^2=e,d^2=ghj,h^2=i,i^2=j,b^a=bg,d^a=dh,d^b=df,d^c=dgi,e^d=ej,h^a=hi,h^c=hj,i^a=ij

Conjugacy classes & character table

100 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72310270, #72317173, #72317220
maximal normal subgroup of#72310270, #72317173, #72317220

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