English

Inverse Zero-Sum Problems III

Number Theory 2008-01-25 v1 Combinatorics

Abstract

Let GG be a finite abeilian group. A sequence SS with terms from GG is zero-sum if the sum of terms in SS equals zero. It is a minimal zero-sum sequence if no proper, nontrivial subsequence is zero-sum. The maximal length of a minimal zero-sum subsequence in GG is the Davenport constant, denoted D(G)D(G). For a rank 2 group G=CnCnG=C_n \oplus C_n, it is known that D(G)=2n1D(G)=2n-1. However, the structure of all maximal length minimal zero-sum sequences remains open. If every such sequence contains a term with multiplicity n1n-1, then CnCnC_n \oplus C_n is said to have Property B, and it is conjectured that this is true for all rank 2 groups CnCnC_n \oplus C_n. In this paper, we show that Property B is multiplicative, namely, if G=CnCnG=C_n \oplus C_n and G=CmCmG=C_m \oplus C_m both satisfy Property B, with m,n3m, n\geq 3 odd and mn>9mn>9, then CmnCmnC_{mn}\oplus C_{mn} satisfies Property B also. Combined with previous work in the literature, this reduces the question of establishing Property B to the prime cases, and in such case the complete structural description of the sequence follows.

Keywords

Cite

@article{arxiv.0801.3792,
  title  = {Inverse Zero-Sum Problems III},
  author = {Weidong Gao and Alfred Geroldinger and David J. Grynkiewicz},
  journal= {arXiv preprint arXiv:0801.3792},
  year   = {2008}
}
R2 v1 2026-06-21T10:06:10.250Z