AbstractLet n be a large integer and A be a subset of [n]={1,…,n}. The set SA is the collection of the subset sums of A. In this note, we discuss new results (and proofs) on few well-known problems concerning SA. In particular, we improve an estimate of Alon and Erdős concerning monochromatic representations
AbstractA finite set of distinct integers is called an r-set if it contains at least r elements not ...
AbstractLet K be a positive integer. A partition {Ak,1⩽k⩽K} of the sequence of squares being given, ...
AbstractWe show that for everyk⩾3 the number of subsets of {1, 2, …, n} containing no solution tox1+...
AbstractLet n be a large integer and A be a subset of [n]={1,…,n}. The set SA is the collection of t...
AbstractAn analytical method is developed to prove that, for the integer set Aϵ[1,l], with l>;l0 and...
Given n different positive integers not greater than 2n-2, we prove that more than n^2/12 consecutiv...
AbstractIn this paper we determine the bounds of using two analytical algorithms for the subset-sum ...
AbstractA subset X of an abelian G is said to be complete if every element of G can be expressed as ...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
Cameron and Erdős [6] asked whether the number of maximal sum-free sets in { 1 , . . . , n } is much...
We prove that if A is a subset of at least cn1/2 elements of {1, . . . , n}, where c is a sufficient...
AbstractWe consider the subset sums analog of the linear Diophantine problem of Frobenius. It is sho...
AbstractTheorems from analytical number theory are used to derive new algorithms for the subset-sum ...
AbstractSuppose ε > 0 and k > 1. We show that if n > n0(k, ε) and A ⊆ Zn satisfies |A| > ((1k) + ε)n...
AbstractLet {a1,a2,a3,…} be an unbounded sequence of positive integers with an+1/an approaching α as...
AbstractA finite set of distinct integers is called an r-set if it contains at least r elements not ...
AbstractLet K be a positive integer. A partition {Ak,1⩽k⩽K} of the sequence of squares being given, ...
AbstractWe show that for everyk⩾3 the number of subsets of {1, 2, …, n} containing no solution tox1+...
AbstractLet n be a large integer and A be a subset of [n]={1,…,n}. The set SA is the collection of t...
AbstractAn analytical method is developed to prove that, for the integer set Aϵ[1,l], with l>;l0 and...
Given n different positive integers not greater than 2n-2, we prove that more than n^2/12 consecutiv...
AbstractIn this paper we determine the bounds of using two analytical algorithms for the subset-sum ...
AbstractA subset X of an abelian G is said to be complete if every element of G can be expressed as ...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
Cameron and Erdős [6] asked whether the number of maximal sum-free sets in { 1 , . . . , n } is much...
We prove that if A is a subset of at least cn1/2 elements of {1, . . . , n}, where c is a sufficient...
AbstractWe consider the subset sums analog of the linear Diophantine problem of Frobenius. It is sho...
AbstractTheorems from analytical number theory are used to derive new algorithms for the subset-sum ...
AbstractSuppose ε > 0 and k > 1. We show that if n > n0(k, ε) and A ⊆ Zn satisfies |A| > ((1k) + ε)n...
AbstractLet {a1,a2,a3,…} be an unbounded sequence of positive integers with an+1/an approaching α as...
AbstractA finite set of distinct integers is called an r-set if it contains at least r elements not ...
AbstractLet K be a positive integer. A partition {Ak,1⩽k⩽K} of the sequence of squares being given, ...
AbstractWe show that for everyk⩾3 the number of subsets of {1, 2, …, n} containing no solution tox1+...
DOI
Add to ORKG