2000 character limit reached
On conciseness of words in profinite groups
Published 13 Jul 2015 in math.GR | (1507.03362v1)
Abstract: Let w be a group word. It is conjectured that if w has only countably many values in a profinite group G, then the verbal subgroup w(G) is finite. In the present paper we confirm the conjecture in the cases where w is a multilinear commutator word, or the word x2, or the word [x2,y].
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.