AbstractLet G be a cyclic group of order n, and let S∈F(G) be a zero-sum sequence of length |S|≥2⌊n/2⌋+2. Suppose that S can be decomposed into a product of at most two minimal zero-sum sequences. Then there exists some g∈G such that S=(n1g)⋅(n2g)⋅⋯⋅(n|S|g), where ni∈[1,n] for all i∈[1,|S|] and n1+n2+⋯+n|S|=2n. And we also generalize the above result to long zero-sum sequences which can be decomposed into at most k≥3 minimal zero-sum sequences
AbstractA sequence in an additively written abelian group is called zero-freeif each of its nonempty...
AbstractA sequence in the additive group Zn of integers modulo n is called n-zero-free if it does no...
AbstractGiven a group G and a set S⊆G of generators, set S−1={s−1|s∈G} and S̃=S∪S−1. For g∈G, let l(...
AbstractLet G be a cyclic group of order n⩾2 and S=g1⋅⋯⋅gk a sequence over G. We say that S is a zer...
AbstractLet S be a sequence over an additively written abelian group. We denote by h(S) the maximum ...
AbstractLet G be a finite abelian group of order n and Davenport constant D(G). Let S=0h(S)∏g∈Ggvg(S...
AbstractTextLet G be a finite cyclic group. Every sequence S over G can be written in the form S=(n1...
AbstractLet p be a prime number and ℓ be any positive integer. Let G be the cyclic group of order pℓ...
We show that a zero-sum-free sequence of length $n$ over an abelian group spans at least $2n$ distin...
AbstractAn n-set partition of a sequence S is a collection of n nonempty subsequences of S, pairwise...
AbstractWe continue the discussion of the numbers c(G) and r(G) defined in [1]. The following result...
AbstractFor a sequence S of elements from an additive abelian group G, let f(S) denote the number of...
AbstractIn this paper we prove the following result. Let p be a prime, and k a positive integer. Let...
AbstractLet A⊂{1,…,n−1} and let (x1,…,xt)∈Zt be a sequence of integers with a maximal length such th...
AbstractLet Zn be the cyclic group of order n. For a sequence S of elements in Zn, we use fn(S) to d...
AbstractA sequence in an additively written abelian group is called zero-freeif each of its nonempty...
AbstractA sequence in the additive group Zn of integers modulo n is called n-zero-free if it does no...
AbstractGiven a group G and a set S⊆G of generators, set S−1={s−1|s∈G} and S̃=S∪S−1. For g∈G, let l(...
AbstractLet G be a cyclic group of order n⩾2 and S=g1⋅⋯⋅gk a sequence over G. We say that S is a zer...
AbstractLet S be a sequence over an additively written abelian group. We denote by h(S) the maximum ...
AbstractLet G be a finite abelian group of order n and Davenport constant D(G). Let S=0h(S)∏g∈Ggvg(S...
AbstractTextLet G be a finite cyclic group. Every sequence S over G can be written in the form S=(n1...
AbstractLet p be a prime number and ℓ be any positive integer. Let G be the cyclic group of order pℓ...
We show that a zero-sum-free sequence of length $n$ over an abelian group spans at least $2n$ distin...
AbstractAn n-set partition of a sequence S is a collection of n nonempty subsequences of S, pairwise...
AbstractWe continue the discussion of the numbers c(G) and r(G) defined in [1]. The following result...
AbstractFor a sequence S of elements from an additive abelian group G, let f(S) denote the number of...
AbstractIn this paper we prove the following result. Let p be a prime, and k a positive integer. Let...
AbstractLet A⊂{1,…,n−1} and let (x1,…,xt)∈Zt be a sequence of integers with a maximal length such th...
AbstractLet Zn be the cyclic group of order n. For a sequence S of elements in Zn, we use fn(S) to d...
AbstractA sequence in an additively written abelian group is called zero-freeif each of its nonempty...
AbstractA sequence in the additive group Zn of integers modulo n is called n-zero-free if it does no...
AbstractGiven a group G and a set S⊆G of generators, set S−1={s−1|s∈G} and S̃=S∪S−1. For g∈G, let l(...