Let be a sequence of terms which is made up of distinct integers each appearing exactly times in . The sum of all terms of a subsequence of is called a subsequence sum of . For a nonnegative integer , let be the set of all subsequence sums of that correspond to the subsequences of length or more. When , we call the subsequence sums as subset sums and we write for . In this article, using some simple combinatorial arguments, we establish optimal lower bounds for the size of and . As special cases, we also obtain some already known results in this study.
Revised:
Accepted:
Published online:
Jagannath Bhanja 1; Ram Krishna Pandey 2
@article{CRMATH_2022__360_G10_1099_0, author = {Jagannath Bhanja and Ram Krishna Pandey}, title = {On the minimum size of subset and subsequence sums in integers}, journal = {Comptes Rendus. Math\'ematique}, pages = {1099--1111}, publisher = {Acad\'emie des sciences, Paris}, volume = {360}, year = {2022}, doi = {10.5802/crmath.361}, language = {en}, }
TY - JOUR AU - Jagannath Bhanja AU - Ram Krishna Pandey TI - On the minimum size of subset and subsequence sums in integers JO - Comptes Rendus. Mathématique PY - 2022 SP - 1099 EP - 1111 VL - 360 PB - Académie des sciences, Paris DO - 10.5802/crmath.361 LA - en ID - CRMATH_2022__360_G10_1099_0 ER -
Jagannath Bhanja; Ram Krishna Pandey. On the minimum size of subset and subsequence sums in integers. Comptes Rendus. Mathématique, Volume 360 (2022), pp. 1099-1111. doi : 10.5802/crmath.361. https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.5802/crmath.361/
[1] An addition theorem and maximal zero-sum free sets in , Isr. J. Math., Volume 188 (2012), pp. 405-429 | DOI | MR | Zbl
[2] Addition theorems in via the polynomial method (2017) (https://arxiv.org/abs/1702.06419)
[3] Subset sums in abelian groups, Eur. J. Comb., Volume 34 (2013) no. 8, pp. 1269-1286 | DOI | MR | Zbl
[4] A note on sumsets and restricted sumsets, J. Integer Seq., Volume 24 (2021) no. 4, 21.4.2, 9 pages | MR | Zbl
[5] Inverse problems for certain subsequence sums in integers, Discrete Math., Volume 343 (2020) no. 12, 112148, 11 pages | MR | Zbl
[6] A generalization of Kneser’s addition theorem, Adv. Math., Volume 220 (2009) no. 5, pp. 1531-1548 | DOI | MR | Zbl
[7] A quadratic lower bound for subset sums, Acta Arith., Volume 129 (2007) no. 2, pp. 187-195 | DOI | MR | Zbl
[8] On the addition of residue classes mod , Acta Arith., Volume 9 (1964), pp. 149-159 | DOI | MR | Zbl
[9] The critical number of finite abelian groups, J. Number Theory, Volume 129 (2009) no. 11, pp. 2766-2777 | DOI | MR | Zbl
[10] Asymptotically tight bounds on subset sums, Acta Arith., Volume 138 (2009) no. 1, pp. 53-72 | DOI | MR | Zbl
[11] On a partition analog of the Cauchy–Davenport theorem, Acta Math. Hung., Volume 107 (2005) no. 1-2, pp. 167-181 | MR | Zbl
[12] Adding distinct congruence classes, Comb. Probab. Comput., Volume 7 (1998) no. 1, pp. 81-87 | DOI | MR | Zbl
[13] On complete subsets of the cyclic group, J. Comb. Theory, Ser. A, Volume 115 (2008) no. 7, pp. 1279-1285 | DOI | MR | Zbl
[14] On the cardinality of subsequence sums, Int. J. Number Theory, Volume 14 (2018) no. 3, pp. 661-668 | DOI | MR | Zbl
[15] A generalization of sumsets of set of integers, J. Number Theory, Volume 143 (2014), pp. 334-356 | DOI | MR | Zbl
[16] The direct and inverse theorems on integer subsequence sums revisited, Integers, Volume 6 (2016), #A32, 8 pages | MR | Zbl
[17] Subsequence sums: direct and inverse problems, J. Number Theory, Volume 148 (2015), pp. 235-256 | DOI | MR | Zbl
[18] Inverse theorems for subset sums, Trans. Am. Math. Soc., Volume 347 (1995) no. 4, pp. 1409-1418 | DOI | MR | Zbl
[19] Additive Number Theory. Inverse problems and the geometry of sumsets, Graduate Texts in Mathematics, 165, Springer, 1996 | DOI | Zbl
[20] An addition theorem modulo , J. Comb. Theory, Volume 5 (1968), pp. 45-52 | DOI | MR | Zbl
[21] On subset sums of zero-sum free sets of abelian groups, Int. J. Number Theory, Volume 15 (2019) no. 3, pp. 645-654 | DOI | MR | Zbl
Cited by Sources:
Comments - Policy