Subsequence Sums of Zero-sum free Sequences II
Pingzhi Yuan

TL;DR
This paper characterizes zero-sum free sequences over finite abelian groups with a bounded number of representable sums, extending understanding of subsequence sum structures.
Contribution
It determines all zero-sum free sequences with a limited number of sum representations, advancing the classification of such sequences in finite abelian groups.
Findings
Identifies all sequences with no zero-sum subsequences and f(S) ≤ 2|S|-1.
Provides a complete characterization of these sequences.
Extends previous results on subsequence sums in abelian groups.
Abstract
Let be a finite abelian group, and let be a sequence over . Let denote the number of elements in which can be expressed as the sum over a nonempty subsequence of . In this paper, we determine all the sequences that contains no zero-sum subsequences and .
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.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Limits and Structures in Graph Theory
