ID: math/0402285

The Erd\H{o}s-Szemer\'edi problem on sum set and product set

February 17, 2004

View on ArXiv

Similar papers 3

An improved bound on the sum-product estimate in $\mathbb{F}_{p}$

December 9, 2020

85% Match
Connor Paul Wilson
Combinatorics
Number Theory

We give an improved bound on the famed sum-product estimate in a field of residue class modulo $p$ ($\mathbb{F}_{p}$) by Erd\H{o}s and Szemeredi, and a non-empty set $A \subset \mathbb{F}_{p}$ such that: $$ \max \{|A+A|,|A A|\} \gg \min \left\{\frac{|A|^{15 / 14} \max \left\{1,|A|^{1 / 7} p^{-1 / 14}\right\}}{(\log |A|)^{2 / 7}}, \frac{|A|^{11 / 12} p^{1 / 12}}{(\log |A|)^{1 / 3}}\right\}, $$ and more importantly: $$\max \{|A+A|,|A A|\} \gg \frac{|A|^{15 / 14}}{(\log |A|)^{2 ...

Find SimilarView on arXiv

Inverse problems for sumset sizes of finite sets of integers

December 20, 2024

85% Match
Melvyn B. Nathanson
Number Theory

Let $A$ be a finite set of integers and let $hA$ be its $h$-fold sumset. This paper investigates the sequence of sumset sizes $( |hA| )_{h=1}^{\infty}$, the relations between these sequences for affinely inequivalent sets $A$ and $B$, and the comparative growth rates and configurations of the sumset size sequences $( |hA| )_{h=1}^{\infty}$ and $( |hA| )_{h=1}^{\infty}$.

Find SimilarView on arXiv

Extremal properties of product sets

March 27, 2018

85% Match
Kevin Ford
Number Theory

We find nearly the optimal size of a set $A\subset [N] := \{1,...,N\}$ so that the product set $AA$ satisfies either (i) $|AA| \sim |A|^2/2$ or (ii) $|AA| \sim |[N][N]|$. This settles problems raised in a recent article of Cilleruelo, Ramana and Ramare.

Find SimilarView on arXiv

The sum-product phenomenon in arbitrary rings

June 16, 2008

85% 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

On product of difference sets for sets of positive density

February 8, 2017

85% Match
Alexander Fish
Dynamical Systems
Combinatorics
Number Theory

In this paper we prove that given two sets $E_1,E_2 \subset \mathbb{Z}$ of positive density, there exists $k \geq 1$ which is bounded by a number depending only on the densities of $E_1$ and $E_2$ such that $k\mathbb{Z} \subset (E_1-E_1)\cdot(E_2-E_2)$. As a corollary of the main theorem we deduce that if $\alpha,\beta > 0$ then there exist $N_0$ and $d_0$ which depend only on $\alpha$ and $\beta$ such that for every $N \geq N_0$ and $E_1,E_2 \subset \mathbb{Z}_N$ with $|E_1|...

Find SimilarView on arXiv

Counting sets with small sumset and applications

May 14, 2013

85% Match
Ben Green, Robert Morris
Combinatorics
Number Theory

We study the number of $k$-element sets $A \subset \{1,\ldots,N\}$ with $|A + A| \leq K|A|$ for some (fixed) $K > 0$. Improving results of the first author and of Alon, Balogh, Samotij and the second author, we determine this number up to a factor of $2^{o(k)} N^{o(1)}$ for most $N$ and $k$. As a consequence of this and a further new result concerning the number of sets $A \subset \mathbf{Z}/N\mathbf{Z}$ with $|A +A| \leq c |A|^2$, we deduce that the random Cayley graph on $\...

Find SimilarView on arXiv

On the density of sumsets and product sets

February 7, 2019

85% Match
Norbert Hegyvári, François Hennecart, Péter Pál Pach
Number Theory
Combinatorics

In this paper some links between the density of a set of integers and the density of its sumset, product set and set of subset sums are presented.

Find SimilarView on arXiv

On a paper of Erd\"os and Szekeres

September 28, 2015

84% Match
Mei-Chu Chang, Jean Bourgain
Number Theory

Propositions 1.1 -- 1.3 stated below contribute to results and certain problems considered in a paper by Erdos and Szekeres, on the behavior of products $\prod^n_1 (1-z^{a_j}), 1\leq a_1\leq \cdots\leq a_n$ integers. In the discussion, $\{a_1, \ldots, a_n \}$ will be either a proportional subset of $\{1, \ldots, n\}$ or a set of large arithmetic diameter.

Find SimilarView on arXiv

Discretized sum-product for large sets

January 27, 2019

84% Match
Changhao Chen
Combinatorics
Classical Analysis and ODEs

Let $A\subset [1, 2]$ be a $(\delta, \sigma)$-set with measure $|A|=\delta^{1-\sigma}$ in the sense of Katz and Tao. For $\sigma\in (1/2, 1)$ we show that $$ |A+A|+|AA|\gtrapprox \delta^{-c}|A|, $$ for $c=\frac{(1-\sigma)(2\sigma-1)}{6\sigma+4}$. This improves the bound of Guth, Katz, and Zahl for large $\sigma$.

Find SimilarView on arXiv

Growth in Sumsets of Higher Convex Functions

November 5, 2021

84% Match
Peter J. Bradshaw
Number Theory
Combinatorics

The main results of this paper concern growth in sums of a $k$-convex function $f$. Firstly, we streamline the proof of a growth result for $f(A)$ where $A$ has small additive doubling, and improve the bound by removing logarithmic factors. The result yields an optimal bound for \[ |2^k f(A) - (2^k-1)f(A)|. \] We also generalise a recent result of Hanson, Roche-Newton and Senger, by proving that for any finite $A\subset \mathbb{R}$ \[ | 2^k f(sA-sA) - (2^k-1) f(sA-sA)| \g...

Find SimilarView on arXiv