An Upper Bound for the Hales--Jewett Number \mathrm{HJ}(4,2)

From MaRDI portal
Publication:3178437

DOI10.1137/15M1016485zbMATH Open1339.05418arXiv1504.02753OpenAlexW2460160336MaRDI QIDQ3178437FDOQ3178437

Mikhail Lavrov

Publication date: 13 July 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Abstract: We show that for n at least 1011, any 2-coloring of the n-dimensional grid [4]n contains a monochromatic combinatorial line. This is a special case of the Hales-Jewett Theorem, to which the best known general upper bound is due to Shelah; Shelah's recursion gives an upper bound between 2uparrowuparrow7 and 2uparrowuparrow8 for the case we consider, and no better value was previously known.


Full work available at URL: https://arxiv.org/abs/1504.02753




Recommendations




Cites Work


Cited In (3)





This page was built for publication: An Upper Bound for the Hales--Jewett Number $\mathrm{HJ}(4,2)$

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