New Lower Bounds for Van der Waerden Numbers

2017/01/10 by Alexey V. Komkov, Komkov, Alexey V.
Computer Science · Engineering · Mathematics · #Benford’s Law and Fraud Detection #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1701.05603

openalex publication_date 2017/01/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 ).

Related

• Improved lower bounds for van der Waerden numbers
• A subexponential upper bound for van der Waerden numbers W(3,k)
• How to find the least upper bound on the van der Waerden Number W(r, k) that is some integer Power of the coloring Integer r
• A simple Proof that r^k² is an upper Bound on each van der Waerden Number W(r, k), for each k bounded below by a certain positive real Number ε
• New lower bounds for van der Waerden numbers