Elements of uniformly bounded word-length in groups
Abstract
We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group G, we denote this subgroup by Gbound. We give sufficient criteria for triviality and finiteness of Gbound. We prove that if G is virtually abelian then Gbound is finite. In contrast with numerous examples where Gbound is trivial, we show that for every finite group A, there exists an infinite group G with Gbound=A. This group G can be chosen among torsion groups. We also study the group Gbound(d) of elements with uniformly bounded word-lengths for generating sets of cardinality less than d.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.