Related papers: The sum-product problem for small sets

Let $\mathcal{A}$ be a sequence of $rk$ terms which is made up of $k$ distinct integers each appearing exactly $r$ times in $\mathcal{A}$. The sum of all terms of a subsequence of $\mathcal{A}$ is called a subsequence sum of $\mathcal{A}$.…

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

For n=1,2,3,... define S(n) as the smallest integer m>1 such that those 2k(k-1) mod m for k=1,...,n are pairwise distinct; we show that S(n) is the least prime greater than 2n-2 and hence the value set of the function S(n) is exactly the…

We consider the SUBSET SUM problem and its important variants in this paper. In the SUBSET SUM problem, a (multi-)set $X$ of $n$ positive numbers and a target number $t$ are given, and the task is to find a subset of $X$ with the maximal…

We show that if $A$ is a subset of a group of prime order $p$ such that $|2A|<2.7652|A|$ and $|A|<1.25\cdot10^{-6}p$, then $A$ is contained in an arithmetic progression with at most $|2A|-|A|+1$ terms, and $2A$ contains an arithmetic…

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…

This paper explores the relationship between convexity and sum sets. In particular, we show that elementary number theoretical methods, principally the application of a squeezing principle, can be augmented with the Elekes-Szab\'{o} Theorem…

In this paper we study the Product Partition Problem (PPP), i.e. we are given a set of $n$ natural numbers represented on $m$ bits each and we are asked if a subset exists such that the product of the numbers in the subset equals the…

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

For integers $m$ and $n$, we study the problem of finding good lower bounds for the size of progression-free sets in $(\mathbb{Z}_{m}^{n},+)$. Let $r_{k}(\mathbb{Z}_{m}^{n})$ denote the maximal size of a subset of $\mathbb{Z}_{m}^{n}$…

For a finite set $A\subset \mathbb{R}$ and real $\lambda$, let $A+\lambda A:=\{a+\lambda b :\, a,b\in A\}$. Combining a structural theorem of Freiman on sets with small doubling constants together with a discrete analogue of…

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove…

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

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

We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…

We present an elementary proof that if $A$ is a finite set of numbers, and the sumset $A+_GA$ is small, $|A+_GA|\leq c|A|$, along a dense graph $G$, then $A$ contains $k$-term arithmetic progressions.

We show that if A is a large subset of a box in Z^d with dimensions L_1 >= L_2 >= ... >= L_d which are all reasonably large, then |A + A| > 2^{d/48}|A|. By combining this with Chang's quantitative version of Freiman's theorem, we prove a…

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…

Let $p$ be a prime greater than 3. In the paper we mainly determine $\sum_{k=0}^{[p/4]}\binom{4k}{2k}(-1)^k$, $\sum_{k=0}^{[p/3]}\binom{3k}k, \sum_{k=0}^{[p/3]}\binom{3k}k(-1)^k$ and $\sum_{k=0}^{[p/3]}\binom{3k}k(-3)^k$ modulo $p$, where…

Let A and B be two affinely generating sets of (Z_2)^n. As usual, we denote their Minkowski sum by A+B. How small can A+B be, given the cardinalities of A and B? We give a tight answer to this question. Our bound is attained when both A and…