Freiman's theorem for solvable groups

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

41 pages, no figures, to appear, Contrib. Disc. Math. More discussion and examples added, as per referee suggestions; also ref

Scientific paper

Freiman's theorem asserts, roughly speaking, if that a finite set in a torsion-free abelian group has small doubling, then it can be efficiently contained in (or controlled by) a generalised arithmetic progression. This was generalised by Green and Ruzsa to arbitrary abelian groups, where the controlling object is now a coset progression. We extend these results further to solvable groups of bounded derived length, in which the coset progressions are replaced by the more complicated notion of a "coset nilprogression". As one consequence of this result, any subset of such a solvable group of small doubling is is controlled by a set whose iterated products grow polynomially, and which are contained inside a virtually nilpotent group. As another application we establish a strengthening of the Milnor-Wolf theorem that all solvable groups of polynomial growth are virtually nilpotent, in which only one large ball needs to be of polynomial size. This result complements recent work of Breulliard-Green, Fisher-Katz-Peng, and Sanders.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Freiman's theorem for solvable groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Freiman's theorem for solvable groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Freiman's theorem for solvable groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-400623

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.