2000 character limit reached
Profinite groups with soluble centralisers
Published 31 May 2024 in math.GR | (2405.20964v1)
Abstract: We show that a profinite group, in which the centralisers of non-trivial elements are metabelian, is either virtually pro-$p$ or virtually soluble of derived length at most 4. We furthermore show that a prosoluble group, in which the centralisers of non-trivial elements are soluble of bounded derived length, is either soluble or virtually pro-$p$.
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.