New Lower Bounds for Van der Waerden Numbers
Alexey V. Komkov
TL;DR
This paper presents new lower bounds for Van der Waerden numbers W(7,3), W(8,3), W(10,3), W(11,3), and W(17,3) using SAT solvers to find certificates that improve previous bounds.
Contribution
It introduces computational certificates obtained via SAT solvers to establish the best known lower bounds for specific Van der Waerden numbers.
Findings
Established new lower bounds for W(7,3), W(8,3), W(10,3), W(11,3), W(17,3)
Used SAT solvers to find certificates for these bounds
Provides computational evidence for improved bounds
Abstract
This work contains certificates numbers Van der Waerden, was found using SAT Solver. These certificates establish the best currently known lower bounds of the numbers Van der Waerden W( 7, 3 ), W( 8, 3 ), W( 10, 3 ), W( 11, 3 ), W( 17, 3 ).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · semigroups and automata theory · Benford’s Law and Fraud Detection