On the Number of Subsequences with a Given Sum in a Finite Abelian Group


Suppose G is a finite abelian group and S is a sequence of elements in G. For any element g of G, let Ng(S) denote the number of subsequences of S with sum g. The purpose of this paper is to investigate the lower bound for Ng(S). In particular, we prove that either Ng(S) = 0 or Ng(S) ≥ 2 |S|−D(G)+1, where D(G) is the smallest positive integer l such that… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics