arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0401304math.GR
收藏

生成无限对称群

Generating infinite symmetric groups

George M. Bergman

摘要:

设S=Sym(Ω)是一个无限集Ω的所有置换的群.推广Macpherson和Neumann的一个论点,证明了如果U是S作为群或幺半群的生成集,则存在正整数n,使得S的每个元素都可以写成U的元素中长度为\leq n的群字或幺半群字.注意到几个相关的问题,并给出了一个简短的证明,Ore的一个结果,用于证明上述结果。

英文摘要:

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, respectively as a monoid, then there exists a positive integer n such that every element of S may be written as a group word, respectively a monoid word, of length \leq n in the elements of U. Several related questions are noted, and a brief proof is given of a result of Ore's on commutators that is used in the proof of the above result.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑