Related papers: Infinite sumsets with many representations

Let $k \geq 2$ and $b \geq 3$ be integers, and suppose that $d_1, d_2 \in \{0,1,\dots, b - 1\}$ are distinct and coprime. Let $\mathcal{S}$ be the set of non-negative integers, all of whose digits in base $b$ are either $d_1$ or $d_2$. Then…

Let A be a set of integers. For every integer n, let r_{A,2}(n) denote the number of representations of n in the form n = a_1 + a_2, where a_1 and a_2 are in A and a_1 \leq a_2. The function r_{A,2}: Z \to N_0 \cup {\infty} is the…

Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…

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…

Assuming the Riemann Hypothesis we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Omega-term, we prove that our result is essentially the best…

Let $n$ be a positive integer. In this paper we estimate the size of the set of linear forms $b_1\log a_1 + b_2\log a_2+...+b_n\log a_n$, where $|b_i|\leq B_i$ and $1\leq a_i\leq A_i$ are integers, as $A_i,B_i\to \infty$.

We use recurrence equations (alias difference equations) to enumerate the number of formula-representations of positive integers using only addition and multiplication, and using addition, multiplication, and exponentiation, where all the…

Let $\mathcal{R}$ denote the set of integers $n$ that can be represented as the sum $n = x^2 + y^2$ with $(x,y) = 1$. Let $a$ and $b$ be integers with $a>0$, $a \nmid b$. We show that for sufficiently large positive integer $N$ there are…

Discrete sums of exponentials $g(w) = \sum a_{\beta} \mathrm{e}^{\beta w}$ with positive exponents may converge not normally in neighborhoods $H$ of $-\infty$ which do not contain half-planes. We study different notions of convergence for…

We show that if G is a finite group and A is a subset of G with no non-trivial solutions to xz=yy then |A| < |G|/(log log |G|)^c.

It is established that for any finite set of positive real numbers $A$, we have $$|A/A+A| \gg \frac{|A|^{\frac{3}{2}+\frac{1}{26}}}{\log^{1/2}|A|}.$$

In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found,…

Two representations of the Bessel zeta function are investigated. An incomplete representation is constructed using contour integration and an integral representation due to Hawkins is fully evaluated (analytically continued) to produce two…

Let $\BZ_p$ be the finite field of prime order $p$ and $A$ be a subset of $\BZ_p$. We prove several sharp results about the following two basic questions: (1) When can one represent zero as a sum of distinct elements of $A$ ? (2) When can…

In the paper we can prove that every integer can be written as the sum of two integers, one perfect square and one squarefree. We also establish the asympotic formula for the number of representations of an integer in this form. The result…

Let $hA$ denote the $h$-fold sumset of a subset $A$ of an abelian group. Resolving a problem of Nathanson, we show that for any prescribed permutations $\sigma_1, \ldots, \sigma_H \in \mathfrak{S}_n$, there exist finite subsets $A_1,…

For a set $A$ of nonnegative integers, let $R_2(A,n)$ and $R_3(A,n)$ denote the number of solutions to $n=a+a'$ with $a,a'\in A$, $a<a'$ and $a\leq a'$, respectively. In this paper, we prove that, if $A\subseteq \mathbb{N}$ and $N$ is a…

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 prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…