{"title":"Elements of uniformly bounded word-length in groups","authors":"Yanis Amirou","doi":"10.4171/lem/1002","DOIUrl":null,"url":null,"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 $G_{bound}$. We give sufficient criteria for triviality and finiteness of $G_{bound}$. We prove that if $G$ is virtually abelian then $G_{bound}$ is finite. In contrast with numerous examples where $G_{bound}$ is trivial, we show that for every finite group $A$, there exists an infinite group $G$ with $G_{bound}=A$. This group $G$ can be chosen among torsion groups. We also study the group $G_{bound}(d)$ of elements with uniformly bounded word-length for generating sets of cardinality less than $d$.","PeriodicalId":344085,"journal":{"name":"L’Enseignement Mathématique","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"L’Enseignement Mathématique","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4171/lem/1002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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 $G_{bound}$. We give sufficient criteria for triviality and finiteness of $G_{bound}$. We prove that if $G$ is virtually abelian then $G_{bound}$ is finite. In contrast with numerous examples where $G_{bound}$ is trivial, we show that for every finite group $A$, there exists an infinite group $G$ with $G_{bound}=A$. This group $G$ can be chosen among torsion groups. We also study the group $G_{bound}(d)$ of elements with uniformly bounded word-length for generating sets of cardinality less than $d$.