Van der Waerden's Theorem and Avoidability in Words
classification
🧮 math.CO
cs.FL
keywords
problemtheoremwaerdenarithmeticavoidabilityblocksconsecutiveconsider
read the original abstract
Pirillo and Varricchio, and independently, Halbeisen and Hungerbuhler considered the following problem, open since 1994: Does there exist an infinite word w over a finite subset of Z such that w contains no two consecutive blocks of the same length and sum? We consider some variations on this problem in the light of van der Waerden's theorem on arithmetic progressions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.