Simultaneous avoidance of large squares and fractional powers in infinite binary words
Jeffrey Shallit
Abstract
In 1976, Dekking showed that there exists an infinite binary word that contains neither squares yy with y >= 4 nor cubes xxx. We show that `cube' can be replaced by any fractional power > 5/2. We also consider the analogous problem where `4' is replaced by any integer. This results in an interesting and subtle hierarchy.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.