Improved Bound for the Gerver-Ramsey Collinearity Problem
Combinatorics
2023-04-11 v2 Formal Languages and Automata Theory
Abstract
Let be a finite subset of . A vector sequence is an -walk if and only if is an element of for all . Gerver and Ramsey showed in 1979 that for there exists an infinite -walk in which no points are collinear. Here, we use the same general approach, but with the aid of a computer search, to improve the bound to .
Cite
@article{arxiv.2303.14579,
title = {Improved Bound for the Gerver-Ramsey Collinearity Problem},
author = {Thomas F. Lidbetter},
journal= {arXiv preprint arXiv:2303.14579},
year = {2023}
}
Comments
22 pages, 4 figures