Related papers: New sum-product estimates for real and complex num…

In this paper we study the factors of some alternating sums of products of binomial and q-binomial coefficients. We prove that for all positive integers n_1,...,n_m, n_{m+1}=n_1, and 0\leq j\leq m-1, {n_1+n_{m}\brack…

Given $d \in \mathbb{N}$, we establish sum-product estimates for finite, non-empty subsets of $\mathbb{R}^d$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, non-empty set of $d…

Let $d \geq 2$ be a natural number. We show that $$|A-A| \geq \left(2d-2 + \frac{1}{d-1}\right)|A|-(2d^2-4d+3)$$ for any sufficiently large finite subset $A$ of $\mathbb{R}^d$ that is not contained in a translate of a hyperplane. By a…

The $3k-4$ Theorem is a classical result which asserts that if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with \begin{equation}\label{hyp}|A+B|=|A|+|B|+r\leq |A|+|B|+\min\{|A|,\,|B|\}-3-\delta,\end{equation} where $\delta=1$ if…

In 1997 we proved that if $n$ is of the form $$ 4k, \quad 8k-1\quad {\rm or} \quad 2^{2m+1}(2k-1)+3, $$ where $k,m\in \mathbb N,$ then there are no positive rational numbers $x,y,z$ satisfying $$ xyz = 1, \quad x+y+z = n. $$ Recently, N. X.…

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…

We prove that the size of the product set of any finite arithmetic progression $\mathcal{A}\subset \mathbb{Z}$ satisfies \[|\mathcal A \cdot \mathcal A| \ge \frac{|\mathcal A|^2}{(\log |\mathcal A|)^{2\theta +o(1)} } ,\] where…

Suppose that A is a set of n real numbers, each at least 1 apart. Define the ``perturbed sum and product sets'' S and P to be the sums a + b + f(a,b) and products (a+g(a,b))(b+h(a,b)), where f, g, and h satisfy certain upper bounds in terms…

We represent the sums $\sum_{k=0}^{n-1}{n \choose k}^{-2}$, $\sum_{k=0}^m{m\choose k}^{-1}{a\choose n-k}^{-1}$, $\sum_{k=0}^{n-1}\frac{q^{-k(k-1)}}{{\genfrac{[}{]}{0pt}{}{n}{k}}_q}$, and the sum of the reciprocals of the summands in Dixon's…

We classify the polynomials $f(x,y) \in \mathbb R[x,y]$ such that given any finite set $A \subset \mathbb R$ if $|A+A|$ is small, then $|f(A,A)|$ is large. In particular, the following bound holds : $|A+A||f(A,A)| \gtrsim |A|^{5/2}.$ The…

We give a new proof of the discretized ring theorem for sets of real numbers. As a special case, we show that if $A\subset\mathbb{R}$ is a $(\delta,1/2)_1$-set in the sense of Katz and Tao, then either $A+A$ or $A.A$ must have measure at…

Let $n$ be a positive integer, and let $A$ be a set of $k\ge 2n-1$ integers. For the restricted sumset $$ S_n(A)=\{a_1+\cdots +a_n:\ a_1,\ldots,a_n\in A,\ \text{and}\ a_i^2\neq a_j^2\ \text{for} \ 1\le i<j\le n\}, $$ by a 2002 result of Liu…

A positive integer $n$ is said to be a practical number if every integer in $[1,n]$ can be represented as the sum of distinct divisors of $n$. In this article, we consider practical numbers of a given polynomial form. We give a necessary…

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…

In this paper, we evaluate some series of the form $$\sum_{k=1}^\infty\frac{ak^2+bk+c}{k(3k-1)(3k-2)m^k\binom{4k}k}.$$ For example, we prove that $$\sum_{k=1}^\infty\frac{(5k^2-4k+1)8^{k}}{k(3k-1)(3k-2)\binom{4k}k}=\frac{3}2\pi$$ and…

Let $A$ be a finite nonempty set of integers. An asymptotic estimate of several dilates sum size was obtained by Bukh. The unique known exact bound concerns the sum $|A+k\cdot A|,$ where $k$ is a prime and $|A|$ is large. In its full…

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.

Let $A$ be a nonempty finite set of $k$ integers. Given a subset $B$ of $A$, the sum of all elements of $B$, denoted by $s(B)$, is called the subset sum of $B$. For a nonnegative integer $\alpha$ ($\leq k$), let \[\Sigma_{\alpha}…

The lambda-dilate of a set A is lambda*A={lambda a : a \in A}. We give an asymptotically sharp lower bound on the size of sumsets of the form lambda_1*A+...+lambda_k*A for arbitrary integers lambda_1,...,lambda_k and integer sets A. We also…

We show that for any relatively prime integers $1\leq p<q$ and for any finite $A \subset \mathbb{Z}$ one has $$|p \cdot A + q \cdot A | \geq (p + q) |A| - (pq)^{(p+q-3)(p+q) + 1}.$$