On some applications of GCD sums to arithmetic combinatorics
The paper at hand proves some new instances of the sum-product phenomenon over the integers. Theorems 1 and 12 provide an upper bound on the joint multiplicative energy of the (truncated) set of primes and an arbitrary set of integers (which holds under some technical conditions which we will not describe in this review). As a corollary, for example, the following is proven: if \(S\subset \mathbb{Z}\) satisfies \(|SS| \ll |S|\), then any arithmetic progression in \(S\) which begins at zero must be of size at most \(\ll \log |S| \cdot \log \log |S|\). Interestingly, this corollary may be viewed as obtaining an upper bound in an integer analogue of the well-studied (though still quite poorly understood) least quadratic non-residue problem in \(\mathbb{Z}/p\mathbb{Z}\). Indeed, the set of squares in \(\mathbb{Z}/p\mathbb{Z}\) is closed under multiplication, and an upper bound on the size of the largest arithmetic progression which starts at zero belonging to this set is clearly also an upper bound on the least quadratic non-residue. In fact, up to constant factors, the upper bound obtained here over the integers matches the best known (conditional on GRH) \textit{lower} bound in \(\mathbb{Z}/p\mathbb{Z}\). It is, however, unclear whether the same answer should be expected across contexts. In a slightly different direction, given finite sets \(A,S \subset \mathbb{Z}\) with control over the size of the sumset \(|A+A|\) and under some other technical conditions which we will not describe, the author obtains in Theorem 2 a lower bound on the size of the set \(|(A-a)S|\) for a particular \(a\in A\) (one therefore also trivially obtains a lower bound on \(|(A-A)S|\)). The proofs of the aforementioned results use the method of `GCD sums'. Loosely, one relates multiplicative energies to sums involving GCDs, which in turn may be bounded in terms of moments of a random zeta function like \[ \zeta_X(\alpha):= \prod_p (1-X_p/p^\alpha)^{-1}, \quad \] where the \(X_p\) are i.i.d. uniformly distributed on \(S^1\), for which upper bounds may be relatively directly obtained. We direct the reader to [\textit{M. Lewko} and \textit{M. Radziwiłł}, Adv. Math. 305, 280--297 (2017; Zbl 1375.11056)] for more on this connection and method. Finally, the author proves in Theorem 4 upper bounds on the joint additive energy of a suitably convex set and an arbitrary set. The proof proceeds purely combinatorially and without recourse to the arithmetic of the integers; indeed, the results hold over \(\mathbb{R}\).
- Additive combinatorics
- Bounding multiplicative energy by the sumset
- Energies and structure of additive sets
- Expanders with superquadratic growth
- GCD sums and sum-product estimates
- Higher convexity and iterated second moment estimates
- scientific article; zbMATH DE number 4185692 (Why is no real title available?)
- Large greatest common divisor sums and extreme values of the Riemann zeta function
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- On Character Sums and Primitive Roots†
- ON ITERATED PRODUCT SETS WITH SHIFTS
- On iterated product sets with shifts. II
- On the Bogolyubov-Ruzsa lemma
- Refinements of Gál's theorem and applications
- Some remarks on the asymmetric sum-product phenomenon
- The least quadratic non residue
- The structure theory of set addition revisited
- Topics in multiplicative number theory
This page was built for publication: On some applications of GCD sums to arithmetic combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239164)
