Square-free and overlap-free words
A. J. Kfoury (1988)
Banach Center Publications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
A. J. Kfoury (1988)
Banach Center Publications
Similarity:
Hentzel, I.R., Peresi, L.A. (2006)
Experimental Mathematics
Similarity:
Caro, Yair (1990)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Ekhad, Shalosh B., Zeilberger, Doron (1998)
Journal of Integer Sequences [electronic only]
Similarity:
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
Karl Dilcher, Lutz G. Lucht (2006)
Acta Arithmetica
Similarity:
Allouche, Jean-Paul, Currie, James, Shallit, Jeffrey (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Calkin, Neil J., Finch, Steven R. (1996)
Experimental Mathematics
Similarity:
Robert Cori, Maria Rosaria Formisano (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Tomasz Schoen (2001)
Acta Arithmetica
Similarity:
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...