2000 character limit reached
Finite-by-nilpotent groups and a variation of the BFC-theorem
Published 21 Oct 2021 in math.GR | (2110.11379v2)
Abstract: For a group G and an element a in G let |a|k denote the cardinality of the set of commutators [a,x_1,...,x_k], where x_1,...,x_k range over G. The main result of the paper states that a group G is finite-by-nilpotent if and only if there are positive integers k and n such that |x|_k < n for every x in G. More precisely, if |x|_k < n for every x in G then \gamma{k+1}(G) has finite (k,n)-bounded order.
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.