A SAT Attack on the Erdos Discrepancy Conjecture

  title={A SAT Attack on the Erdos Discrepancy Conjecture},
  author={Boris Konev and Alexei Lisitsa},
In 1930s Paul Erdős conjectured that for any positive integer C in any infinite ±1 sequence (xn) there exists a subsequence xd, x2d, x3d, . . . , xkd, for some positive integers k and d, such that | ∑ k i=1 xid |> 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… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 17 times. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 20 references

Erdős and arithmetic progressoins. In: Erdős Centennial conference

T. Gowers
View 1 Excerpt

Is massively collaborative mathematics possible? http://gowers.wordpress.com/2009/01/27/is-massively-collaborative-mathematics-possible/, accessed

T. Gowers
View 1 Excerpt

Erdős and arithmetic progressoins

T. Gowers

Glucose 2.3 in the SAT 2013 Competition

G. Audemard, L. Simon
Proceedings of SAT Competition • 2013
View 1 Excerpt

Similar Papers

Loading similar papers…