The elements of a permutation group are found by constructing a strong generating set representation of the group.
The order of elements returned by GroupElements depends on the base of the strong generating set. An explicit base can be chosen by setting GroupActionBase.
GroupElements gives the identity element for any choice of the group base.
Negative positions are assumed to count from the end.