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

弱Schur分拆的一个构造

A construction for weak Schur partitions

Fred Rowley

摘要:

在1952年,J.H.Braun声称已经建立了一个公式,给出了整数集合到弱无和类的某些划分的下界。然而,当时没有证据或支持性的建设。在今天的术语中,这一主张相当于给出了弱舒尔数$WS(s)$的公式化下界。$WS(s)$是使得存在从1到$WS(s)$的整数到$s$子集的弱Schur划分的最大数。在整数集合的弱Schur划分中,在任何子集中不能有三个不同的成员$a$、$b$和$c$,使得$a+b=c$。本文中描述的迭代构造的结果在一个类似的公式化的下界。虽然与Braun给出的结果不同,但它再现了由他的公式所暗示的结果$WS(6) \ge 554$,并且对于所有较大的$s$值都超过了它。可以使用各种起始点作为迭代的基础。这一结果本身已不再引人注目:它已被证明在其他地方,$WS(6) \ge 642$。即便如此,我们仍然希望这个公式及其基本构造可能会对那些对弱Schur划分和/或密切相关的线性Ramsey图感兴趣的人感兴趣。

英文摘要:

In 1952, J.H.Braun claimed to have established a formula giving a lower bound for certain partitions of sets of integers into weakly sum-free classes. However, no proof or supporting construction was published at that time. In today's terminology, that claim was equivalent to giving a formulaic lower bound for the weak Schur number $WS(s)$. $WS(s)$ is the maximum number such that there exists a weak Schur partition of the integers from 1 to $WS(s)$, into $s$ subsets. In a weak Schur partition of a set of integers, there can be no three distinct members $a$, $b$ and $c$ in any subset, such that $a+b=c$. An iterative construction described in this paper results in a similar formulaic lower bound. Although different from that given by Braun, it reproduces the result $WS(6) \ge 554$ implied by his formula, and exceeds it for all larger values of $s$. Various starting points can be used as a basis for the iterations. This result itself is no longer remarkable: it has been proven elsewhere that $WS(6) \ge 642$. Even so, it is hoped that the formula and its underlying construction may nevertheless be of interest to those interested in weak Schur partitions and/or the closely-related linear Ramsey graphs.

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

↑