Related papers: Large sumsets from small subsets

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…

It is well known that if S is a subset of the integers mod p, and if the second-largest Fourier coefficient is ``small'' relative to the largest coefficient, then the sumset S+S is much larger than S. We show in the present paper that if…

Let p be a prime number. Let G be a finite abelian p-group of exponent n (written additively) and A be a non-empty subset of $]n[:= \{1,2,..., n\}$ such that elements of A are incongruent modulo p and non-zero modulo p. Let $k \geq…

The study of symmetric structures is a new trend in Ramsey theory. Recently in [7], Di Nasso initiated a systematic study of symmetrization of classical Ramsey theoretical results, and proved a symmetric version of several Ramsey theoretic…

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…

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…

We consider a generic system composed of a fixed number of particles distributed over a finite number of energy levels. We make only general assumptions about system's properties and the entropy. System's constraints other than fixed number…

Consider the p-system describing the subsonic flow of a fluid in a pipe with section a = a(x). We prove that the resulting Cauchy problem generates a Lipschitz semigroup, provided the total variation of the initial datum and the oscillation…

This paper provides new bounds on the size of spheres in any coordinate-additive metric with a particular focus on improving existing bounds in the sum-rank metric. We derive improved upper and lower bounds based on the entropy of a…

Given a group $G$, we say that a set $A \subseteq G$ has more sums than differences (MSTD) if $|A+A| > |A-A|$, has more differences than sums (MDTS) if $|A+A| < |A-A|$, or is sum-difference balanced if $|A+A| = |A-A|$. A problem of recent…

We consider the exceptional set in the binary Goldbach problem for sums of two almost twin primes. Our main result is a power-saving bound for the exceptional set in the problem of representing $m=p_1+p_2$ where $p_1+2$ has at most $2$…

The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…

We show that, for a finite set $A$ of real numbers, the size of the set $$\frac{A+A}{A+A} = \left\{ \frac{a+b}{c+d} : a,b,c,d \in A, c+d \neq 0 \right \}$$ is bounded from below by $$\left|\frac{A+A}{A+A} \right| \gg \frac{|A|^{2+1/4}}{|A /…

We obtain new bounds, pointwisely and on average, for Dedekind sums $\mathsf{s}(\lambda,p)$ modulo a prime $p$ with $\lambda$ of small multiplicative order $d$ modulo $p$. Assuming the infinitude of Mersenne primes, the range of our results…

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…

An equivalent definition of the Fibonacci numbers is that they are the unique sequence such that every integer can be written uniquely as a sum of non-adjacent terms. We can view this as we have bins of length 1, we can take at most one…

Suppose that $A$ is a finite, nonempty subset of a cyclic group of either infinite or prime order. We show that if the difference set $A-A$ is ``not too large'', then there is a nonzero group element with at least as many as…

For positive integers $n$, $m$, and $h$, we let $\rho \hat{\;}(\mathbb{Z}_n, m, h)$ denote the minimum size of the $h$-fold restricted sumset among all $m$-subsets of the cyclic group of order $n$. The value of $\rho \hat{\;}(\mathbb{Z}_n,…

Improving upon the results of Freiman and Candela-Serra-Spiegel, we show that for a non-empty subset $A\subseteq\mathbb F_p$ with $p$ prime and $|A|<0.0045p$, (i) if $|A+A|<2.59|A|-3$ and $|A|>100$, then $A$ is contained in an arithmetic…

A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…