vix.ing · top · new · best · stats

Finding a low-dimensional piece of a set of integers

2015/12/19 by Freddie Manners, Manners, Freddie
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT) #math.CO #math.NT

paper · pdf · doi:10.48550/arxiv.1512.06272

24 pages

arxiv created 2016/06/03 · arxiv updated 2016/06/06

Abstract

We show that a finite set of integers A ⊆ ℤ with |A+A| ≤ K |A| contains a large piece X ⊆ A with Freĭman dimension O(log K), where large means |A|/|X| ≪ exp(O(log2 K)). This can be thought of as a major quantitative improvement on Freĭman's dimension lemma, or as a "weak" Freĭman--Ruzsa theorem with almost polynomial bounds. The methods used, centered around an "additive energy increment strategy", differ from the usual tools in this area and may have further potential. Most of our argument takes place over \mathbbF2n, which is itself curious. There is a possibility that the above bounds could be improved, assuming sufficiently strong results in the spirit of the Polynomial Freĭman--Ruzsa Conjecture over finite fields.

Related