Add Journal to My Library
International Mathematics Research Notices
, Volume 2018 (5) – Mar 1, 2018

15 pages

/lp/ou_press/on-additive-bases-of-sets-with-small-product-set-kbAmtUgXJb

- Publisher
- Oxford University Press
- Copyright
- © The Author 2016. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permission@oup.com.
- ISSN
- 1073-7928
- eISSN
- 1687-0247
- D.O.I.
- 10.1093/imrn/rnw291
- Publisher site
- See Article on Publisher Site

Abstract We prove that finite sets of real numbers satisfying $$|AA| \leq |A|^{1+\epsilon}$$ with sufficiently small $$\epsilon > 0$$ cannot have small additive bases nor can they be written as a set of sums $$B+C$$ with $$|B|, |C| \geq 2$$. The result can be seen as a real analog of the conjecture of Sárközy that multiplicative subgroups of finite fields of prime order are additively irreducible. 1 Introduction The duality between the additive and multiplicative structure of an arithmetic set, now called “sum–product phenomena” has been extensively studied since the seminal paper of Erdős and Szemerédi [5]. In its classical formulation the duality is expressed in the fact that for a finite set of integers or reals $$A$$ either the set of pairwise sums $$A+A$$ or pairwise products $$AA$$ is significantly larger than the original set, unless $$A$$ is close to a subring of the ambient ring, see [22] for details. In the current paper we consider an intrinsic version of the sum–product phenomenon in the following setting. Assume that a set $$A \subset \mathbb{R}$$ has small multiplicative doubling, so that $$|AA| \leq |A|^{1+\epsilon}$$ for some sufficiently small $$\epsilon > 0$$ (we assume that $$\epsilon$$ is fixed and $$|A| > C(\epsilon)$$ is large). Recall that a set $$B$$ is called a basis (All bases in the present paper are assumed to be of order two.) for $$A$$ if each element in $$A$$ can be represented as a sum of two elements in $$B$$ or simply $$A \subseteq B+B$$. First, we show that if $$A$$ is multiplicatively structured in the above sense, then it does not admit small additive bases of order $$|A|^{1/2+c}$$ for an explicit constant $$c > 0$$. Theorem 1.1. There is an $$\epsilon > 0$$ such that the following holds: if $$B$$ is an arbitrary additive basis for a real set $$A$$ with $$|AA| \leq |A|^{1+\epsilon}$$ then |B|≫|A|1/2+1/442−o(1). □ Theorem 1.1 implies a “power-saving” estimate for the multiplicative energy $$E_\times$$ of a sumset or a difference set, significantly improving on the sub-exponential bound of [12]. Corollary 1. There is an effective constant $$\epsilon_0 > 0$$ such that for any set $$B$$ of real numbers holds E×(B±B)≤|B|6−ϵ0. □ In fact, we prove an even stronger statement than that of Theorem 1.1, replacing the condition $$A \subseteq B + B$$ by a weaker assumption that the number of pairs $$(b_1, b_2) \in B \times B : b_1 + b_2 \in A$$ is large, see the upcoming Lemma 3.3 for details. While slightly more technical, such a reformulation may be useful if one wishes to take into account the number of ways an element in $$A$$ can be represented as a sum $$b_1 + b_2$$, see Remark 1. Second, we show that $$A$$ is additively irreducible, that is, it cannot be written as a set of sums $$B+C$$ unless one of the sets consists of a single element. Theorem 1.2. There is an $$\epsilon > 0$$ such that for all sufficiently large $$A \subset \mathbb{R}$$ with $$|AA| \leq |A|^{1+\epsilon}$$ there is no decomposition $$A = B + C$$ with $$|B|, |C| \geq 2$$. □ Both theorems substantially extend the results of Roche-Newton and the second author [12], where a much more restrictive condition $$|AA| \leq K|A|$$ with $$K$$ fixed, was assumed. In particular, in the case at hand deep structural results such as the Freiman-type theorem of Sanders (see, e.g., [14]) and the Subspace theorem of Evertse et al. [6] are no longer available. Instead, we rely solely on techniques of additive combinatorics, which we see as the main innovation of the present paper. On the other hand, Theorem 1.2 extends the result of the first author [19], which is the specialisation of Theorem 1.2 to the case $$C = -B$$. Clearly, Theorem 1.2 has the following sum–product result as a corollary. Corollary 2. There is an absolute constant $$c > 0$$ such that for any real sets $$B, C$$ with $$|B|, |C| \geq 2$$ holds |(B+C)(B+C)|≫|B+C|1+c. □ Both questions considered in the paper arise as a natural extension of classical problems concerning thin additive bases and additive reducibility of integer sequences to the finite setting. One of the basic questions, posed by Erdős and Newman [4] in 1976, is to estimate the minimal basis size for a given set $$A$$ and, in particular, to decide if there is a very thin basis for $$A$$ of size of order $$|A|^{1/2}$$. They noted that while for a randomly picked set $$A$$ one should expect that no such basis exists, it is in general hard to prove such a claim for a specific set $$A$$. The question of additive irreducibility of integer sequences was posed by Ostmann [10] back in 1956. Perhaps the most notable conjecture of Ostmann, still wide open, is that the set of prime numbers cannot be written as a non-trivial set of sums $$B+C$$ even if one allows to discard a finite number of elements. We refer the reader to [2] for the history of the problem and [3] for the state of the art partial results (see also [7]). Sárközy [15] (see also [8] and references therein) extended such problems to the finite field setting, perhaps led by the intuition that in general “multiplicatively structured” sets should be additively irreducible (though this intuition may sometimes be misleading, as showed by Elsholtz in [1]). As a special case of this program, Sárközy conjectured that multiplicative subgroups of finite fields of prime order are additively irreducible, in particular the set of quadratic residues modulo a prime. Despite some progress (see, e.g., [18] and references therein), the conjecture of Sárközy is an important open problem with rich connections (to, e.g., multiplicative character sums). From this point of view, Theorem 1.2 can be seen as a real analog of Sárközy’s conjecture for small subgroups, and in fact the proof can be transferred to the finite field setting except a certain sum–product type estimate not currently available in finite fields. We discuss this matter in more detail at the end of the paper. The notation is briefly explained in the next section and is relatively standard in additive combinatorics. We recommend the reader to consult [22] for further details when needed. 2 Notation The following notation is used throughout the paper. The expressions $$X \gg Y$$, $$Y \ll X$$, $$Y = O(X)$$, $$X = \Omega(Y)$$ all have the same meaning that there is an absolute constant $$c > 0$$ such that $$|Y| \leq c|X|$$. The expressions $$X \gtrsim Y$$ and $$Y \lesssim X$$ both mean that $$|Y| = O(|X| \log^C |X|)$$ for some absolute constant $$C > 0$$. For a graph $$G$$, $$E(G)$$ denotes the set of edges and $$V(G)$$ denotes the set of vertices. If $$X$$ is a set then $$|X|$$ denotes its cardinality. For sets of numbers $$A$$ and $$B$$ the sumset $$A + A$$ is the set of all pairwise sums $$\{ a + a' : a, a' \in A \}$$, and similarly $$AA$$, $$A-A$$ denotes the set of products and differences, respectively. If $$G$$ is some graph with the vertex set identified with $$A$$ then $$A\stackrel{G}{+}A$$ denotes the set of sums $$\{ a + a' : (a, a') \in E(G) \}$$ (with the obvious generalisation to all arithmetic operations). For a bipartite graph $$G$$ with parts $$(V_1, V_2)$$ we will occasionally use the term bipartite density for the quantity $$\frac{|E(G)|}{|V_1||V_2|}$$. For a general graph, the edge density is defined as the quotient $$\frac{|E(G)|}{|V(G)|^2}$$, where the standard notation $$E(G), V(G)$$ is used for the set of edges and vertices, respectively. For a vertex $$v \in V(G)$$, $$N(v)$$ denotes the set of neighbours of $$v$$. The additive energy $$E_+(A)$$ (see [22], Definition 2.8) denotes the number of additive quadruples $$(a_1, a_2, a_3, a_4)$$ such that $$a_1 + a_2 = a_3 + a_4$$. The multiplicative energy $$E_\times$$ is defined similarly as the number of multiplicative quadruples. 3 Proof of Theorem 1.1 In what follows we will always assume that $$0 \notin A$$ but $$1 \in A$$ which one can do without loss of generality. We will use the following result of the first author (Theorem 5.4 in [17]). Theorem 3.1. Let $$A \subset \mathbb{R}$$ be such that $$|AA| = M|A|$$. Then E+(A)≪M14/13|A|32/13log71/65|A|. □ Combining with the Plünnecke–Ruzsa inequality [22, Corollary 6.29], we have the following corollary. Corollary 3. For any $$c < 1/26$$ there is $$\epsilon > 0$$ such that for any $$A \subset \mathbb{R}$$ with $$|AA| \leq |A|^{1+\epsilon}$$ holds E+(AA/A)≪|A|5/2−c. □ Recall the following graph–theoretic lemma of Gowers (see, e.g., [22, Lemma 6.19]). Lemma 3.2. Let $$G$$ be a bipartite graph on $$(B_1, B_2)$$ where $$|B_1| = |B_2| = n$$ and $$0 < \alpha = E(B_1, B_2)/n^2$$. Let $$0 < \epsilon < 1$$ be fixed. Then there is a subset $$B'_1 \subseteq B_1$$ with $$|B'_1| \geq \alpha n/2$$ such that for at least $$(1-\epsilon)|B'_1|^2$$ of the ordered pairs of vertices $$(v_1, v_2) \in B'_1 \times B'_1$$ the following holds: |N(v1)∩N(v2)|≥ϵα2n2. □ In what follows, we use a weaker definition of a basis, merely assuming that the number of pairs $$(b_1, b_2) \in B \times B: b_1 + b_2 \in A$$ is large. First, it allows one to take into account “multiplicities,” that is, elements in $$A$$ which have many representations as a sum. Second, it gives additional flexibility by relaxing the condition that $$B+B$$ contains all elements in $$A$$. For this matter, let us call a set $$B$$ an $$(L, K)$$-basis for $$A$$, with $$K,L \ge 1$$, if $$|B| = K|A|^{1/2}$$ and |{(b1,b2):b1+b2∈A}|=L−1|A|. We will also make a use of the containment graph$$G$$, which is a bipartite graph $$G$$ on $$(B, B)$$ such that $$(b_1, b_2) \in E(G)$$ if and only if $$b_1 + b_2 \in A$$. In particular, if $$B$$ is an $$(L, K)$$-basis, one has $$|E(G)| = L^{-1}|A| = |B|^2/LK^2$$, so the bipartite edge density of $$G$$ is $$L^{-1}K^{-2}$$. Lemma 3.3 (The set of popular differences contains an almost closed difference set) Let $$B$$ be an $$(L, K)$$-basis for $$A$$. Then there is $$B' \subset B$$ with $$|B'| \gg L^{-1}K^{-2}|B|$$ such that for at least $$0.99 |B'|^2$$ of the ordered pairs $$(b_1, b_2) \in B' \times B'$$ the equation b1−b2=a−a′ (1) has at least $$\Omega(L^{-2}K^{-3}|A|^{1/2})$$ solutions $$(a, a') \in A \times A$$. □ Proof. Applying Lemma 3.2 to the containment graph $$G$$ we obtain a set $$B'$$ of size $$\Omega(L^{-1}K^{-2}|B|)$$ such that for $$0.99 |B'|^2$$ of the ordered pairs $$(b_1, b_2) \in B' \times B'$$ holds |N(b1)∩N(b2)|≥Ω(L−2K−4|B|). On the other side, if $$b \in N(b_1) \cap N(b_2)$$ then by construction $$b + b_1 = a$$ and $$b + b_2 = a'$$ for some $$a, a' \in A$$, which after rearranging gives b1−b2=a−a′. Since, $$b + b_1$$ are all distinct as $$b$$ varies, we obtain at least $$|N(b_1) \cap N(b_2)|$$ distinct solutions of (1) for a fixed pair $$(b_1, b_2)$$ (and $$(b_2, b_1)$$ as well). The result follows. ■ Another ingredient is a beautiful incidence result, originally proved by Jones [9] with a shorter proof discovered by Roche-Newton [11]. Lemma 3.4. Let $$A \subset \mathbb{R}$$. Then the number of solutions to (a−b)(a′−c′)=(a−c)(a′−b′) (2) such that $$a, a', b, b', c, c' \in A$$ is $$O(|A|^4 \log |A|)$$. □ The following lemma is crucial for the proof. Lemma 3.5 (Generating a large set of popular differences). Let $$B$$ be an $$(L, K)$$-basis for $$A$$. Then there is a set $$R$$ such that the following holds. (i) $$R \subseteq A/A$$. (ii) $$|R| \gtrsim L^{-8}K^{-14}|A|$$. (iii) For any $$x \in R$$, the equation 1−x=α1−α2 has at least $$\Omega(L^{-2}K^{-3}|A|^{1/2})$$ distinct solutions $$(\alpha_1, \alpha_2)$$ with $$\alpha_1, \alpha_2 \in A/A$$. □ Proof. Let $$B'$$ be the set given by Lemma 3.3. Let us call a pair $$(b_1, b_2) \in B' \times B'$$rich if $$|N(b_1) \cap N(b_2)| \gg L^{-2}K^{-3}|A|^{1/2}$$ in the containment graph $$G$$, so that at least 99% of pairs are rich. Take R={b2+bb1+b:(b1,b2) is rich,b∈N(b1)∩N(b2)}. The first claim follows from the construction of the containment graph, so it remains to prove (ii) and (iii). For $$x \in R$$, define n(x):=|{(b2,b1,b):x=b2+bb1+b,(b1,b2) is rich,b∈N(b1)∩N(b2)}| and Q:=|{(b2,b1,b,b2′,b1′,b′)∈B6:b2+bb1+b=b2′+b′b1′+b′}|. We get by the Cauchy–Schwartz inequality L−2K−3|B′|2|A|1/2≪∑x∈Rn(x)≤|R|1/2(∑x∈Rn2(x))1/2≤|R|1/2Q1/2. But by Lemma 3.4 we have $$Q \ll |B|^4 \log |B|$$ and combining with the bound $$|B'| \gg L^{-1}K^{-1}|A|^{1/2}$$ we obtain L−8K−14|A|≲|R|. For the third bullet, for an $$x \in R$$ fix $$(b_1, b_2, b)$$ such that $$x = (b_2 + b)/(b_1 + b)$$ and observe that 1−b2+bb1+b=b1−b2b1+b=b1+b′b1+b−b2+b′b1+b. (3) If we vary over $$b' \in N(b_1) \cap N(b_2)$$, the pairs $$(b_1 + b')/(b_1 + b), (b_2 + b')/(b_1 + b)$$ are all distinct, and the claim follows since $$b_1 + b', b_2 + b', b_1 + b$$ are all in $$A$$ by construction. ■ he next lemma is simple but powerful. Lemma 3.6 (Generating a larger set additive quadruples). Assume $$1 \in X$$. Let $$R \subset X$$ such that for any $$x \in R$$ the equation 1−x=α1−α2 has at least $$N$$ solutions $$(\alpha_1, \alpha_2) \in X \times X$$. Then for any set $$Y$$ one has the estimate E+(YX)≥N|Y||R|. □ Proof. By definition, $$E_+(YX)$$ is the number of additive quadruples $$(y_1, y_2, y_3, y_4)$$ such that $$y_i \in YX$$ and $$y_1 - y_2 = y_3 - y_4$$. If $$1 - x = \alpha_1 - \alpha_2$$ with $$x, \alpha_1, \alpha_2 \in X$$, then clearly $$(y, yx, y\alpha_1, y\alpha_2)$$ is an additive quadruple with elements in $$YX$$ (remember that $$1 \in X$$ so $$y \in YX$$). It remains to check that such quadruples are all distinct. But if (y,yx,yα1,yα2)=(y′,y′x′,y′α1′,y′α2′) then $$y = y'$$ and $$(x, \alpha_1, \alpha_2) = (x', \alpha'_1, \alpha'_2)$$, therefore the number of additive quadruples is at least $$|Y|$$ times the number of distinct triples $$(x, \alpha_1, \alpha_2)$$, which is at least $$N|R|$$. ■ It remains to put everything together. Proof. (of Theorem 1.1) Let $$B$$ be an $$(L, K)$$-basis. Applying Lemma 3.5 and then Lemma 3.6 with $$Y = A$$ and $$X = R$$ from Lemma 3.5 we obtain E+(AA/A)≫L−2K−3|A|3/2|R|≳L−10K−17|A|5/2. (4) On the other hand, by Corollary 3 E+(AA/A)≲|A|5/2−c provided $$|AA|/|A|$$ is small enough. We then have L10K17≳|A|c. (5) In particular, if $$B$$ is a basis for $$A$$ then |B|≳|A|1/2+c/17. ■ We record an immediate Corollary of Theorem 1.1. Corollary 4. There is an $$\epsilon > 0$$ and an absolute constant $$c > 0$$, such that for any $$A \subset \mathbb{R}$$ with $$|AA| \leq |A|^{1+\epsilon}$$ the following holds. If $$A \subset B+C$$ for some real sets $$B, C$$ then max(|B|,|C|)≫|A|1/2+c. If $$B + C \subset A$$ for some real sets $$B, C$$ then min(|B|,|C|)≪|A|1/2−c. □ Proof. The first claim follows immediately from Theorem 1.1 and the fact that $$B \cup C$$ is a basis for $$A$$ of size $$O(\max(|B|, |C|))$$. In the second case, assume $$|B| \leq |C|$$ and let $$B'$$ be an arbitrary subset of $$C$$ of size $$|B|$$. Then $$B \cup B'$$ is a basis for $$A' := B+B'$$ of size at most twice $$\min(|B|, |C|)$$. Applying Lemma 3.5 and then Lemma 3.6 we obtain similarly to (4) E+(A′A′/A′)≳|B′|2|B′||B′|2=|B′|5. But clearly $$A' \subset A$$, so $$E_+(A'A'/A') \leq E_+(AA/A)$$. On the other hand, by Corollary 3 E+(AA/A)≲|A|5/2−c and the claim follows. ■ The proof of Corollary 1 is a simple application of the Balog–Szemerédi–Gowers theorem (BSG) (see [22]) so we present it in a sketchy manner. Let $$X = B \pm B$$. Since trivially $$E_{\times}(X) \ll |X|^3$$ we may assume that $$|X| \gg |B|^{2 - \epsilon}$$ with $$\epsilon$$ to be defined in due course. If now one assumes that E×(X)≫|X|3−ϵ, then by BSG there is $$X' \subset X$$ such that $$|X'X'| \leq |X'|^{1+\epsilon'}$$ and $$|X'| \gg |X|^{1-\epsilon'}$$ with $$\epsilon'$$ depending polynomially on $$\epsilon$$. But $$X' \subset X = B \pm B$$ and whence $$B \cup (-B)$$ is a basis for $$X'$$ of size $$O(|X'|^{1/2 + \epsilon''})$$ with polynomial dependence of $$\epsilon''$$ on $$\epsilon$$. Taking $$\epsilon$$ small enough, we contradict Theorem 1.1 and the claim follows. Remark 1. The following question was posed in [19]. Assume that $$A\subseteq B-B$$, $$|AA| \le |A|^{1+\varepsilon}$$, where $$\varepsilon > 0$$ is small. Is it true that there is $$\delta= \delta(\varepsilon)$$ such that σA(B):=∑x∈A|{b1−b2=x : b1,b2∈B}|≪|B|2−δ? It is easy to see that our methods allow one to resolve the problem in the affirmative. Indeed, put $$\sigma = \sigma_A (B)$$ and consider the graph with $$B$$ as the vertex set and two vertices $$x,y$$ adjacent if and only if $$x-y \in A$$. Then the edge density of the graph is $$\alpha := \sigma / |B|^2$$. Next, repeat the arguments of Section 3 and obtain that for a sufficiently small $$\varepsilon$$ holds |A|5/2−c≳α2|B||A||R|≳α10|B|3|A| and hence since $$A\subseteq B-B$$ σ≲|B|2⋅|A|−c/10⋅(|A|3/2|B|3)1/10≤|B|2⋅|A|−c/10. (6) The asymmetric case with two different sets $$B,C$$ is considered in the next section. In this case one can obtain an analog of the upper bound (6) of the form ∑x∈A|{b+c=x : b∈B,c∈C}|≲|B||C|⋅|A|−c/10. □ Remark 2. It is highly probable that the exponent $$1/2+1/442$$ in Theorem 1.1 can be improved, perhaps even to $$1-o(1)$$. We pose a much more modest question, which however does not seem to follow from the results of the present paper. Is it true that there exists $$c, \epsilon > 0$$ such that for all sufficiently large real sets $$B$$ such that $$A \subset B+B $$ with $$|AA| \leq |A|^{1+\epsilon}$$ holds |B+B|≫|A|1+c? □ 4 Additive Irreducibility of Multiplicative Sets In this section we prove Theorem 1.2. From now on we assume for the sake of contradiction that $$A = B+C$$ with $$|B| \geq |C| \geq 2$$ and $$|AA| \leq |A|^{1+\epsilon}$$ with $$\epsilon$$ small enough. First, note that it follows from Lemma 29 of [19] that for $$\alpha \neq 0$$ and $$A$$ such that $$|AA| \leq M|A|$$ holds |A∩(A+α)|≤M4/3|A|2/3. (7) For any $$c_1 \neq c_2 \in C$$ one has $$(B + c_1) \subseteq A \cap (A + (c_1 - c_2))$$, and thus by (7) and the trivial bound $$|B||C| \geq |A|$$ one concludes that $$|B|, |C| \gg |A|^{1/3 - \epsilon}$$, say. Hence, we can safely assume that both $$|B|, |C|$$ are large. An inspection of the proof of Theorem 1.1 reveals that if we put X={b1+cb2+c:b1,b2∈B,c∈C} and Y={c1+bc2+b:b∈B,c1,c2∈C} then one has that E+(AA/A)≫min (|A||X||C|,|A||Y||B|). Thus, by Corollary 3 one has |X||C|≪|A|3/2−c and |Y||B|≪|A|3/2−c (8) for some explicit $$c > 0$$. However, sufficiently good lower bounds for $$|X|$$ and $$|Y|$$ are not readily available. Let $$T(X, Y, Z)$$ be the number of collinear triples of distinct points $$(x, y, z)$$ with $$x \in X \times X$$, $$y \in Y \times Y$$, $$z \in Z \times Z$$. Following the lines of Lemma 3.5 we have by the Cauchy–Schwarz inequality |X|≫|B|4|C|2T(B,B,−C), (9) and |Y|≫|C|4|B|2T(C,C,−B), (10) Indeed, without loss of generality it suffices to check that if, say, y:=c1+bc2+b=c1′+b′c2′+b′ then either the points $$(c_1, c'_1), (c_2, c'_2), (-b, -b')$$ are all distinct and collinear or $$y \in \{0, 1, \infty \}$$. But we can simply exclude such degenerate values from $$X$$ and $$Y$$ and thus justify (9) and (10). We prove the following estimate with $$|C| \leq |B|$$ which improves on Lemma 3.4 when $$|B|$$ is significantly larger than $$|C|$$. Lemma 4.1 (Bounding collinear triples for different sets). For sets $$C \times C$$ and $$B \times B$$ with $$|B| \geq |C|$$ holds T(C,C,B)≪|B|4/3|C|8/3log2|B|. □ Proof. Write $$L_{i, j}$$, $$i,j\ge 0$$ for the set of lines $$\ell$$ such that $$2^{i} \leq |\ell \cap (C \times C)| < 2^{i+1}$$ and $$2^{j} \leq |\ell \cap (B \times B)| < 2^{j+1}$$. Then T(C,C,B)≪∑i=0log|C|∑j=0log|B||Li,j|22i2j. Since the number of summands is at most $$\log^2 |B|$$ it is enough to bound each term by $$|B|^{4/3}|C|^{8/3}$$. For the sake of notation, denote $$k = 2^i$$ and $$l = 2^j$$, $$L = L_{i,j}$$ so that out task is to estimate $$|L|k^2l$$ where $$L$$ is the set of lines intersecting $$C \times C$$ in $$k$$ (up to a factor of two) points and $$B \times B$$ in $$l$$ points (again, up to a factor of two). By the Szemerédi–Trotter theorem [22], for $$k \geq 2, l \geq 2$$ holds |L|≪min(|C|4k3+|C|2k,|B|4l3+|B|2l), so T:=k2l|L|≪min(l|C|4k+kl|C|2,k2|B|4l2+k2|B|2):=min(M1,M2). Before we proceed, let us rule out the cases not covered by the Szemerédi–Trotter theorem as stated above. Since each line contains at least two distinct points in $$C \times C$$, only the case $$l = 1$$ should be considered separately. In this case we have T≪|C|4k+k|C|2≪|C|4≤|B|4/3|C|8/3, which is the desired bound. Next, since always $$k \leq |C|$$, $$l \leq |B|$$, we obtain that $$\frac{ l |C|^4}{k} \gg M_1$$ and $$\frac{k^2 |B|^4}{l^2} \gg M_2$$, so T3≪M12M2≪(l|C|4k)2⋅k2|B|4l2=|C|8|B|4 or T≪|B|4/3|C|8/3. This finishes the proof. ■ Combining Lemma 4.1, estimate (10), and the trivial bounds $$|B||C| \geq |A|, |B| \geq |A|^{1/2}$$, we have $$T(C, C, B) \lesssim |C|^{8/3}|B|^{4/3} $$ and |Y||B|≳|C|4/3|B|2/3|B|=(|C||B|)4/3|B|1/3≥|A|4/3+1/6=|A|3/2, which contradicts (8) if $$|A|$$ is large enough. Thus, $$A$$ is additively irreducible. Remark 3. Instead of using the graph approach as it was done in Sections 3 and 4 one can apply in the proof of Theorem 1.2 the following analog of the formula (3) 1−b1+cb2+c=b2+c′b2+c(1−b1+c′b2+c′), which holds for any $$b_1,b_2\in B$$ and all $$c,c'\in C$$. It means in particular, in the notation of Section 4, that taking an arbitrary $$x\in X$$, we have at least $$|C|$$ solutions to the equation 1−x=y(1−x∗), where $$y\in Y$$ and $$x_* \in X$$ are fixed. Of course, one can replace $$X$$ and $$Y$$ in the last formula. It immediately gives that $$E_{+} (AA/A) \ge |X||C||A|$$ and $$E_{+} (AA/A) \ge |Y||B||A|$$. □ 5 Discussion First, let us note that the only feature of the reals we have used, which is not available in an arbitrary field, is the Szemerédi–Trotter theorem (which is also used in the proof of Theorem 3.1). Thus, our results can be readily extended to the sets of complex numbers thanks to the extensions of the Szemerédi–Trotter theorem to the complex plane due to Zahl [25] and Toth [23]. However, when we replace $$A$$ with a sufficiently small multiplicative subgroup of $$\mathbb{F}_p$$, the situation becomes more subtle. For multiplicative subgroups Theorem 3.1 can be substituted with a similar energy bound, beating the exponent $$5/2$$, as was shown by the first author [16]. Next, it follows from the result of Shkredov and Vyugin [20] (see also the paper [21] by Shparlinski) that if a multiplicative subgroup $$G$$ is written as a non-trivial sumset $$B+C$$, then necessarily $$|G|^{1/2+o(1)} \ll |B|, |C| \ll |G|^{1/2+o(1)}$$. Further, a slightly weaker form of the Szemerédi–Trotter bound for the number of incidences for Cartesian products in $$\mathbb{F}^2_p$$ is now available, see [24]. Thus, the only remaining obstacle for translating Theorem 1.2 to subgroups is to find a substitute for Lemma 3.4, which we were unable to do. However, as was shown in [24], see also [13] the bound $$O(|A|^4 \log |A|)$$ of Lemma 4 can indeed be replaced with $$O(|A|^{9/2})$$, which only barely falls short of the desired bound. Finally, let us mention that similarly to Section 3 one can slightly weaken the hypothesis of Theorem 1.2 and assume only that the number of pairs $$(b, c) \in B \times C : b + c \in A$$ is large. We leave the details for the interested reader. Funding This work was supported by Russian Scientific Foundation grant 14-11-00433 to I.D.S. Acknowledgements The authors would like to thank Tomasz Schoen, Misha Rudnev, and Oliver Roche-Newton for useful discussions and the anonymous referees for valuable suggestions. The second author would like to acknowledge the hospitality of Adam Mickiewicz University in Poznan at which the work on the present paper was partially conducted. References [1] Elsholtz, C. “Multiplicative decomposability of shifted sets.” Bulletin London Mathematical Society 40, no. 1 ( 2008): 97– 107. Google Scholar CrossRef Search ADS [2] Elsholtz, C. “Additive decomposability of multiplicatively defined sets.” Functiones et Approximatio Commentarii Mathematici 35, no. 1 ( 2006): 61– 77. Google Scholar CrossRef Search ADS [3] Elsholtz, C., and Harper. A. “Additive decompositions of sets with restricted prime factors.” Transactions of the American Mathematical Society 367, no. 10 ( 2015): 7403– 27. Google Scholar CrossRef Search ADS [4] Erdős, P., and Newman. D. J. “Bases for sets of integers.” Journal of Number Theory 9, no. 4 ( 1977): 420– 5. Google Scholar CrossRef Search ADS [5] Erdős, P., and Szemerédi. E. Sums and Products of Integers . Studies in Pure Mathematics. Basel: Birkhäuser, 1983. Google Scholar CrossRef Search ADS [6] Evertse, J.-H., Schlickewei, H. P. and Schmidt. W. M. “Linear equations in variables which lie in a multiplicative group.” Annals of Mathematics 155, no. 3 ( 2002): 807– 36. Google Scholar CrossRef Search ADS [7] Green, B., and Harper. A. “Inverse questions for the large sieve.” Geometric and Functional Analysis 24, no. 4 ( 2014): 1167– 203. Google Scholar CrossRef Search ADS [8] Gyarmati, K., Mauduit, C. and Sárközy. A. “On reducible and primitive subsets of $$\mathbb{F}_p$$, I.” Integers 15A ( 2015): A6, 21. [9] Jones, T. G. F. “New quantitative estimates on the incidence geometry and growth of finite sets.” PhD Thesis, University of Bristol, arXiv:1301.4853, 2013. [10] Ostmann, H.-H. Additive Zahlentheorie , l. 2, Berlin: Springer, 1956. [11] Roche-Newton, O. “A short proof of a near-optimal cardinality estimate for the product of a sum set.” 31st International Symposium on Computational Geometry, vol. 34, 74– 80, Wadern, Schloss Dagstuhl. Leibniz-Zent. Inform., 2015. [12] Roche-Newton, O., and Zhelezov. D. “A bound on the multiplicative energy of a sum set and extremal sum-product problems.” Moscow Journal of Combinatorics and Number Theory 5, no. 1 ( 2015): 53– 70. [13] Roche-Newton, O., Rudnev, M. and Shkredov. I. D. “New sum-product type estimates over finite fields.” Advances in Mathematics 293 ( 2016): 589– 605. [14] Sanders, T. “The structure theory of set addition revisited.” Bulletin of the American Mathematical Society (N.S.) 50, no. 1 ( 2013): 93– 127. Google Scholar CrossRef Search ADS [15] Sárközy, A. “On additive decompositions of the set of quadratic residues modulo $$p$$.” Acta Arithmetica 155, no. 1 ( 2012): 41– 51. Google Scholar CrossRef Search ADS [16] Shkredov, I. D. “Some new inequalities in additive combinatorics.” Moscow Journal of Combinatorics and Number Theory 3, no. 3–4 ( 2013): 237– 88. [17] Shkredov, I. D. “Some new results on higher energies.” Transactions of the Moscow Mathematical Society 74 ( 2013): 31– 63. Google Scholar CrossRef Search ADS [18] Shkredov, I. D. “Sumsets in quadratic residues.” Acta Arithmetica 164, no. 3 ( 2014): 221– 43. Google Scholar CrossRef Search ADS [19] Shkredov, I. D. “Difference sets are not multiplicatively closed.” Discrete Analysis no. 17 ( 2016): 20 pp. [20] Shkredov, I. D. and Vyugin. I. V. “On additive shifts of multiplicative subgroups.” Matematicheskii Sbornik 203, no. 6 ( 2012): 81– 100. Google Scholar CrossRef Search ADS [21] Shparlinski, I. “Additive decompositions of subgroups of finite fields.” SIAM Journal on Discrete Mathematics 27, no. 4 ( 2013): 1870– 9. Google Scholar CrossRef Search ADS [22] Tao, T., and Vu. V. Additive Combinatorics . Cambridge, Cambridge University Press, 2006. Google Scholar CrossRef Search ADS [23] Tóth, C. “The Szemerédi-Trotter theorem in the complex plane}.” Combinatorica 35, no. 1 ( 2015): 95– 126. Google Scholar CrossRef Search ADS [24] Yazici, A. S., Murphy, B. Rudnev, M. and Shkredov. I. D. “Growth estimates in positive characteristic via collisions.” International Mathematics Research Notices 2016 ( 2016): 1– 42. [25] Zahl, J. “A Szemerédi-Trotter type theorem in $$\Bbb{R}4$$.” Discrete & Computational Geometry 54, no. 3 ( 2015): 513– 72. Google Scholar CrossRef Search ADS © The Author 2016. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permission@oup.com. This article is published and distributed under the terms of the Oxford University Press, Standard Journals Publication Model (https://academic.oup.com/journals/pages/about_us/legal/notices) For permissions, please e-mail: journals. permissions@oup.com

International Mathematics Research Notices – Oxford University Press

**Published: ** Mar 1, 2018

Loading...

personal research library

It’s your single place to instantly

**discover** and **read** the research

that matters to you.

Enjoy **affordable access** to

over 12 million articles from more than

**10,000 peer-reviewed journals**.

All for just $49/month

Read as many articles as you need. **Full articles** with original layout, charts and figures. Read **online**, from anywhere.

Keep up with your field with **Personalized Recommendations** and **Follow Journals** to get automatic updates.

It’s easy to organize your research with our built-in **tools**.

Read from thousands of the leading scholarly journals from *SpringerNature*, *Elsevier*, *Wiley-Blackwell*, *Oxford University Press* and more.

All the latest content is available, no embargo periods.

## “Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”

Daniel C.

## “Whoa! It’s like Spotify but for academic articles.”

@Phil_Robichaud

## “I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”

@deepthiw

## “My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”

@JoseServera

- Read unlimited articles
- Personalized recommendations
- No expiration
- Print 20 pages per month
- 20% off on PDF purchases
- Organize your research
- Get updates on your journals and topic searches

**$49/month**

Start Free Trial

14-day Free Trial

Best Deal — 39% off
### Annual Plan

- All the features of the Professional Plan, but for
**39% off**! - Billed annually
- No expiration
- For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

~~$588~~

**$360/year**

Start Free Trial

14-day Free Trial

Read and print from thousands of top scholarly journals.

System error. Please try again!

or

By signing up, you agree to DeepDyve’s Terms of Service and Privacy Policy.

Already have an account? Log in

Bookmark this article. You can see your Bookmarks on your DeepDyve Library.

To save an article, **log in** first, or **sign up** for a DeepDyve account if you don’t already have one.