Papers
Topics
Authors
Recent
Search
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$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.