Davenport constant

In mathematics, the Davenport constant of a group determines how large a sequence of elements can be without containing a subsequence of elements which sum to zero. Its determination is an example of a zero-sum problem.

In general, a finite abelian group G is considered. The Davenport constant D(G) is the smallest integer d such that every sequence of elements of G of length d contains a non-empty subsequence with sum equal to the zero element of G.[1]

Examples

G = \oplus_i C_{p^{e_i}} \
then
D(G) = 1 + \sum_i \left({p^{e_i} - 1}\right) \ .

Properties

G = \oplus_i C_{d_i} \
with invariant factors d_1 | d_2 | \cdots | d_r, it is possible to find a sequence of \sum_i(d_i-1) elements without a zero sum subsequence, so
D(G) \ge M(G) = 1-r + \sum_i d_i \ .

References

  1. 1 2 Bhowmik & Schlage-Puchta (2007)

External links

This article is issued from Wikipedia - version of the Sunday, March 29, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.