2000 character limit reached
On profinite groups in which centralizers have bounded rank
Published 13 Apr 2020 in math.GR | (2004.05977v3)
Abstract: For a positive integer r we prove that if G is a profinite group in which the centralizer of every nontrivial element has rank at most r, then G is either a pro-p group or a group of finite rank. Further, if G is not virtually a pro-p group, then G is virtually of rank at most r+1.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.