Avoiding short progressions in Euclidean Ramsey theory

We provide a general framework to construct colorings avoiding short monochromatic arithmetic progressions in Euclidean Ramsey theory. Specifically, if ${\ell }_m$ denotes m collinear points with consecutive points of distance one apart, we say that $E^n\nrightarrow ({\ell }_r,{\ell }_s)$ if there is a red/blue coloring of n-dimensional Euclidean space that avoids red congruent copies of ${\ell }_r$ and blue congruent copies of ${\ell }_s$. We show that $E^n\nrightarrow ({\ell }_3,{\ell }_{20})$, improving the best-known result $E^n\nrightarrow ({\ell }_3,{\ell }_{1177})$ by Führer and Tóth, and also establish $E^n\nrightarrow ({\ell }_4,{\ell }_{14})$ and $E^n\nrightarrow ({\ell }_5,{\ell }_8)$ in the spirit of the classical result $E^n\nrightarrow ({\ell }_6,{\ell }_6)$ due to Erdős et al. We also show a number of similar 3-coloring results, as well as $E^n\nrightarrow ({\ell }_3,\alpha {\ell }_{6889})$, where α is an arbitrary positive real number. This final result answers a question of Führer and Tóth in the positive.