2000 character limit reached
Profinite groups with pronilpotent centralizers
Published 12 Sep 2018 in math.GR | (1809.04462v1)
Abstract: The article deals with profinite groups in which the centralizers are pronilpotent (CN-groups). It is shown that such groups are virtually pronilpotent. More precisely, let G be a profinite CN-group, and let F be the maximal normal pronilpotent subgroup of G. It is shown that F is open and the structure of the finite quotient G/F is described in detail.
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.