
doi: 10.37236/11963
Let $G$ be a finite abelian group. It is well known that every sequence $S$ over $G$ of length at least $|G|$ contains a zero-sum subsequence of length at most $\mathsf{h}(S)$, where $\mathsf{h}(S)$ is the maximal multiplicity of elements occurring in $S$. It is interesting to study the corresponding inverse problem, that is to find information on the structure of the sequence $S$ which does not contain zero-sum subsequences of length at most $\mathsf{h}(S)$. Under the assumption that $|\sum(S)|< \min\{|G|,2|S|-1\}$, Gao, Peng and Wang showed that such a sequence $S$ must be strictly behaving. In the present paper, we explicitly give the structure of such a sequence $S$ under the assumption that $|\sum(S)|=2|S|-1<|G|$.
Inverse problems of additive number theory, including sumsets, Other combinatorial number theory, zero-sum sequence, zero-sum theory
Inverse problems of additive number theory, including sumsets, Other combinatorial number theory, zero-sum sequence, zero-sum theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
