Related papers: Visualizing the Sum-Product Conjecture

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…

For non-negative integers $a,b,$ and $n$, let $N(a, b; n)$ be the number of representations of $n$ as a sum of squares with coefficients $1$ or $3$ ($a$ of ones and $b$ of threes). Let $N^*(a,b; n)$ be the number of representations of $n$…

In this paper we further study the relationship between convexity and additive growth, building on the work of Schoen and Shkredov (\cite{SS}) to get some improvements to earlier results of Elekes, Nathanson and Ruzsa (\cite{ENR}). In…

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

Motivated by questions asked by Erdos, we prove that any set $A\subset{\mathbb N}$ with positive upper density contains, for any $k\in{\mathbb N}$, a sumset $B_1+\cdots+B_k$, where $B_1,\dots,B_k\subset{\mathbb N}$ are infinite. Our proof…

Following the sum-product paradigm, we prove that for a set $B$ with polynomial growth, the product set $B.B$ cannot contain large subsets with size of order $|B|^2$ with small doubling. It follows that the additive energy of $B.B$ is…

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…

Sampling methods that choose a subset of the data proportional to its diversity in the feature space are popular for data summarization. However, recent studies have noted the occurrence of bias (under- or over-representation of a certain…

For a set $A\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_A(n)$ denote the number of ordered pairs $(a,a')\in A\times A$ such that $a+a'=n$. The celebrated Erd\H{o}s-Tur\'an conjecture says that, if $R_A(n)\ge 1$ for all sufficiently…

Let $s(\cdot)$ denote the sum-of-proper-divisors function, that is, $s(n) = \sum_{d\mid n,~d<n}d$. Erd\H{o}s-Granville-Pomerance-Spiro conjectured that for any set $\mathcal{A}$ of asymptotic density zero, the preimage set…

We show that any $2$-coloring of $\mathbb{N}$ contains infinitely many monochromatic sets of the form $\{x,y,xy,x+y\},$ and more generally monochromatic sets of the form $\{x_i,\prod x_i,\sum x_i: i\leq k\}$ for any $k\in\mathbb{N}.$ Along…

It is known that the sum of the reciprocal of integers, $\sum_n (1/n)$, and the sum of the reciprocal of primes, $\sum_n (1/p_n)$, both diverge. Here, we study a series made from primes that sums exactly to 1. We also show this sum is…

Given a finite set $A\subseteq \mathbb{N}$, define the sum set $$A+A = \{a_i+a_j\mid a_i,a_j\in A\}$$ and the difference set $$A-A = \{a_i-a_j\mid a_i,a_j\in A\}.$$ The set $A$ is said to be sum-dominant if $|A+A|>|A-A|$. We prove the…

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

A finite set of integers $A$ is a sum-dominant (also called an More Sums Than Differences or MSTD) set if $|A+A| > |A-A|$. While almost all subsets of $\{0, \dots, n\}$ are not sum-dominant, interestingly a small positive percentage are. We…

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

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…

We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.

Since addition is commutative but subtraction is not, the sumset S+S of a finite set S is predisposed to be smaller than the difference set S-S. In this paper, however, we show that each of the three possibilities (|S+S|>|S-S|, |S+S|=|S-S|,…

For a fixed unit vector $a=(a_1,a_2,\ldots,a_n)\in S^{n-1}$, we consider the $2^n$ sign vectors $\varepsilon=(\varepsilon^1,\varepsilon^2,\ldots,\varepsilon^n)\in \{+1,-1\}^n$ and the corresponding scalar products $\varepsilon\cdot…