On the number of subsequences with a given sum in a finite abelian group

preprint2011arXivOpen access

Abstract

Suppose GG is a finite abelian group and SS is a sequence of elements in GG. For any element gg of GG, let Ng(S)N_g(S) denote the number of subsequences of SS with sum gg. The purpose of this paper is to investigate the lower bound for Ng(S)N_g(S). In particular, we prove that either Ng(S)=0N_g(S)=0 or Ng(S)≥2∣S∣−D(G)+1N_g(S) \ge 2^{|S|-D(G)+1}, where D(G)D(G) is the smallest positive integer ℓ\ell such that every sequence over GG of length at least ℓ\ell has a nonempty zero-sum subsequence. We also characterize the structures of the extremal sequences for which the equality holds for some groups.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.