A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Representations of infinite permutations by words
1987
Proceedings of the American Mathematical Society
Preserved Fulltext
We prove several cases of the following theorem: Every free group word which is not a proper power can represent every permutation of an infinite set. The remaining cases will be proved in a forthcoming paper of R. C. Lyndon.
doi:10.1090/s0002-9939-1987-0884459-5
fatcat:ioiav3o4gjhrzal6a4tpezfh2i