vix.ing · top · new · best · stats · spec

Finite-by-nilpotent groups and a variation of the BFC-theorem

2021/10/21 by Pavel Shumyatsky, Shumyatsky, Pavel
Computer Science · Mathematics · #Advanced Graph Theory Research #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2110.11379

openalex publication_date 2021/10/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

For a group G and an element a in G let |a|k denote the cardinality of the set of commutators [a,x1,...,xk], where x1,...,xk 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 γk+1(G) has finite (k,n)-bounded order.

Related