Mathematics – Combinatorics
Scientific paper
2008-12-12
Mathematics
Combinatorics
Co-author added; new results
Scientific paper
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.
Au Yu-Hin
Robertson Aaron
Shallit Jeffrey
No associations
LandOfFree
Van der Waerden's Theorem and Avoidability in Words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Van der Waerden's Theorem and Avoidability in Words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Van der Waerden's Theorem and Avoidability in Words will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-193077