Brown-Gerver-Ramsey Theorems in Small Dimensions

Abstract: We consider infinite walks in $\mathbb{N}<sup>k$ with standard unit basis vector steps that avoid $t$ collinear points, and show that these walks exist for $(k,t) \in {(6,3), (4,4), (3,7)}$. In particular, our construction for $k = 3$ improves the previous bound $189$, obtained by Lidbetter, to $7$. Our results also imply the existence of infinite words over small finite alphabets that are weakly abelian squarefree (resp., weakly abelian cubefree, weakly abelian 6th-power-free).