Application of Hales-Jewett theorem near 0
Combinatorics
2020-05-11 v2
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.
Cite
@article{arxiv.1902.09233,
title = {Application of Hales-Jewett theorem near 0},
author = {Pintu Debnath and Sayan Goswami},
journal= {arXiv preprint arXiv:1902.09233},
year = {2020}
}
Comments
Semigroup Forum, to appear