On the minimum size of subset and subsequence sums in integers
Let $\mathcal{A}$ be a sequence of $rk$ terms which is made up of $k$ distinct integers each appearing exactly $r$ times in $\mathcal{A}$. The sum of all terms of a subsequence of $\mathcal{A}$ is called a subsequence sum of $\mathcal{A}$. For a nonnegative integer $\alpha \le rk$, let $\Sigma _{\al...
Main Authors: | Bhanja, Jagannath, Pandey, Ram Krishna |
---|---|
Format: | Article |
Language: | English |
Published: |
Académie des sciences
2022-10-01
|
Series: | Comptes Rendus. Mathématique |
Online Access: | https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.5802/crmath.361/ |
Similar Items
-
An output-sensitive Algorithm to partition a Sequence of Integers into Subsets with equal Sums
by: Alexander Büchel, et al.
Published: (2019-01-01) -
Sums of squares of integers /
by: Moreno, Carlos J., 1946-, et al.
Published: (2006) -
Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
by: Aung, Khin Mi Mi, et al.
Published: (2020) -
On the sum of digits of some sequences of integers
by: Cilleruelo Javier, et al.
Published: (2013-01-01) -
Counting polynomial subset sums
by: Li, Jiyou, et al.
Published: (2021)