PreprintCC BY 4.0arXiv
An infinite small-step ℤ3-walk with no collinear triple
Abstract
We construct an infinite walk in ℤ3 whose steps come from a fixed set of sixteen vectors and no three of whose vertices are collinear, answering a problem of Gerver and Ramsey popularized as Erdős Problem 193.
Related
- An infinite walk in ℕ16, using only unit steps, with no three collinear points
- Biased random walk on a locally infinite Galton-Watson tree
- Cramér-type moderate deviations and precise large deviations for the elephant random walk with random step sizes
- Normal approximation, moderate and large deviations for the elephant random walk with stops and random step sizes
- Amnesic Elephant Random Walk with Polynomially Decaying Step Sizes
BibTeX
@misc{cambie2026infinite,
title = {{An infinite small-step $\mathbb Z^3$-walk with no collinear triple}},
author = {Stijn Cambie and Erik Kalviainen},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.01766},
eprint = {2609.01766},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.01766},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - An infinite small-step ℤ^3-walk with no collinear triple
AU - Stijn Cambie
AU - Erik Kalviainen
PY - 2026
DA - 2026/09/01
PB - arXiv
DO - 10.48550/arxiv.2609.01766
UR - https://arxiv.org/abs/2609.01766
AB - We construct an infinite walk in ℤ^3 whose steps come from a fixed set of sixteen vectors and no three of whose vertices are collinear, answering a problem of Gerver and Ramsey popularized as Erdős Problem 193.
ER -