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

Abstract

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 such that every sequence over G of length at least has a nonempty zero-sum subsequence. We also characterize the structures of the extremal sequences for which the equality holds for some groups.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…