# On the minimum size of subset and subsequence sums in integers

@article{Bhanja2021OnTM,
title={On the minimum size of subset and subsequence sums in integers},
author={Jagannath Bhanja and Ram Krishna Pandey},
journal={Comptes Rendus. Math{\'e}matique},
year={2021}
}
• Published 16 August 2021
• Mathematics
• Comptes Rendus. Mathématique
Let A be a sequence of rk terms which is made up of k distinct integers each appearing exactly r times in A . The sum of all terms of a subsequence of A is called a subsequence sum of A . For a nonnegative integer α ≤ rk , let Σ α ( A ) be the set of all subsequence sums of A that correspond to the subsequences of length α or more. When r = 1, we call the subsequence sums as subset sums and we write Σ α ( A ) for Σ α ( A ). In this article, using some simple combinatorial arguments, we…

## References

SHOWING 1-10 OF 38 REFERENCES

Let A be a finite set of integers. For h > 1 , let S^ (A) denote the set of all sums of h distinct elements of A . Let S(A) denote the set of all nonempty sums of distinct elements of A . The direct
• Mathematics
Integers
• 2016
New proofs of existing direct and inverse theorems for S(r,A) are given using the direct and Reverse Theorems of Nathanson for S (A), the set of all nontrivial subsequence sums of the sequence A.
• Mathematics
• 2017
Let A = (a0,a1,…,ak−1)r = (a0,…,a0︸r0,a1,…,a1︸r1,…,ak−1,…,ak−1︸rk−1) be a finite sequence of integers, where a0 < a1 < ⋯ < ak−1 and r = (r0,r1,…,rk−1) with ri ≥ 1 for i = 0, 1,…,k − 1. A subsequence
• Mathematics
• 2007
Let A be a finite nonempty subset of an additive abelian group G, and let \Sigma(A) denote the set of all group elements representable as a sum of some subset of A. We prove that |\Sigma(A)| >= |H| +
For a subset A of a finite abelian group G we define Sigma(A)={sum_{a\in B}a:B\subset A}. In the case that Sigma(A) has trivial stabiliser, one may deduce that the size of Sigma(A) is at least