Symmetric representation of the elements of finite groups

Abstract

Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically represented elements in terms of their permutation representation. In particular, we represent elements of the group $U_3(3) : 2$, where $U_3(3)$ is the projective special unitary group of $3 \times 3$ matrices with entries in the field $\mathbb{F}_3$, as a permutation on fourteen letters from the projective general linear group $PGL_2(7)$, followed by a word of length at most two in the fourteen involutory symmetric generators.