December 3, 2007
Similar papers 4
September 7, 2020
For a set $A$ of non-negative integers, let $R_A(n)$ denote the number of solutions to the equation $n=a+a'$ with $a$, $a'\in A$. Denote by $\chi_A(n)$ the characteristic function of $A$. Let $b_n>0$ be a sequence satisfying $\limsup_{n\to \infty}b_n<1$. In this paper, we prove some Erd\H os--Fuchs-type theorems about the error terms appearing in approximation formul\ae\ for $R_A(n)=\sum_{k=0}^n\chi_A(k)\chi_A(n-k)$ and $\sum_{n=0}^NR_A(n)$ having principal terms $\sum_{k=0}^...
March 17, 2023
Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. For a $k$-tuple of positive integers $\underline{\lambda} = (\lambda_{1}, \dots{} ,\lambda_{k})$ with $1 \le \lambda_{1} < \lambda_{2} < \dots{} < \lambda_{k}$, we define the additive representation function $R_{A,\underline{\lambda}}(n) = |\{(a_{1}, \dots{} ,a_{k})\in A^{k}: \lambda_{1}a_{1} + \dots{} + \lambda_{k}a_{k} = n\}|$. For $k = 2$, Moser constructed a set $A$ of nonnegative integers such that ...
December 9, 2015
For a positive integer $h$ and a subset $A$ of a given finite abelian group, we let $hA$, $h \hat{\;} A$, and $h_{\pm}A$ denote the $h$-fold sumset, restricted sumset, and signed sumset of $A$, respectively. Here we review some of what is known and not yet known about the minimum sizes of these three types of sumsets, as well as their corresponding critical numbers. In particular, we discuss several new open direct and inverse problems.
June 28, 2023
For any given set $A$ of nonnegative integers and for any given two positive integers $k_1,k_2$, $R_{k_1,k_2}(A,n)$ is defined as the number of solutions of the equation $n=k_1a_1+k_2a_2$ with $a_1,a_2\in A$. In this paper, we prove that if integer $k\geq2$ and set $A\subseteq\mathbb{N}$ such that $R_{1,k}(A,n)=R_{1,k}(\mathbb{N}\setminus A,n)$ holds for all integers $n\geq n_0$, then $R_{1,k}(A,n)\gg \log n$.
June 18, 2012
We provide a survey of results concerning both the direct and inverse problems to the Cauchy-Davenport theorem and Erdos-Heilbronn problem in Additive Combinatorics. We prove a slight extension to an inverse theorem of Dias da Silva-Hamidoune in Z/pZ, and we present a counterexample to an open conjecture concerning the inverse Erdos-Heilbronn problem in nonabelian groups.
August 21, 2007
Let A be a set of integers and let h \geq 2. For every integer n, let r_{A, h}(n) denote the number of representations of n in the form n=a_1+...+a_h, where a_1,...,a_h belong to the set A, and a_1\leq ... \leq a_h. The function r_{A,h} from the integers Z to the nonnegative integers N_0 U {\infty} is called the representation function of order h for the set A. We prove that every function f from Z to N_0 U {\infty} satisfying liminf_{|n|->\infty} f (n)\geq g is the represent...
February 13, 2003
Let A be a set of nonnegative integers. For every nonnegative integer n and positive integer h, let r_{A}(n,h) denote the number of representations of n in the form n = a_1 + a_2 + ... + a_h, where a_1, a_2,..., a_h are elements of A and a_1 \leq a_2 \leq ... \leq a_h. The infinite set A is called a basis of order h if r_{A}(n,h) \geq 1 for every nonnegative integer n. Erdos and Turan conjectured that limsup_{n\to\infty} r_A(n,2) = \infty for every basis A of order 2. This pa...
October 25, 2010
In this paper, we study a combinatorial problem originating in the following conjecture of Erdos and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n. This conjecture was proved by Kleitman and Lemke, who then extended the original question to a problem on a zero-sum invariant in the framework of finite Abelian groups. Building among others on earlier works by Alon and Dubiner and by the...
March 24, 2022
Given $h,g \in \mathbb{N}$, we write a set $X \subseteq \mathbb{Z}$ to be a $B_{h}^{+}[g]$ set if for any $n \in \mathbb{R}$, the number of solutions to the additive equation $n = x_1 + \dots + x_h$ with $x_1, \dots, x_h \in X$ is at most $g$, where we consider two such solutions to be the same if they differ only in the ordering of the summands. We define a multiplicative $B_{h}^{\times}[g]$ set analogously. In this paper, we prove, amongst other results, that there exists s...
August 31, 2019
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} (A):=\{s(B): B \subset A, |B|\geq \alpha\}.\] Now, let $\mathcal{A}=(\underbrace{a_{1},\ldots,a_{1}}_{r_{1}~\text{copies}}, \underbrace{a_{2},\ldots,a_{2}}_{r_{2}~\text{copies}},\ldots, \underbrace{a_{k},\ldots,a_{k}}_{r_{k}~\text{copies}})$ be a fin...