2000 character limit reached
Elements of uniformly bounded word-length in groups
Published 28 Nov 2018 in math.GR | (1811.11464v4)
Abstract: We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group , we denote this subgroup by . We give sufficient criteria for triviality and finiteness of . We prove that if is virtually abelian then is finite. In contrast with numerous examples where is trivial, we show that for every finite group , there exists an infinite group with . This group can be chosen among torsion groups. We also study the group of elements with uniformly bounded word-lengths for generating sets of cardinality less than .
Paper Prompts
Sign up for free to create and run prompts on this paper.