Avoiding three consecutive blocks of the same size and same sum

DOI10.1145/2590775MaRDI QIDQ3189645zbMATH OpenOpenAlexFDO

Authors Julien Cassaigne, Luke Schaeffer, James D. Currie, Jeffrey Shallit

Publication date 12 September 2014

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1106.5204

zbMATH Keywords

pattern avoidancemorphismadditive cube

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: We show that there exists an infinite word over the alphabet {0, 1, 3, 4} containing no three consecutive blocks of the same size and the same sum. This answers an open problem of Pirillo and Varricchio from 1994.

Recommendations

• Van der Waerden's Theorem and Avoidability in Words
• Sequences on sets of four numbers
• Avoiding two consecutive blocks of same size and same sum over \(\mathbb{Z}^2\)
• Words without Near-Repetitions
• On the averages of factors of an infinite word on a finite set of integers

Cites work

• scientific article; zbMATH DE number 2186883 (Why is no real title available?)
• scientific article; zbMATH DE number 3624682 (Why is no real title available?)
• scientific article; zbMATH DE number 1498637 (Why is no real title available?)
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
• Abelian complexity of minimal subshifts
• Generalisation du theoreme de van der Waerden sur les semi-groupes repetitifs
• On two-sided infinite fixed points of morphisms
• On uniformly repetitive semigroups
• Strongly non-repetitive sequences and progression-free sets
• Thue type problems for graphs, points, and numbers
• Van der Waerden's Theorem and Avoidability in Words

Cited in

(20)

• Abelian combinatorics on words: a survey
• Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
• Fixed points avoiding abelian k-powers
• Templates for the \(k\)-binomial complexity of the Tribonacci word
• Finding certain arithmetic progressions in 2-coloured cyclic groups
• Arithmetic progressions in the graphs of slightly curved sequences
• On the additive complexity of a Thue-Morse-like sequence
• Avoiding or limiting regularities in words
• Avoiding two consecutive blocks of same size and same sum over \(\mathbb{Z}^2\)
• Sequences on sets of four numbers
• A Lebesgue Integral Variant of the Additive Square Problem
• On generalizing the van der Waerden theorem to some symmetric functions
• Avoiding abelian and additive powers in rich words
• On some generalizations of abelian power avoidability
• Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers
• Relations on words
• Additive word complexity and \texttt{Walnut}
• Words without Near-Repetitions
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
• Avoidability of Additive Cubes over Alphabets of Four Numbers

This page was built for publication: Avoiding three consecutive blocks of the same size and same sum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189645)