Local obstructions in sequences revisited
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.