LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

ON ITERATED PRODUCT SETS WITH SHIFTS

Photo by rachitank from unsplash

We prove that, for any finite set $A \subset \mathbb Q$ with $|AA| \leq K|A|$ and any positive integer $k$, the $k$-fold product set of the shift $A+1$ satisfies the… Click to show full abstract

We prove that, for any finite set $A \subset \mathbb Q$ with $|AA| \leq K|A|$ and any positive integer $k$, the $k$-fold product set of the shift $A+1$ satisfies the bound $$| \{(a_1+1)(a_2+1) \cdots (a_k+1) : a_i \in A \}| \geq \frac{|A|^k}{(8k^4)^{kK}}. $$ 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 $\Lambda$-constants used in harmonic analysis, applied to Dirichlet polynomials.

Keywords: product; sets shifts; product sets; iterated product

Journal Title: Mathematika
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.