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
We consider the problem of determining the number of subsets B f1; 2; : : : ; ng such that P b2B b ...
Let f(n, r) denote the maximum number of colourings of A ⊆ {1, …, n} with r colours such that each c...
The subset sum problem over finite fields is a well-known NP-complete problem. It arises naturally f...
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...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
AbstractWe investigate a number of questions concerning representations of a set of numbers as sums ...
AbstractLetAbe a set of non-negative integers. In our previous paper forh∈Z,h⩾2 we estimated from be...
AbstractIn this paper, we investigate representations of sets of integers as subset sums of other se...
AbstractIn this paper we determine the bounds of using two analytical algorithms for the subset-sum ...
We prove that if A is a subset of at least cn1/2 elements of {1, . . . , n}, where c is a sufficient...
AbstractThe subset sum problem over finite fields is a well-known NP-complete problem. It arises nat...
Let G be the additive group of a finite field. J. Li and D. Wan determined the exact number of solut...
International audienceLet \({\mathcal{A}}\), \({\mathcal{B}}\) be large subsets of \({\{1,\ldots,N\}...
A set S of positive integers has distinct subset sums if the set x∈X x: X ⊂ S � has 2 |S | distinct ...
We consider the problem of determining the number of subsets B f1; 2; : : : ; ng such that P b2B b ...
Let f(n, r) denote the maximum number of colourings of A ⊆ {1, …, n} with r colours such that each c...
The subset sum problem over finite fields is a well-known NP-complete problem. It arises naturally f...
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...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
AbstractWe investigate a number of questions concerning representations of a set of numbers as sums ...
AbstractLetAbe a set of non-negative integers. In our previous paper forh∈Z,h⩾2 we estimated from be...
AbstractIn this paper, we investigate representations of sets of integers as subset sums of other se...
AbstractIn this paper we determine the bounds of using two analytical algorithms for the subset-sum ...
We prove that if A is a subset of at least cn1/2 elements of {1, . . . , n}, where c is a sufficient...
AbstractThe subset sum problem over finite fields is a well-known NP-complete problem. It arises nat...
Let G be the additive group of a finite field. J. Li and D. Wan determined the exact number of solut...
International audienceLet \({\mathcal{A}}\), \({\mathcal{B}}\) be large subsets of \({\{1,\ldots,N\}...
A set S of positive integers has distinct subset sums if the set x∈X x: X ⊂ S � has 2 |S | distinct ...
We consider the problem of determining the number of subsets B f1; 2; : : : ; ng such that P b2B b ...
Let f(n, r) denote the maximum number of colourings of A ⊆ {1, …, n} with r colours such that each c...
The subset sum problem over finite fields is a well-known NP-complete problem. It arises naturally f...
DOI
Add to ORKG