Inverse zero-sum problems III

@article{Gao2008InverseZP,
  title={Inverse zero-sum problems III},
  author={Weidong Gao and Alfred Geroldinger and David J. Grynkiewicz},
  journal={Acta Arithmetica},
  year={2008},
  volume={141},
  pages={103-152}
}
Let G be a nite abelian group. The Davenport constant D(G) is the smallest integer ` 2 N such that every sequence S over G of length jSj ` has a nontrivial zero-sum subsequence. Let G = Cn Cn with n 2. Then D(G) = 2n 1, and we say that G has Property B if every minimal zero-sum sequence S over G of length jSj = 2n 1 contains an element with multiplicity n 1. We show that, if m and n are odd and both Cm Cm and Cn Cn have Property B, then Cmn Cmn has Property B. Based on this and various recent… 

Tables from this paper

The structure of maximal zero-sum free sequences

Let n be an integer, and consider finite sequences of elements of the group Z/nZ x Z/nZ. Such a sequence is called zero-sum free, if no subsequence has sum zero. It is known that the maximal length

A multiplicative property for zero-sums I

Inverse zero-sum problems II

Let $G$ be an additive finite abelian group. A sequence over $G$ is called a minimal zero-sum sequence if the sum of its terms is zero and no proper subsequence has this property. Davenport's

Long Zero-Sum Free Sequences over Cyclic Groups

TLDR
The goal of this chapter is characterize the structure of those zero-sum free sequences close to the extremal possible length, and will be able to characterize this structure for sequences quite a ways away from the maximal value.

Zero-sum subsequences of distinct lengths

Let G be an additive finite abelian group, and let disc(G) denote the smallest positive integer t such that every sequence S over G of length ∣S∣ ≥ t has two nonempty zero-sum subsequences of

The Inverse Problem Associated to the Davenport Constant for C2+C2+C2n, and Applications to the Arithmetical Characterization of Class Groups

TLDR
A characterization, via the system of sets of lengths, of the class group of rings of algebraic integers is obtained for certain types of groups, and the Davenport constants of groups of the form C 4 ⊕ C4n and C 6 ⊵ C6n are determined.

Inverse problems associated with subsequence sums in Cp ⊕ Cp

Let G be a finite abelian group and S be a sequence with elements of G. We say that S is a regular sequence over G if ∣SH∣ ⩽ ∣H∣ − 1 holds for every proper subgroup H of G, where SH denotes the

References

SHOWING 1-10 OF 52 REFERENCES

The structure of maximal zero-sum free sequences

Let n be an integer, and consider finite sequences of elements of the group Z/nZ x Z/nZ. Such a sequence is called zero-sum free, if no subsequence has sum zero. It is known that the maximal length

On short zero-sum subsequences. II.

On short zero-sum subsequences over p-groups

TLDR
For p-groups whose exponent is odd and sufficiently large (relative to Davenport’s constant of the group), an improved upper bound on s(G) is obtained, which allows to determine s( G) precisely in special cases.

Minimal zero-sum sequences in Cn+Cn

On some developments of the Erdős–Ginzburg–Ziv Theorem II

Let S be a sequence of elements from the cyclic group Zm. We say S is zsf (zero-sum free) if there does not exist an m-term subsequence of S whose sum is zero. Denote by g(m, k) the least integer

Inverse zero-sum problems

Let G be an additive finite abelian group with exponent exp(G) = n. We define some central invariants in zero-sum theory: Let • D(G) denote the smallest integer l ∈ N such that every sequence S over

Zero-sum problems in finite abelian groups and affine caps

For a finite abelian group G, let (G) denote the smallest integer l such that every sequence S over G of length | S| l has a zero-sum subsequence of length exp (G). We derive new upper and lower

A Combinatorial Problem on Finite Abelian Groups

Abstract In this paper the following theorem is proved. Let G be a finite Abelian group of order n . Then, n + D ( G )−1 is the least integer m with the property that for any sequence of m elements a
...