Repetitions in Toeplitz words and the Thue threshold

DOI10.1007/978-3-030-51466-2_23MaRDI QIDQ2106611zbMATH OpenOpenAlexFDO

Authors A. Boccuto, Arturo Carpi

Publication date 16 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-51466-2_23

zbMATH Keywords

arithmetic subwordpartial wordpower-free wordThue thresholdToeplitz wordword with bounded square

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On avoding \(r\)-repetitions in \(\mathbb R^2\)
• Non-repetitive tilings
• Thue type problems for graphs, points, and numbers
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots

Cites work

• 0-1-sequences of Toeplitz type
• Arithmetic and analytic properties of paper folding sequences
• Canonical positions for the factors in paperfolding sequences
• Factors of generalized Rudin-Shapiro sequences
• How many squares can a string contain?
• scientific article; zbMATH DE number 3874638 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• Infinite 0-1 sequences without long adjacent identical blocks
• Multidimensional unrepetitive configurations
• Non-repetitive tilings
• On nonrepetitive sequences
• On the minimal alphabet size in multidimensional unrepetitive configurations
• Partial words and a theorem of Fine and Wilf
• Primitive partial words
• Sequences of linear arithmetical complexity
• The origins of combinatorics on words
• Thue type problems for graphs, points, and numbers
• Words avoiding repetitions in arithmetic progressions

Cited in

(1)

• Properties of a class of Toeplitz words

This page was built for publication: Repetitions in Toeplitz words and the Thue threshold

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