## Coloring $\mathbb{Z}^k$ and a fixed point theorem

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

This is potentially another approach to this question. I put it as an update there, but perhaps it would be better to post it separately. If we color $\mathbb{Z}^k$ with the $\ell_\infty$ metric in fewer than $k+1$ colors, then there are always arbitrary long monochromatic paths. This follows from the classical results about the HEX game. It is known that this result is "equivalent" (both results can be easily deduced from each other) to the Brouwer fixed point theorem (see also a discussion here ). Now consider the $\mathbb{Z}^k$ with the $\ell_1$-metric and a similar question as before: can we color it in fewer than $k+1$ colors, so that there are no arbitrary long monochromatic $3$-paths (i.e. we are allowed to jump by 1 or by 2 or by 3 in the $\ell_1$-metric).

Question. Is this statement equivalent (in the above sense) to a fixed point theorem.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 9, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9559926986694336, "perplexity_flag": "head"}