English
Related papers

Related papers: On sum sets of sets, having small product set

200 papers

A set of reals $A=\{a_1,...,a_n\}$ labeled in increasing order is called convex if there exists a continuous strictly convex function $f$ such that $f(i)=a_i$ for every $i$. Given a convex set $A$, we prove…

Combinatorics · Mathematics 2011-08-23 Liangpan Li

Let $\mathcal R$ be a finite valuation ring of order $q^r$ with $q$ a power of an odd prime number, and $\mathcal A$ be a set in $\mathcal R$. In this paper, we improve a recent result due to Yazici (2018) on a sum-product type problem.…

Number Theory · Mathematics 2020-05-13 Duc Hiep Pham

We estimate the sizes of the sumset A + A and the productset A $\cdot$ A in the special case that A = S (x, y), the set of positive integers n less than or equal to x, free of prime factors exceeding y.

Number Theory · Mathematics 2010-10-19 William D. Banks , David Covert

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…

Combinatorics · Mathematics 2020-10-06 Shengwen Gan , Alina Harbuzova

In this paper we prove new bounds for sums of convex or concave functions. Specifically, we prove that for all $A,B \subseteq \mathbb R$ finite sets, and for all $f,g$ convex or concave functions, we have $$|A + B|^{38}|f(A) + g(B)|^{38}…

Combinatorics · Mathematics 2021-02-11 Sophie Stevens , Audie Warren

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

Computational Geometry · Computer Science 2023-12-05 Friedrich Eisenbrand , Matthieu Haeberle , Neta Singer

Cameron and Erd\H{o}s asked whether the number of \emph{maximal} sum-free sets in $\{1, \dots , n\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\lfloor n/4 \rfloor }$ for the number of…

Combinatorics · Mathematics 2018-05-14 József Balogh , Hong Liu , Maryam Sharifzadeh , Andrew Treglown

Let $A \subset \mathbb R$ and $G \subset A \times A$. We prove that, for any $\lambda \in \mathbb R \setminus \{-1,0,1\}$, \[ \max \{|A+_G A|, |A+_G \lambda A|, |A\cdot_G A|\} \gg |G|^{6/11}. \]

Combinatorics · Mathematics 2020-10-06 Oliver Roche-Newton

We show that if a subset A of {1,...,N} does not contain any solutions to the equation x+y+z=3w with the variables not all equal, then A has size at most exp(-c(log N)^{1/7}) N, where c > 0 is some absolute constant. In view of Behrend's…

Combinatorics · Mathematics 2014-08-13 Tomasz Schoen , Olof Sisask

Let $\mathbb{F}_p$ be the field of residue classes modulo a prime number $p$ and let $A$ be a non-empty subset of $\mathbb{F}_p.$ In this paper we give an explicit version of the sum-product estimate of Bourgain, Katz, Tao and Bourgain,…

Number Theory · Mathematics 2007-05-23 M. Z. Garaev

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

Combinatorics · Mathematics 2024-02-21 Yifan Jing , Shukun Wu

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

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,…

Number Theory · Mathematics 2019-10-22 Kevin Ford

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…

Combinatorics · Mathematics 2021-10-01 Brandon Hanson , Oliver Roche-Newton , Steven Senger

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.…

Number Theory · Mathematics 2021-11-08 Peter J. Bradshaw

Ruzsa's inequality states that $|A+A+A| \leq |A+A|^{3/2}$ for any finite set $A$ in a commutative group. Ruzsa has constructed examples showing that this inequality is sharp asymptotically, up to a constant factor. We prove an inverse…

Combinatorics · Mathematics 2025-10-28 Swaroop Hegde

Let $A \subset \mathbb{F}_p$ of size at most $p^{3/5}$. We show $$|A+A| + |AA| \gtrsim |A|^{6/5 + c},$$ for $c = 4/305$. Our main tools are the cartesian product point--line incidence theorem of Stevens and de Zeeuw and the theory of higher…

Combinatorics · Mathematics 2018-06-20 G. Shakan , I. D. Shkredov

Let $\mathbb{F}_p$ be the field of residue classes modulo a prime number $p$ and let $A$ be a nonempty subset of $\mathbb{F}_p$. In this paper we show that if $|A|\preceq p^{0.5}$, then \[ \max\{|A\pm A|,|AA|\}\succeq|A|^{13/12};\] if…

Number Theory · Mathematics 2009-07-14 Liangpan Li

This is an expository survey on recent sum-product results in finite fields. We present a number of sum-product or "expander" results that say that if $|A| > p^{2/3}$ then some set determined by sums and product of elements of $A$ is nearly…

Combinatorics · Mathematics 2017-01-09 Brendan Murphy , Giorgis Petridis

In this paper we prove some results on sum-product estimates over arbitrary finite fields. More precisely, we show that for sufficiently small sets $A\subset \mathbb{F}_q$ we have \[|(A-A)^2+(A-A)^2|\gg |A|^{1+\frac{1}{21}}.\] This can be…

Number Theory · Mathematics 2018-07-17 Doowon Koh , Sujin Lee , Thang Pham , Chun-Yen Shen