North-East Lattice Paths Avoiding Collinear Points via Satisfiability
arXiv:2511.23226 · doi:10.1016/j.aam.2026.103112
Abstract
We investigate the Gerver-Ramsey collinearity problem of determining the maximum number of points in a north-east lattice path without collinear points. Using a satisfiability solver, up to isomorphism we enumerate all north-east lattice paths avoiding collinear points for . We also find a north-east lattice path avoiding collinear points with 327 steps, improving on the previous best length of 260 steps found by Shallit.
To appear in Advances in Applied Mathematics