Finite Group Databasebeta

#72335339

order1024
nilpotency class2
automorphism?
homologyAbelianization (H1) = C26 · Schur multiplier (H2) = C212

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, commutator, Frattini, socle, cosocleC24C26
LCSG ▷ C24 ▷ C1
UCSC1 ◁ C24 ◁ G
LECSG ▷ C24 ▷ C1

At least 11141 conjugacy classes of subgroups; only the 3445 normal subgroups are shown.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|a^2=g,f^2=ij,b^a=bgj,c^a=cgj,c^b=ci,d^a=dgh,e^a=ehj,f^a=fj,f^c=fgj,f^d=fhi,f^e=fhj

Conjugacy classes & character table

142 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72335444
maximal normal subgroup of#72335444
maximal quotient of#72336052

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