Related papers: Representing Sequence Subsums as Sumsets of Near E…

The average properties of the well-known Subset Sum Problem can be studied by the means of its randomised version, where we are given a target value $z$, random variables $X_1, \ldots, X_n$, and an error parameter $\varepsilon > 0$, and we…

A subset $B$ of the ring $\mathbb{Z}_n$ is referred to as a $\ell$-covering set if $\{ ab \pmod n | 0\leq a \leq \ell, b\in B\} = \mathbb{Z}_n$. We show that there exists a $\ell$-covering set of $\mathbb{Z}_n$ of size $O(\frac{n}{\ell}\log…

In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…

We prove superpolynomial length lower bounds for the semantic tree-like Frege refutation system with bounded line size. Concretely, for any function $n^{2-\varepsilon} \leq s(n) \leq 2^{n^{1-\varepsilon}}$ we exhibit an explicit family…

Sums of the form $\sum_{N_m=q}^{n}{\cdots \sum_{N_1=q}^{N_2}{a_{(m);N_m}\cdots a_{(1);N_1}}}$ where the $a_{(k);N_k}$'s are same or distinct sequences appear quite often in mathematics. We will refer to them as recurrent sums. In this…

The article addresses the problem whether indefinite double sums involving a generic sequence can be simplified in terms of indefinite single sums. Depending on the structure of the double sum, the proposed summation machinery may provide…

Let $G$ be a finite abelian group with exponent $n$. Let $\eta(G)$ denote the smallest integer $\ell$ such that every sequence over $G$ of length at least $\ell$ has a zero-sum subsequence of length at most $n$. We determine the precise…

A finite set $ S \subset \mathbb{R} $ is called a Sidon set if all sums $ x+y $ with $ x,y \in S $ and $ x \le y $ are distinct, and a weak Sidon set if all sums $ x+y $ with $ x,y \in S $ and $ x < y $ are distinct. For a finite set $ A…

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…

For every integer $n\ge 1$ let $a_n$ be the smallest positive integer such that $n+a_n$ is prime. We investigate the behavior of the sequence $(a_n)_{n\ge 1}$, and prove asymptotic results for the sums $\sum_{n\le x} a_n$, $\sum_{n\le x}…

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

Let $G = (G,+)$ be a compact connected abelian group, and let $\mu_G$ denote its probability Haar measure. A theorem of Kneser (generalising previous results of Macbeath and Raikov) establishes the bound $$ \mu_G(A + B) \geq \min(…

The "Subset Sum problem" is a very well-known NP-complete problem. In this work, a top-k variation of the "Subset Sum problem" is considered. This problem has wide application in recommendation systems, where instead of k best objects the k…

Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a…

The following is shown : Let $S=\{a_1,a_2,..,a_{2n}\}$ be a subset of a totally ordered commutative semi-group $(G,*,\leq)$ with $a_1\leq a_2\leq...\leq a_{2n}$. Provided that a system of $n$ $a_{i_k} * a_{j_k}\ (a_{i_k}, a_{j_k} \in G ;\ 1…

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = A+A = \{a + b \ | \ a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. We prove that the number of sumsets in $\mathbb{F}_2^n$ is asymptotically…

Erd\H{o}s and Graham proposed to determine the number of subsets $S \subseteq \left\{1,2,\dots,n\right\}$ with $\sum_{s \in S} 1/s = 1$ and asked, among other things, whether that number could be as large as $2^{n - o(n)}$. We show that the…

For an interval [1,N] in the natural numbers, investigating subsets S of [1,N] such that |{(x,y) in S^2:x+y in S}|=0, known as sum-free sets, has attracted considerable attention. In this paper, we define r(S):=|{(x,y) in S^2: x+y in S}|…

Let G be a finitely generated free, free abelian of arbitrary exponent, free nilpotent, or free solvable group, or a free group in the variety A_mA_n, and let A = {a_1,..., a_r} be a basis for G. We prove that, in most cases, if S is a…

Let $G$ be a finite abelian group and $A$ a subset of $G$. The spectrum of $A$ is the set of its large Fourier coefficients. Known combinatorial results on the structure of spectrum, such as Chang's theorem, become trivial in the regime…