Symmetric representation of the elements of finite groups

arXivmath/0612042MaRDI QIDQ6478352FDOQ6478352

Publication date: 1 December 2006

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 i m e s 3

matrices with entries in the field

m a t h b b F_{3}

, as a permutation on fourteen letters from the projective general linear group

P G L_{2} (7)

, followed by a word of length at most two in the fourteen involutory symmetric generators.

Mathematics Subject Classification ID

Simple groups: sporadic groups (20D08)

This page was built for publication: Symmetric representation of the elements of finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6478352)