English
Related papers

Related papers: The sum-product conjecture is false for real numbe…

200 papers

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite…

Combinatorics · Mathematics 2014-02-25 Antal Balog , Oliver Roche-Newton

We provide a new exponent for the Sum-Product conjecture on $\mathbb{R} $. Namely for $A \subset \mathbb{R}$ finite, \[ \max \left\{ \left\lvert A+A \right\rvert , \left\lvert AA \right\rvert \right\} \gg_{\epsilon} \left\lvert A…

Combinatorics · Mathematics 2026-02-02 Adam Cushman

It is established that there exists an absolute constant $c>0$ such that for any finite set $A$ of positive real numbers $$|AA+A| \gg |A|^{\frac{3}{2}+c}.$$ On the other hand, we give an explicit construction of a finite set $A \subset…

Combinatorics · Mathematics 2018-10-03 Oliver Roche-Newton , Imre Z. Ruzsa , Chun-Yen Shen , Ilya D. Shkredov

This paper considers various formulations of the sum-product problem. It is shown that, for a finite set $A\subset{\mathbb{R}}$, $$|A(A+A)|\gg{|A|^{\frac{3}{2}+\frac{1}{178}}},$$ giving a partial answer to a conjecture of Balog. In a…

Combinatorics · Mathematics 2014-01-09 Brendan Murphy , Oliver Roche-Newton , Ilya D. Shkredov

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…

Combinatorics · Mathematics 2009-02-23 Terence Tao

We improve a result of Solymosi on sum-products in R, namely, we prove that max{|A+A|,|AA|}\gg |A|^{4/3+c}, where c>0 is an absolute constant. New lower bounds for sums of sets with small product set are found. Previous results are improved…

Combinatorics · Mathematics 2015-03-31 Sergei Konyagin , Ilya D. Shkredov

The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…

Combinatorics · Mathematics 2007-05-23 Mei-Chu Chang

Let $A$ be a finite subset of $\ffield$, the field of Laurent series in $1/t$ over a finite field $\mathbb{F}_q$. We show that for any $\epsilon>0$ there exists a constant $C$ dependent only on $\epsilon$ and $q$ such that…

Number Theory · Mathematics 2013-03-05 Thomas Bloom , Timothy G. F. Jones

We improve a previous sum--products estimates in R, namely, we obtain that max{|A+A|,|AA|} \gg |A|^{4/3+c}, where c any number less than 5/9813. New lower bounds for sums of sets with small the product set are found. Also we prove some pure…

Combinatorics · Mathematics 2016-02-11 Sergei Konyagin , Ilya D. Shkredov

The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here,…

Number Theory · Mathematics 2020-09-22 Brandon Hanson , Oliver Roche-Newton , Dmitrii Zhelezov

We show that there exists an absolute constant $c > 0$, such that, for any finite set $A$ of quaternions, \[ \max\{|A+A, |AA| \} \gtrsim |A|^{4/3 + c}. \] This generalizes a sum-product bound for real numbers proved by Konyagin and…

Combinatorics · Mathematics 2021-11-11 Abdul Basit , Ben Lund

We prove that finite sets of real numbers satisfying $|AA| \leq |A|^{1+\epsilon}$ with sufficiently small $\epsilon > 0$ cannot have small additive bases nor can they be written as a set of sums $B+C$ with $|B|, |C| \geq 2$. The result can…

Number Theory · Mathematics 2016-11-22 Ilya D. Shkredov , Dmitrii Zhelezov

We prove the following theorem: for all positive integers $b$ there exists a positive integer $k$, such that for every finite set $A$ of integers with cardinality $|A| > 1$, we have either $$ |A + ... + A| \geq |A|^b$$ or $$ |A \cdot ...…

Combinatorics · Mathematics 2007-05-23 Jean Bourgain , Mei-Chu Chang

We show that if $A\subset \mathbb{Z}$ is a finite set of integers in which every integer is divisible by $O(1)$ many primes then \[\max(\lvert A+A\rvert,\lvert AA\rvert) \geq \lvert A\rvert^{12/7-o(1)}\] and, for any $m\geq 2$,…

Number Theory · Mathematics 2026-01-07 Rishika Agrawal , Thomas F. Bloom , Giorgis Petridis

Let $A$ and $B$ be finite subsets of $\mathbb{C}$ such that $|B|=C|A|$. We show the following variant of the sum product phenomenon: If $|AB|<\alpha|A|$ and $\alpha \ll \log |A|$, then $|kA+lB|\gg |A|^k|B|^l$. This is an application of a…

Combinatorics · Mathematics 2010-09-14 Karsten Chipeniuk

Let $A \subset \mathbb{R}$ be finite. We quantitatively improve the Balog-Wooley decomposition, that is $A$ can be partitioned into sets $B$ and $C$ such that $$\max\{E^+(B) , E^{\times}(C)\} \lesssim |A|^{3 - 7/26}, \ \ \max \{E^+(B,A) ,…

Number Theory · Mathematics 2019-10-23 George Shakan

Let $\mathbb{F}_p$ be a finite field of prime order $p$ and let $A \subset \mathbb{F}_p$ be a subset. In the dense regime when $|A| \geq \alpha p$ for some $\alpha \in (0,1)$, we determine the optimal constant $f(\alpha)$ in the inequality…

Number Theory · Mathematics 2026-04-21 Xuancheng Shao

We improve the best known sum-product estimates over the reals. We prove that \[ \max(|A+A|,|AA|)\geq |A|^{\frac{4}{3} + \frac{2}{1167} - o(1)}\,, \] for a finite $A\subset \mathbb R$, following a streamlining of the arguments of Solymosi,…

Number Theory · Mathematics 2021-09-03 Misha Rudnev , Sophie Stevens

We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…

Number Theory · Mathematics 2007-05-23 Constantin M. Petridi

Let $A\subset [1,x]$ be a non-empty set of primes with $|A|= \alpha x(\log x)^{-1}$. We prove that there exist absolute constants $c_1,c_2>0$ such that, as $x$ gets sufficiently large, we have $|A+A|\geq c_1(\log x)(\log \log…

Number Theory · Mathematics 2025-04-16 Genheng Zhao
‹ Prev 1 2 3 10 Next ›