In GAP, working with elements of the symmetric group $S_k$ is straightforward. E.g. one can write
(1,2)*(2,3);
to obtain (1,3,2).
Is there a similar functionality to work with group rings, say $\mathbb{Q}[S_k]$? E.g., what would be the standard approach to evaluate expressions such as
[3*() - (1,2)] * [-(1,2) + 1/3*(2,3)]
I'm aware that one can create $\mathbb{Q}[S_k]$ by
G:= SymmetricGroup(k);
KG:= GroupRing(Rationals, G);
After that step however I don't know how to create actual elements of $\mathbb{Q}[S_k]$.
You need to use the embedding of the underlying group into the group ring - see e.g. https://www.gap-system.org/Manuals/doc/ref/chap65.html
Note however, that this is an expensive operation, since it involves a lot of explicit calculations - calculating the image of an embedding in a group ring, multiplying it by a coefficient, and then summing up elements of group ring. A more efficient way is to write down coefficients and group elements using
ElementOfMagmaRing:As you can see, this example is correct: