2000 character limit reached
Freiman's theorem in an arbitrary nilpotent group
Published 16 Nov 2012 in math.CO and math.GR | (1211.3989v3)
Abstract: We prove a Freiman-Ruzsa-type theorem valid in an arbitrary nilpotent group. Specifically, we show that a K-approximate subgroup A of an s-step nilpotent group G is contained in a coset nilprogression of rank at most f(K) and cardinality at most exp(g(K))|A|, with f and g polynomials depending only on the step s of G. To motivate this, we give a direct proof of Breuillard and Green's analogous result for torsion-free nilpotent groups, avoiding the use of Mal'cev's embedding theorem.
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.