Dear GAP-forum,

Juergen Ecker asked :

Dear GAP-forum,

does anybody have an idea, what a presentation for the symmetric group
of order n
could look like?

One possibility is

< a_1, a_2, ..., a_{n-1} | (a_ia_{i+1})^3 = 1  1 <= i <= n-2
                           (a_ia_j)^2     = 1  1 <= i < n-2, i+1 < j <= n-1
                           (a_i)^2        = 1  1 <= i <= n-1 >

Here the generator a_i corresponds to the permutation (i i+1)

Steve Linton