AbstractWe consider the subset sums analog of the linear Diophantine problem of Frobenius. It is shown that if A ⊑ [1;l] is a sufficiently dense set of n positive integers, then [2l − 2n + 1; σ − (2l − 2n + 1)] ⊑ A*, where σ is the sum of all elements of A, and A* is the set of all subset sums of A. The interval above is best possible and cannot be extended
AbstractWe define h(n) to be the largest function of n such that from any set of n nonzero integers,...
AbstractThe principal result is that if a question of Erdös about pairwise sums has a counterexample...
AbstractWe are interested in expressing each of a given set of non-negative integers as the sum of t...
AbstractWe consider the subset sums analog of the linear Diophantine problem of Frobenius. It is sho...
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...
AbstractTheorems from analytical number theory are used to derive new algorithms for the subset-sum ...
AbstractLetAbe a set of non-negative integers. In our previous paper forh∈Z,h⩾2 we estimated from be...
AbstractLet {a1,a2,a3,…} be an unbounded sequence of positive integers with an+1/an approaching α as...
AbstractLet n be a large integer and A be a subset of [n]={1,…,n}. The set SA is the collection of t...
Abstract. Sharpening (a particular case of) a result of Szemerédi and Vu [4] and extending earlier ...
AbstractA finite set of distinct integers is called an r-set if it contains at least r elements not ...
We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A...
AbstractWe show that for everyk⩾3 the number of subsets of {1, 2, …, n} containing no solution tox1+...
AbstractFor a given congruence condition, we try to find a subset-sum-distinct sequence such that th...
AbstractWe define h(n) to be the largest function of n such that from any set of n nonzero integers,...
AbstractThe principal result is that if a question of Erdös about pairwise sums has a counterexample...
AbstractWe are interested in expressing each of a given set of non-negative integers as the sum of t...
AbstractWe consider the subset sums analog of the linear Diophantine problem of Frobenius. It is sho...
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...
AbstractTheorems from analytical number theory are used to derive new algorithms for the subset-sum ...
AbstractLetAbe a set of non-negative integers. In our previous paper forh∈Z,h⩾2 we estimated from be...
AbstractLet {a1,a2,a3,…} be an unbounded sequence of positive integers with an+1/an approaching α as...
AbstractLet n be a large integer and A be a subset of [n]={1,…,n}. The set SA is the collection of t...
Abstract. Sharpening (a particular case of) a result of Szemerédi and Vu [4] and extending earlier ...
AbstractA finite set of distinct integers is called an r-set if it contains at least r elements not ...
We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A...
AbstractWe show that for everyk⩾3 the number of subsets of {1, 2, …, n} containing no solution tox1+...
AbstractFor a given congruence condition, we try to find a subset-sum-distinct sequence such that th...
AbstractWe define h(n) to be the largest function of n such that from any set of n nonzero integers,...
AbstractThe principal result is that if a question of Erdös about pairwise sums has a counterexample...
AbstractWe are interested in expressing each of a given set of non-negative integers as the sum of t...
DOI
Add to ORKG