Erdos离散猜想的SAT攻击
A SAT Attack on the Erdos Discrepancy Conjecture
摘要:
20世纪30年代PaulErdos证明了:对于任意正整数C,在任意+1 -1无穷序列(x_n)中,存在子序列x_d,x_{2d},.,x_{kd},对于一些正整数k和d,使得|x_d + x_{2d} +. + x_{kd}|> C.该猜想已被称为组合数论和差异理论中的主要开放问题之一。对于C=1的特殊情况,存在猜想的人类证明;对于C=2,定制的计算机程序生成了长度为1124的序列,其差异为2,但即使对于如此小的边界,猜想的状态仍然是开放的。我们表明,通过编码的问题到布尔可满足性和应用最先进的SAT求解器,可以得到一个序列的长度为1160与差异2和证明的Erdos差异猜想C=2,声称没有序列的长度为1161和差异2存在。我们还提出了我们的部分结果的情况下,C=3。
英文摘要:
In 1930s Paul Erdos conjectured that for any positive integer C in any infinite +1 -1 sequence (x_n) there exists a subsequence x_d, x_{2d}, ... , x_{kd} for some positive integers k and d, such that |x_d + x_{2d} + ... + x_{kd}|> 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 having 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 sequence of length 1160 with discrepancy 2 and a proof of the Erdos discrepancy conjecture for C=2, claiming that no sequence of length 1161 and discrepancy 2 exists. We also present our partial results for the case of C=3.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。