On common energies and sumsets

We prove that every additive set $A$ with energy $E(A)\ge |A|^3/K$ has a subset $A'\subseteq A$ of size $|A'|\ge (1-\varepsilon)K^{-1/2}|A|$ such that $|A'-A'|\le O_\varepsilon(K^{4}|A'|)$. This is, essentially, the largest structured set one can get in the Balog-Szemer\'edi-Gowers theorem.

We study the parameterized complexity of algorithmic problems whose input is an integer set $A$ in terms of the doubling constant $C := |A + A|/|A|$, a fundamental measure of additive structure. We present evidence that this new parameterization is algorithmically useful in the form of new results for two difficult, well-studied problems: Integer Programming and Subset Sum. First, we show that determining the feasibility of bounded Integer Programs is a tractable problem wh...

The A-hierarchy is a parametric analogue of the polynomial hierarchy in the context of paramterised complexity theory. We give a new characterisation of the A-hierarchy in terms of a generalisation of the SUBSET-SUM problem.

It is well known that if S is a subset of the integers mod p, and if the second-largest Fourier coefficient is ``small'' relative to the largest coefficient, then the sumset S+S is much larger than S. We show in the present paper that if instead of having such a large ``spectral gap'' between the largest and second-largest Fourier coefficients, we had it between the kth largest and the (k+1)st largest, the same thing holds true, namely that |S+S| is appreciably larger than |S...

For a subset $A$ of an abelian group $G$, given its size $|A|$, its doubling $\kappa=|A+A|/|A|$, and a parameter $s$ which is small compared to $|A|$, we study the size of the largest sumset $A+A'$ that can be guaranteed for a subset $A'$ of $A$ of size at most $s$. We show that a subset $A'\subseteq A$ of size at most $s$ can be found so that $|A+A'| = \Omega(\min(\kappa^{1/3},s)|A|)$. Thus a sumset significantly larger than the Cauchy--Davenport bound can be guaranteed by a...

Suppose that G is an abelian group, A is a finite subset of G with |A+A|< K|A| and eta in (0,1] is a parameter. Our main result is that there is a set L such that |A cap Span(L)| > K^{-O_eta(1)}|A| and |L| = O(K^eta log |A|). We include an application of this result to a generalisation of the Roth-Meshulam theorem due to Liu and Spencer.

We obtain a non--trivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to growth of conjugates classes, estimates of exponential sums and the restriction phenomenon.

We show that any family of subsets $A\subseteq 2^{[n]}$ satisfies $\lvert A\rvert \leq O\bigl(n^{\lceil{d}/{2}\rceil}\bigr)$, where $d$ is the VC dimension of $\{S\triangle T \,\vert\, S,T\in A\}$, and $\triangle$ is the symmetric difference operator. We also observe that replacing $\triangle$ by either $\cup$ or $\cap$ fails to satisfy an analogous statement. Our proof is based on the polynomial method; specifically, on an argument due to [Croot, Lev, Pach '17].

Let $\mathbb{F}_q$ be a finite field of order $q$, where $q$ is large odd prime power. In this paper, we improve some recent results on the additive energy of the distance set, and on sumsets of the distance set due to Shparlinski (2016). More precisely, we prove that for $\mathcal{E}\subseteq \mathbb{F}_q^d$, if $d=2$ and $q^{1+\frac{1}{4k-1}}=o(|\mathcal{E}|)$ then we have $|k\Delta_{\mathbb{F}_q}(\mathcal{E})|=(1-o(1))q$; if $d\ge 3$ and $q^{\frac{d}{2}+\frac{1}{2k}}=o(|\m...

We investigate the size of subspaces in sumsets and show two main results. First, if A is a subset of F_2^n with density at least 1/2 - o(n^{-1/2}) then A+A contains a subspace of co-dimension 1. Secondly, if A is a subset of F_2^n with density at least 1/2-o(1) then A+A contains a subspace of co-dimension o(n).