Subsequence Sums of Zero-sum free Sequences II

2009/09/11 by Pingzhi Yuan, Yuan, Pingzhi
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Limits and Structures in Graph Theory #graph theory and CDMA systems #math.NT #msc:11B50 #msc:11B75

paper · pdf · doi:10.48550/arxiv.0909.2080

11pages

arxiv created 2009/09/14 · arxiv updated 2009/12/01

Abstract

Let G be a finite abelian group, and let S be a sequence over G. Let f(S) denote the number of elements in G which can be expressed as the sum over a nonempty subsequence of S. In this paper, we determine all the sequences S that contains no zero-sum subsequences and f(S)≤ 2|S|-1.

Related

• Zero-sum-free sequences with few subsequence sums
• On the number of subsequences with a given sum in a finite abelian group
• On the number of weighted subsequences with zero-sum in a finite abelian group
• A nonlinear bound for the number of subsequence sums
• On short zero-sum subsequences of zero-sum sequences