#### Document Type

Article

#### Publication Date

2-1992

#### First Advisor

Gary Sherman

#### Abstract

A four-tuple of elements, * (x _{1},x_{2},x_{3},x_{4})*, from a finite group, G, is said to be

rewriteable (see [l], [2], [3]) by *p* where *p* is an element of the symmetric group on four symbols, if*x _{1}x_{2}x_{3}x_{4} = x_{p(l)}x_{p(2)}x_{p(3)}x_{p(4)}*

The entry at the intersection of the *G*-th row and *j*-th column of each table on the succeeding three pages is the number of four-tuples from G which are rewriteable by exactly j permutations in the symmetric group on four symbols. This data was generated using the computer algebra systen CAYLEY by participants in Rose-Hulman's National Science Foundation Research Experiences for Undergra.duates program during the summer of 1991.

#### Recommended Citation

Kineke, Sharon A., "Data on Four-Rewriteability in Finite Groups" (1992). *Mathematical Sciences Technical Reports (MSTR)*. 130.

http://scholar.rose-hulman.edu/math_mstr/130

## Comments

MSTR 92-01