We study the structure of longest sequences in which have no zero-sum subsequence of length n (or less). We prove, among other results, that for and d arbitrary, or and d = 3, every sequence of c(n,d)(n-1) elements in which has no zero-sum subsequence of length n consists of c(n,d) distinct elements each appearing n-1 times, where and .
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-cm98-2-7,
author = {W. D. Gao and R. Thangadurai},
title = {On the structure of sequences with forbidden zero-sum subsequences},
journal = {Colloquium Mathematicae},
volume = {96},
year = {2003},
pages = {213-222},
zbl = {1057.11011},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-cm98-2-7}
}
W. D. Gao; R. Thangadurai. On the structure of sequences with forbidden zero-sum subsequences. Colloquium Mathematicae, Tome 96 (2003) pp. 213-222. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-cm98-2-7/