Erdos离散性质的计算机辅助证明
Computer-Aided Proof of Erdos Discrepancy Properties
摘要:
20世纪30年代Paul Erdos证明了对任意正整数$C$,在任意无限$\pm 1$序列$(x_n)$中,存在一个子序列$x_d, x_{2d}, x_{3d},\dots, x_{kd}$,对某些正整数$k$和$d$,使得$\mid \sum_{i=1}^k x_{i\cdot d} \mid >C$.该猜想已被称为组合数论和差异理论中的主要开放问题之一。对于$C=1$的特殊情况,存在对该猜想的人类证明;对于$C=2$,定制的计算机程序生成了长度为$1124$的序列与$2$的差异,但该猜想的状态即使对于如此小的界限也仍然是开放的。我们表明,通过编码的问题到布尔可满足性和应用国家的最先进的SAT求解器,可以得到一个差异$2$序列的长度$1160$和证明的Erdibs差异猜想$C=2$,声称没有差异2序列的长度$1161$,或更多,存在。用类似的方法,我们得到了$127\,645$关于$3$的乘法序列和完全乘法序列的最大长度的精确界.我们还证明了不受限制的差异3序列可以比$130\,000$长。
英文摘要:
In 1930s Paul Erdos conjectured that for any positive integer $C$ in any infinite $\pm 1$ sequence $(x_n)$ there exists a subsequence $x_d, x_{2d}, x_{3d},\dots, x_{kd}$, for some positive integers $k$ and $d$, such that $\mid \sum_{i=1}^k x_{i\cdot d} \mid >C$. The conjecture has been referred to as one of the major open problems in combinatorial number theory and discrepancy theory. For the particular case of $C=1$ a human proof of the conjecture exists; for $C=2$ a bespoke computer program had generated sequences of length $1124$ of discrepancy $2$, but the status of the conjecture remained open even for such a small bound. We show that by encoding the problem into Boolean satisfiability and applying the state of the art SAT solvers, one can obtain a discrepancy $2$ sequence of length $1160$ and a proof of the Erdős discrepancy conjecture for $C=2$, claiming that no discrepancy 2 sequence of length $1161$, or more, exists. In the similar way, we obtain a precise bound of $127\,645$ on the maximal lengths of both multiplicative and completely multiplicative sequences of discrepancy $3$. We also demonstrate that unrestricted discrepancy 3 sequences can be longer than $130\,000$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。