Search arXivSearch

arXiv · 1512.06272

Finding a low-dimensional piece of a set of integers

Abstract

We show that a finite set of integers $A \subseteq \mathbb{Z}$ with $|A+A| \le K |A|$ contains a large piece $X \subseteq A$ with Freĭman dimension $O(\log K)$, where large means $|A|/|X| \ll \exp(O(\log^2 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 $\mathbb{F}_2^n$, 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Freddie Manners. 2016-06-03. Finding a low-dimensional piece of a set of integers. https://arxiv.org/abs/1512.06272

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO