Hostname: page-component-74656f9884-kv2lp Total loading time: 0 Render date: 2026-11-06T12:15:26.986Z Has data issue: false hasContentIssue false

ON ITERATED PRODUCT SETS WITH SHIFTS

Published online by Cambridge University Press:  21 May 2019

Brandon Hanson
Affiliation:
University of Georgia, Athens, GA, U.S.A. email brandon.w.hanson@gmail.com
Oliver Roche-Newton
Affiliation:
Johann Radon Institute for Computational and Applied Mathematics, Linz, Austria email o.rochenewton@gmail.com
Dmitrii Zhelezov
Affiliation:
Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary email dzhelezov@gmail.com

Abstract

We prove that, for any finite set $A\subset \mathbb{Q}$ with $|AA|\leqslant K|A|$ and any positive integer $k$, the $k$-fold product set of the shift $A+1$ satisfies the bound

$$\begin{eqnarray}|\{(a_{1}+1)(a_{2}+1)\cdots (a_{k}+1):a_{i}\in A\}|\geqslant \frac{|A|^{k}}{(8k^{4})^{kK}}.\end{eqnarray}$$
This result is essentially optimal when $K$ is of the order $c\log |A|$, for a sufficiently small constant $c=c(k)$. Our main tool is a multiplicative variant of the $\unicode[STIX]{x1D6EC}$-constants used in harmonic analysis, applied to Dirichlet polynomials.

Information

Type
Research Article
Copyright
Copyright © University College London 2019