Generating Infinite Symmetric Groups
Department of Mathematics, University of California Berkeley, CA 94720-3840, USA; gbergman{at}math.berkeley.edu
Received 26 July 2004. Revision received 23 March 2005.
Let S = Sym(
) be the group of all permutations of an infinite set
. Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, then there exists a positive integer n such that every element of S may be written as a group word of length at most n in the elements of U. Likewise, if U is a generating set for S as a monoid, then there exists a positive integer n such that every element of S may be written as a monoid word of length at most n in the elements of U. Some related questions and recent results are noted, and a brief proof is given of a result of Ore's on commutators, which is used in the proof of the above result. 2000 Mathematics Subject Classification 20B30 (primary), 20B07, 20E15 (secondary).
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
A. S. Kechris and C. Rosendal Turbulence, amalgamation, and generic automorphisms of homogeneous structures Proc. London Math. Soc., March 1, 2007; 94(2): 302 - 350. [Abstract] [Full Text] [PDF] |
||||
