English
Related papers

Related papers: Variations on the Sum-Product Problem

200 papers

Given a subset of real numbers $A$ with small product $AA$ we obtain a new upper bound for the additive energy of $A$. The proof uses a natural observation that level sets of convolutions of the characteristic function of $A$ have small…

Combinatorics · Mathematics 2019-11-28 Konstantin I. Olmezov , Aliaksei S. Semchankau , Ilya D. Shkredov

Given a set of integers $A$ and an integer $k$, write $A+k\cdot A$ for the set $\{a+kb:a\in A,b\in A\}$. Hanson and Petridis showed that if $|A+A|\le K|A|$ then $|A+2\cdot A|\le K^{2.95}|A|$. At a presentation of this result, Petridis…

Combinatorics · Mathematics 2024-09-10 Jonathan Cutler , Luke Pebody , Amites Sarkar

We establish several sum-product estimates over finite fields that involve polynomials and rational functions. First, |f(A)+f(A)|+|AA| is substantially larger than |A| for an arbitrary polynomial f over F_p. Second, a characterization is…

Combinatorics · Mathematics 2014-02-26 Boris Bukh , Jacob Tsimerman

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

For $A\subseteq \mathbb{R}$, let $A+A=\{a+b: a,b\in A\}$ and $AA=\{ab: a,b\in A\}$. For $k\in \mathbb{N}$, let $SP(k)$ denote the minimum value of $\max\{|A+A|, |AA|\}$ over all $A\subseteq \mathbb{N}$ with $|A|=k$. Here we establish…

Combinatorics · Mathematics 2025-01-29 Ginny Ray Clevenger , Haley Havard , Patch Heard , Andrew Lott , Alex Rice , Brittany Wilson

Let $\F_q$ be a finite field of order $q$ and $P$ be a polynomial in $\F_q[x_1, x_2]$. For a set $A \subset \F_q$, define $P(A):=\{P(x_1, x_2) | x_i \in A \}$. Using certain constructions of expanders, we characterize all polynomials $P$…

Combinatorics · Mathematics 2007-05-23 Van Vu

Let $\{a_{1}, a_{2},\ldots, a_{n},\ldots\}$ be a sequence of complex numbers which has at most polynomial growth and satisfies an extra assumption. In this paper, inspired by a recent work of Sasane, we give an explanation of the sum…

Number Theory · Mathematics 2023-05-04 Su Hu , Min-Soo Kim

We show that if $\lambda_1,\ldots,\lambda_k$ are algebraic numbers, then $$|A+\lambda_1\cdot A+\dots+\lambda_k\cdot A|\geq H(\lambda_1,\ldots,\lambda_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where…

Combinatorics · Mathematics 2025-08-27 David Conlon , Jeck Lim

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 the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

Combinatorics · Mathematics 2008-06-23 Jozsef Solymosi

Utilising recent advances in incidence geometry for balls and tubes, and advances in sum-product theory in the discrete setting, we show that for $0 < s \leq 1/2$ and for any $A \subset \mathbb{R}$ with Hausdorff dimension $s$, either the…

Classical Analysis and ODEs · Mathematics 2026-04-27 Adam Cushman , William O'Regan

New lower bounds involving sum, difference, product, and ratio sets for a set $A\subset \C$ are given. The estimates involving the sum set match, up to constants, the one obtained by Solymosi for the reals and are obtained by generalising…

Combinatorics · Mathematics 2013-03-12 Sergei V. Konyagin , Misha Rudnev

Let $F$ be a field of characteristic $p>2$ and $A\subset F$ have sufficiently small cardinality in terms of $p$. We improve the state of the art of a variety of sum-product type inequalities. In particular, we prove that $$ |AA|^2|A+A|^3…

Combinatorics · Mathematics 2015-12-22 Esen Aksoy Yazici , Brendan Murphy , Misha Rudnev , Ilya Shkredov

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…

Combinatorics · Mathematics 2016-11-17 Antal Balog , Oliver Roche-Newton , Dmitry Zhelezov

Let $F$ be a field and a finite $A\subset F$ be sufficiently small in terms of the characteristic $p$ of $F$ if $p>0$. We strengthen the "threshold" sum-product inequality $$|AA|^3 |A\pm A|^2 \gg |A|^6\,,\;\;\;\;\mbox{hence} \;\;…

Combinatorics · Mathematics 2018-09-27 Misha Rudnev , George Shakan , Ilya Shkredov

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…

Combinatorics · Mathematics 2020-02-26 Changhao Chen

The aim of this note is to record a proof that the estimate $$\max{\{|A+A|,|A:A|\}}\gg{|A|^{12/11}}$$ holds for any set $A\subset{\mathbb{F}_q}$, provided that $A$ satisfies certain conditions which state that it is not too close to being a…

Combinatorics · Mathematics 2014-07-08 Oliver Roche-Newton

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…

Combinatorics · Mathematics 2020-12-16 Connor Paul Wilson

In the present paper we show that if A is a set of n real numbers, and the product set A.A has at most n^(1+c) elements, then the k-fold sumset kA has at least n^(log(k/2)/2 log 2 + 1/2 - f_k(c)) elements, where f_k(c) -> 0 as c -> 0. We…

Combinatorics · Mathematics 2009-04-15 Ernie Croot , Derrick Hart

Besides various asymptotic results on the concept of sum-product bases in $\mathbb{N}_0$, we consider by probabilistic arguments the existence of thin sets $A,A'$ of integers such that $AA+A=\mathbb{N}_0$ and $A'A'+A'A'=\mathbb{N}_0$.

Number Theory · Mathematics 2019-04-15 Francois Hennecart , Gyan Prakash , E. Pramod