arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.01767math.NT
收藏

循环群中$(k,l)$ -无和集的最大长度

The Maximum Size of $(k,l)$-Sum-Free Sets in Cyclic Groups

Béla Bajnok, Ryan Matzke

摘要:

有限阿贝尔群群$G$的子集$A$称为$(k,l)$ -无和,如果$A$的$k$(不一定相异)元素之和不等于$A$的$l$(不一定相异)元素之和.我们找到了一个明确的公式的最大尺寸的一个$(k,l)$ -无和的子集在$G$的所有$k$和$l$的情况下,当$G$是循环的证明,它足以考虑$(k,l)$ -无和的间隔在分组的$G$。这简化和推广了Hamidoune和Plagne以及Bajnok的早期结果。

英文摘要:

A subset $A$ of a finite abelian group $G$ is called $(k,l)$-sum-free if the sum of $k$ (not-necessarily-distinct) elements of $A$ never equals the sum of $l$ (not-necessarily-distinct) elements of $A$. We find an explicit formula for the maximum size of a $(k,l)$-sum-free subset in $G$ for all $k$ and $l$ in the case when $G$ is cyclic by proving that it suffices to consider $(k,l)$-sum-free intervals in subgroups of $G$. This simplifies and extends earlier results by Hamidoune and Plagne and by Bajnok.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑