New Lower Bounds for van der Waerden Numbers Using Distributed Computing

Author name not available (Why is that?)

Publication date: 8 March 2016

Abstract: This paper provides new lower bounds for van der Waerden numbers using Rabung's method, which colors based on the discrete logarithm modulo some prime. Through a distributed computing project with 500 volunteers over one year, we checked all primes up to 950 million, compared to 27 million in previous work. We point to evidence that the van der Waerden number for

r

colors and progression length

k

is roughly

r^{k}

.

Has companion code repository: https://github.com/hmonroe/vdw

This page was built for publication: New Lower Bounds for van der Waerden Numbers Using Distributed Computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6271335)