On long arithmetic progressions in binary Morse-like words
Ibai Aedo, Uwe Grimm, Yasushi Nagai, Petra Staynova

TL;DR
This paper investigates the presence of long arithmetic progressions within the Thue-Morse sequence and related words, using combinatorial methods inspired by van der Waerden's theorem.
Contribution
It extends the understanding of arithmetic progressions in binary Morse-like words, providing new results on their existence and structure.
Findings
Existence of long arithmetic progressions in Thue-Morse words
Generalization to a class of Morse-like words
Method inspired by van der Waerden's combinatorial proof
Abstract
We present results on the existence of long arithmetic progressions in the Thue-Morse word and in a class of generalised Thue-Morse words. Our arguments are inspired by van der Waerden's proof for the existence of arbitrary long monochromatic arithmetic progressions in any finite colouring of the (positive) integers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Computability, Logic, AI Algorithms · Mathematical Dynamics and Fractals
