Inverse problems for certain subsequence sums in integers
Jagannath Bhanja, Ram Krishna Pandey

TL;DR
This paper investigates the minimal size and structure of sum sets derived from subsets and subsequences of integers, extending recent finite field results to the integer group and generalizing to subsequence sums.
Contribution
It determines the minimal cardinality of subset and subsequence sum sets in integers and characterizes the structure of extremal sets, generalizing recent finite field findings.
Findings
Established the minimum size of subset sum sets in integers.
Characterized the structure of sets achieving minimal sum set size.
Extended results to subsequence sums and recovered known special cases.
Abstract
Let be a nonempty finite set of integers. Given a subset of , the sum of all elements of , denoted by , is called the subset sum of . For a nonnegative integer (), let \[\Sigma_{\alpha} (A):=\{s(B): B \subset A, |B|\geq \alpha\}.\] Now, let be a finite sequence of integers with distinct terms, where for . Given a subsequence of , the sum of all terms of , denoted by , is called the subsequence sum of . For , let \[\Sigma_{\alpha} (\bar{r},\mathcal{A}):=\left\{s(\mathcal{B}): \mathcal{B}~\text{is a subsequence…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
