ID: 1703.09549

Variations on the sum-product problem II

March 28, 2017

View on ArXiv

Similar papers 5

A Sum-Product Estimate for Well Spaced Sets

October 3, 2020

86% Match
Shengwen Gan, Alina Harbuzova
Combinatorics
Classical Analysis and ODEs

We study the $\delta$-discretized sum-product estimates for well spaced sets. Our main result is: for a fixed $\alpha\in(1,\frac{3}{2}]$, we prove that for any $\sim|A|^{-1}$-separated set $A\subset[1,2]$ and $\delta=|A|^{-\alpha}$, we have: $\mathcal{N}(A+A, \delta)\cdot \mathcal{N}(AA, \delta) \gtrsim_{\epsilon}|A|\delta^{-1+\epsilon}$.

Find SimilarView on arXiv

On the size of the set A(A+1)

November 26, 2008

86% Match
M. Z. Garaev, Chun-Yen Shen
Number Theory

Let $F_p$ be the field of a prime order $p.$ For a subset $A\subset F_p$ we consider the product set $A(A+1).$ This set is an image of $A\times A$ under the polynomial mapping $f(x,y)=xy+x:F_p\times F_p\to F_p.$ In the present paper we show that if $|A|<p^{1/2},$ then $$ |A(A+1)|\ge |A|^{106/105+o(1)}.$$ If $|A|>p^{2/3},$ then we prove that $$|A(A+1)|\gg \sqrt{p |A|}$$ and show that this is the optimal in general settings bound up to the implied constant. We also estimate the...

Find SimilarView on arXiv

Convexity, Superquadratic Growth, and Dot Products

September 29, 2021

86% Match
Brandon Hanson, Oliver Roche-Newton, Steven Senger
Combinatorics
Metric Geometry
Number Theory

Let $P \subset \mathbb R^2$ be a point set with cardinality $N$. We give an improved bound for the number of dot products determined by $P$, proving that, \[ |\{ p \cdot q :p,q \in P \}| \gg N^{2/3+c}. \] A crucial ingredient in the proof of this bound is a new superquadratic expander involving products and shifts. We prove that, for any finite set $X \subset \mathbb R$, there exist $z,z' \in X$ such that \[ \left|\frac{(zX+1)^{(2)}(z'X+1)^{(2)}}{(zX+1)^{(2)}(z'X+1)}\right| \...

Find SimilarView on arXiv

Difference sets are not multiplicatively closed

February 7, 2016

86% Match
Ilya D. Shkredov
Number Theory
Combinatorics

We prove that for any finite set A of real numbers its difference set D:=A-A has large product set and quotient set, namely, |DD|, |D/D| \gg |D|^{1+c}, where c>0 is an absolute constant. A similar result takes place in the prime field F_p for sufficiently small D. It gives, in particular, that multiplicative subgroups of size less than p^{4/5-\eps} cannot be represented in the form A-A for any A from F_p.

Find SimilarView on arXiv

Few products, many h-fold sums

September 25, 2014

86% Match
Albert Bush, Ernie Croot
Combinatorics
Number Theory

Improving upon a technique of Croot and Hart, we show that for every $h$, there exists an $\epsilon > 0$ such that if $A \subseteq \mathbb{R}$ is sufficiently large and $|A.A| \le |A|^{1+\epsilon}$, then $|hA| \ge |A|^{\Omega(e^{\sqrt{c\log{h}}})}$.

Find SimilarView on arXiv

Some remarks on the asymmetric sum--product phenomenon

May 26, 2017

86% Match
Ilya D. Shkredov
Number Theory
Combinatorics

Using some new observations connected to higher energies, we obtain quantitative lower bounds on $\max\{|AB|, |A+C| \}$ and $\max\{|(A+\alpha)B|, |A+C|\}$, $\alpha \neq 0$ in the regime when the sizes of finite subsets $A,B,C$ of a field differ significantly.

Find SimilarView on arXiv

The sum-product phenomenon in arbitrary rings

June 16, 2008

86% Match
Terence Tao
Combinatorics

The \emph{sum-product phenomenon} predicts that a finite set $A$ in a ring $R$ should have either a large sumset $A+A$ or large product set $A \cdot A$ unless it is in some sense "close" to a finite subring of $R$. This phenomenon has been analysed intensively for various specific rings, notably the reals $\R$ and cyclic groups $\Z/q\Z$. In this paper we consider the problem in arbitrary rings $R$, which need not be commutative or contain a multiplicative identity. We obtain ...

Find SimilarView on arXiv

Expanders with superquadratic growth

November 16, 2016

86% Match
Antal Balog, Oliver Roche-Newton, Dmitry Zhelezov
Combinatorics
Number Theory

We will prove several expanders with exponent strictly greater than $2$. For any finite set $A \subset \mathbb R$, we prove the following six-variable expander results: \begin{align*} |(A-A)(A-A)(A-A)| &\gg \frac{|A|^{2+\frac{1}{8}}}{\log^{\frac{17}{16}}|A|}, \\ \left|\frac{A+A}{A+A}+\frac{A}{A}\right| &\gg \frac{|A|^{2+\frac{2}{17}}}{\log^{\frac{16}{17}}|A|}, \\ \left|\frac{AA+AA}{A+A}\right| &\gg \frac{|A|^{2+\frac{1}{8}}}{\log |A|}, \\ \left|\frac{AA+A}{AA+A}\right| &\gg \...

Find SimilarView on arXiv

Attaining the exponent $5/4$ for the sum-product problem in finite fields

March 15, 2021

86% Match
Ali Mohammadi, Sophie Stevens
Combinatorics
Number Theory

We improve the exponent in the finite field sum-product problem from $11/9$ to $5/4$, improving the results of Rudnev, Shakan and Shkredov. That is, we show that if $A\subset \mathbb{F}_p$ has cardinality $|A|\ll p^{1/2}$ then \[ \max\{|A\pm A|,|AA|\} \gtrsim |A|^\frac54 \] and \[ \max\{|A\pm A|,|A/A|\}\gtrsim |A|^\frac54\,. \]

Find SimilarView on arXiv

An improved bound on $(A+A)/(A+A)$

June 10, 2016

86% Match
Ben Lund
Combinatorics

We show that, for a finite set $A$ of real numbers, the size of the set $$\frac{A+A}{A+A} = \left\{ \frac{a+b}{c+d} : a,b,c,d \in A, c+d \neq 0 \right \}$$ is bounded from below by $$\left|\frac{A+A}{A+A} \right| \gg \frac{|A|^{2+1/4}}{|A / A|^{1/8} \log |A|}.$$ This improves a result of Roche-Newton.

Find SimilarView on arXiv