Some Recent Results on Squarefree Words
Jean Berstel (1985)
Publications du Département de mathématiques (Lyon)
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “There are more than -letter ternary square-free words.”
Some Recent Results on Squarefree Words
Square-free and overlap-free words
A. J. Kfoury (1988)
Banach Center Publications
Similarity:
The nucleus of the free alternative algebra.
Hentzel, I.R., Peresi, L.A. (2006)
Experimental Mathematics
Similarity:
Fixed-point free maps of Euclidean spaces
R. Z. Buzyakova, A. Chigogidze (2011)
Fundamenta Mathematicae
Similarity:
Our main result states that every fixed-point free continuous self-map of ℝⁿ is colorable. This result can be reformulated as follows: A continuous map f: ℝⁿ → ℝⁿ is fixed-point free iff f̃: βℝⁿ → βℝⁿ is fixed-point free. We also obtain a generalization of this fact and present some examples
Generalized sum-free subsets.
Caro, Yair (1990)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On the entropy and letter frequencies of ternary square-free words.
Richard, Christoph, Grimm, Uwe (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Extremal infinite overlap-free binary words.
Allouche, Jean-Paul, Currie, James, Shallit, Jeffrey (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Conditions on periodicity for sum-free sets.
Calkin, Neil J., Finch, Steven R. (1996)
Experimental Mathematics
Similarity:
Improved bounds on the number of ternary square-free words.
Grimm, Uwe (2001)
Journal of Integer Sequences [electronic only]
Similarity:
A generator of morphisms for infinite words
Pascal Ochem (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
We present an algorithm which produces, in some cases, infinite words avoiding both large fractional repetitions and a given set of finite words. We use this method to show that all the ternary patterns whose avoidability index was left open in Cassaigne's thesis are 2-avoidable. We also prove that there exist exponentially many -free ternary words and -free 4-ary words. Finally we give small morphisms for binary words containing only the squares , 1 and (01)² and for binary words...