English

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

Combinatorics 2011-01-25 v1 Number Theory

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)2SD(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.

Keywords

Cite

@article{arxiv.1101.4492,
  title  = {On the number of subsequences with a given sum in a finite abelian group},
  author = {Gerard Jennhwa Chang and Sheng-Hua Chen and Yongke Qu and Guoqing Wang and Haiyan Zhang},
  journal= {arXiv preprint arXiv:1101.4492},
  year   = {2011}
}

Comments

9 pages