Local obstructions in sequences revisited
Combinatorics
2025-03-27 v1 Discrete Mathematics
Number Theory
Abstract
In this article, we consider some simple combinatorial game and a winning strategy in this game. This game is then used to prove several known results about non-repetitive sequences and approximations with denominators from a lacunary sequence. In this way we simplify the proofs, improve the bounds and get for free the computable versions that required a separate treatment.
Cite
@article{arxiv.2503.20529,
title = {Local obstructions in sequences revisited},
author = {Matthieu Rosenfeld and Alexander Shen},
journal= {arXiv preprint arXiv:2503.20529},
year = {2025}
}