New lower bounds for van der Waerden numbers using distributed computing
From MaRDI portal
Cites work
- A Construction for Partitions Which Avoid Long Arithmetic Progressions
- A generalization of sets without long arithmetic progressions based on Szekeres algorithm
- A new lower bound for van der Waerden numbers
- A new method to construct lower bounds for van der Waerden numbers
- A new proof of Szemerédi's theorem
- Avoiding triples in arithmetic progression
- Beweis einer Baudetschen Vermutung.
- Computer-Generated van der Waerden Partitions
- Computing the van der Waerden number W(3,4)=293
- scientific article; zbMATH DE number 6378629 (Why is no real title available?)
- scientific article; zbMATH DE number 5014484 (Why is no real title available?)
- scientific article; zbMATH DE number 3385632 (Why is no real title available?)
- Improving the use of cyclic zippers in finding lower bounds for van der Waerden numbers
- Lower bounds on some Van der Waerden numbers based on quadratic residues
- New bounds for Szemerédi's theorem. III: A polylogarithmic bound for \(r_{4}(n)\)
- On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number
- Primitive Recursive Bounds for Van Der Waerden Numbers
- Some new van der Waerden numbers
- Some Progression-Free Partitions Constructed using Folkman's Method
- The van der Waerden NumberW(2, 6) Is 1132
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 Q6858616)
