On sequences without short zero-sum subsequences

ELECTRONIC JOURNAL OF COMBINATORICS(2023)

引用 0|浏览0
暂无评分
摘要
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 h(S), where 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 h(S). Under the assumption that |& sum;(S)|更多
查看译文
关键词
zero-sum problem,behaving sequence,height,subsum set
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要