Application of Hales-Jewett theorem near 0

2019/02/25 by Debnath, Pintu, Goswami, Sayan
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1902.09233

Abstract

The famous van der Waerden theorem states that if partition N into finitely many cells then one of them will contain arbitrary length arithmetic progressions. It has a polynomial version also. In this article we will prove the near 0 version of the polynomial van der Waerden theorem which was unsolved, using combinatorics.

Related

• On a Generalization of the van der Waerden Theorem
• Polymath's combinatorial proof of the density Hales-Jewett theorem
• On the infinitary van der Waerden Theorem
• Finite Sums of Arithmetic Progressions
• Restricted van der Waerden theorem for nilprogressions