Factorization in generalized arithmetic progressions and application to the Erdős-Szemerédi sum-product problems (Q1413651): Difference between revisions

Given a finite set \(A\) of integers, let \(r_h(n;A)\) denote the number of representations of \(n\) as a product of \(h\) elements of \(A\). A generalized \(d\)-dimensional arithmetic progression is the set \(\{c_0+\sum_{i=1}^d k_ic_i\); \(k_i\in{\mathbb Z}\), \(0\leq k_i\leq J_i\}\), where \(c_0,c_1,\dots,c_d\) and \(J_1,\dots,J_d\) are given integers. The author proves that if \(P\) is such a generalized \(d\)-dimensional arithmetic progression, then for arbitrary \(h\geq 2\) we have \(r_h(n;P)<\exp (C_{d,h}{\log J\over\log\log J})\), where \(J=\max_i J_i\). The proof uses the theory of algebraic numbers. From this result he deduces, among others, the following result in direction of the Erdős-Szemerédi sum-product problem [\textit{P. Erdős} and \textit{E. Szemerédi}, Birkhäuser Studies in Pure Mathematics, 213--218 (1983; Zbl 0526.10011)]: If the finite set \(A\) of integers satisfies \(|A+A|<C|A|\), then for all \(h\geq 2\) \(\underbrace{|A.\cdots.A|}_{h\text{ fold}}>c_{\varepsilon,h}|A|^{h-\varepsilon}\) for all \(\varepsilon>0\).