Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6424405 | European Journal of Combinatorics | 2011 | 9 Pages |
Abstract
Let 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Xiangneng Zeng, Pingzhi Yuan,