Publications (21)1 Total impact
 [Show abstract] [Hide abstract]
ABSTRACT: Let A be a finite alphabet and f: A^* > A^* be a morphism with an iterative fixed point f^\omega(\alpha), where \alpha{} is in A. Consider the subshift (X, T), where X is the shift orbit closure of f^\omega(\alpha) and T: X > X is the shift map. Let S be a finite alphabet that is in bijective correspondence via a mapping c with the set of nonempty suffixes of the images f(a) for a in A. Let calS be a subset S^N be the set of infinite words s = (s_n)_{n\geq 0} such that \pi(s):= c(s_0)f(c(s_1)) f^2(c(s_2))... is in X. We show that if f is primitive and f(A) is a suffix code, then there exists a mapping H: calS > calS such that (calS, H) is a topological dynamical system and \pi: (calS, H) > (X, T) is a conjugacy; we call (calS, H) the suffix conjugate of (X, T). In the special case when f is the Fibonacci or the ThueMorse morphism, we show that the subshift (calS, T) is sofic, that is, the language of calS is regular.07/2013; 
Article: Extremal words in morphic subshifts
[Show abstract] [Hide abstract]
ABSTRACT: Given an infinite word X over an alphabet A a letter b occurring in X, and a total order \sigma on A, we call the smallest word with respect to \sigma starting with b in the shift orbit closure of X an extremal word of X. In this paper we consider the extremal words of morphic words. If X = g(f^{\omega}(a)) for some morphisms f and g, we give two simple conditions on f and g that guarantees that all extremal words are morphic. This happens, in particular, when X is a primitive morphic or a binary pure morphic word. Our techniques provide characterizations of the extremal words of the Perioddoubling word and the Chacon word and give a new proof of the form of the lexicographically least word in the shift orbit closure of the RudinShapiro word.Discrete Mathematics 01/2013; · 0.58 Impact Factor  [Show abstract] [Hide abstract]
ABSTRACT: We investigate questions related to the presence of primitive words and Lyndon words in automatic and linearly recurrent sequences. We show that the Lyndon factorization of a kautomatic sequence is itself kautomatic. We also show that the function counting the number of primitive factors (resp., Lyndon factors) of length n in a kautomatic sequence is kregular. Finally, we show that the number of Lyndon factors of a linearly recurrent sequence is bounded.07/2012; 
Article: Lyndon words and Fibonacci numbers
[Show abstract] [Hide abstract]
ABSTRACT: It is a fundamental property of nonletter Lyndon words that they can be expressed as a concatenation of two shorter Lyndon words. This leads to a naive lower bound log_{2}(n)} + 1 for the number of distinct Lyndon factors that a Lyndon word of length n must have, but this bound is not optimal. In this paper we show that a much more accurate lower bound is log_{phi}(n) + 1, where phi denotes the golden ratio (1 + sqrt{5})/2. We show that this bound is optimal in that it is attained by the Fibonacci Lyndon words. We then introduce a mapping L_x that counts the number of Lyndon factors of length at most n in an infinite word x. We show that a recurrent infinite word x is aperiodic if and only if L_x >= L_f, where f is the Fibonacci infinite word, with equality if and only if f is in the shift orbit closure of f.07/2012;  [Show abstract] [Hide abstract]
ABSTRACT: We introduce a new geometric approach to Sturmian words by means of a mapping that associates certain lines in the n x n grid and sets of finite Sturmian words of length n. Using this mapping, we give new proofs of the formulas enumerating the finite Sturmian words and the palindromic finite Sturmian words of a given length. We also give a new proof for the wellknown result that a factor of a Sturmian word has precisely two return words.Theoretical Computer Science. 01/2012; 432. 
Conference Paper: Local Squares, Periodicity and Finite Automata.
[Show abstract] [Hide abstract]
ABSTRACT: We consider the general problem when local regularity implies the global one in the setting where local regularity means the existence of a square of certain length in every position of an infinite word. The square can occur as centered or to the left or to the right from each position. In each case there are three variants of the problem depending on whether the square is that of words, that of abelian words or, as an in between case, that of so called kabelian words. The above nine variants of the problem are completely solved, and some open problems are addressed in the kabelian case. Finally, an amazing unavoidability result for 2abelian squares is obtained.Rainbow of Computer Science  Dedicated to Hermann Maurer on the Occasion of His 70th Birthday; 01/2011  [Show abstract] [Hide abstract]
ABSTRACT: The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waerden's theorem, they proved that if a word avoids Abelian kpowers for some integer k, then its Abelian complexity is unbounded. This suggests the following question: How frequently do Abelian kpowers occur in a word having bounded Abelian complexity? In particular, does every uniformly recurrent word having bounded Abelian complexity begin in an Abelian kpower? While this is true for various classes of uniformly recurrent words, including for example the class of all Sturmian words, in this paper we show the existence of uniformly recurrent binary words, having bounded Abelian complexity, which admit an infinite number of suffixes which do not begin in an Abelian square. We also show that the shift orbit closure of any infinite binary overlapfree word contains a word which avoids Abelian cubes in the beginning. We also consider the effect of morphisms on Abelian complexity and show that the morphic image of a word having bounded Abelian complexity has bounded Abelian complexity. Finally, we give an open problem on avoidability of Abelian squares in infinite binary words and show that it is equivalent to a wellknown open problem of PirilloVarricchio and HalbeisenHungerbühler.International Journal of Foundations of Computer Science 01/2011; 22(4):905920. · 0.42 Impact Factor 
Article: Standard factors of Sturmian words
http://dx.doi.org/10.1051/ita/2010011. 01/2010;  [Show abstract] [Hide abstract]
ABSTRACT: Local constraints on an infinite sequence that imply global regularity are of general interest in combinatorics on words. We consider this topic by studying everywhereαrepetitive sequences. Such a sequence is defined by the property that there exists an integer N≥2 such that every lengthN factor has a repetition of order α as a prefix. If each repetition is of order strictly larger than α, then the sequence is called everywhereα+repetitive. In both cases, the number of distinct minimal αrepetitions (or α+repetitions) occurring in the sequence is finite.A natural question regarding global regularity is to determine the least number, denoted by M(α), of distinct minimalαrepetitions such that an αrepetitive sequence is not necessarily ultimately periodic. We call the everywhere αrepetitive sequences witnessing this property optimal. In this paper, we study optimal 2repetitive sequences and optimal 2+repetitive sequences, and show that Sturmian words belong to both classes. We also give a characterization of 2repetitive sequences and solve the values of M(α) for 1≤α≤15/7.European Journal of Combinatorics  EJC. 01/2010; 31(1):177192.  [Show abstract] [Hide abstract]
ABSTRACT: In this paper we undertake the general study of the Abelian complexity of an infinite word on a finite alphabet. We investigate both similarities and differences between the Abelian complexity and the usual subword complexity. While the ThueMorse minimal subshift is neither characterized by its Abelian complexity nor by its subword complexity alone, we show that the subshift is completely characterized by the two complexity functions together. We give an affirmative answer to an old question of G. Rauzy by exhibiting a class of words whose Abelian complexity is everywhere equal to 3. We also investigate links between Abelian complexity and the existence of Abelian powers. Using van der Waerden's Theorem, we show that any minimal subshift having bounded Abelian complexity contains Abelian kpowers for every positive integer k. In the case of Sturmian words we prove something stronger: For every Sturmian word w and positive integer k, each sufficiently long factor of w begins in an Abelian kpower. Comment: 19 pages11/2009;  [Show abstract] [Hide abstract]
ABSTRACT: We say that two finite words $u$ and $v$ are abelian equivalent if and only if they have the same number of occurrences of each letter, or equivalently if they define the same Parikh vector. In this paper we investigate various abelian properties of words including abelian complexity, and abelian powers. We study the abelian complexity of the ThueMorse word and the Tribonacci word, and answer an old question of G. Rauzy by exhibiting a class of words whose abelian complexity is everywhere equal to 3. We also investigate abelian repetitions in words and show that any infinite word with bounded abelian complexity contains abelian $k$powers for every positive integer $k$.05/2009;  [Show abstract] [Hide abstract]
ABSTRACT: G. Rauzy showed that the Tribonacci minimal subshift generated by the morphism $\tau: 0\mapsto 01, 1\mapsto 02 and 2\mapsto 0$ is measuretheoretically conjugate to an exchange of three fractal domains on a compact set in $R^2$, each domain being translated by the same vector modulo a lattice. In this paper we study the Abelian complexity AC(n) of the Tribonacci word $t$ which is the unique fixed point of $\tau$. We show that $AC(n)\in {3,4,5,6,7}$ for each $n\geq 1$, and that each of these five values is assumed. Our proof relies on the fact that the Tribonacci word is 2balanced, i.e., for all factors $U$ and $V$ of $t$ of equal length, and for every letter $a \in {0,1,2}$, the number of occurrences of $a$ in $U$ and the number of occurrences of $a$ in $V$ differ by at most 2. While this result is announced in several papers, to the best of our knowledge no proof of this fact has ever been published. We offer two very different proofs of the 2balance property of $t$. The first uses the word combinatorial properties of the generating morphism, while the second exploits the spectral properties of the incidence matrix of $\tau$. Comment: 20 pages, 1 figure. This is an extended version of 0904.2872v104/2009; 
Article: On highly palindromic words
[Show abstract] [Hide abstract]
ABSTRACT: We study some properties of palindromic (scattered) subwords of binary words. In view of the classical problem on subwords, we show that the set of palindromic subwords of a word characterizes the word up to reversal.Since each word trivially contains a palindromic subword of length at least half of its length–a power of the prevalent letter–we call a word that does not contain any palindromic subword longer than half of its length minimal palindromic. We show that every minimal palindromic word is abelian unbordered, that is, no proper suffix of the word can be obtained by permuting the letters of a proper prefix.We also propose to measure the degree of palindromicity of a word w by the ratio rws/w, where the word rws is minimal palindromic and rs is as short as possible. We prove that the ratio is always bounded by four, and construct a sequence of words that achieves this bound asymptotically.Discrete Applied Mathematics. 01/2009;  [Show abstract] [Hide abstract]
ABSTRACT: We show that any positive integer is the least period of a factor of the ThueMorse word. We also characterize the set of least periods of factors of a Sturmian word. In particular, the corresponding set for the Fibonacci word is the set of Fibonacci numbers. As a byproduct of our results, we give several new proofs and tightenings of wellknown properties of Sturmian words.http://dx.doi.org/10.1051/ita:2008006. 01/2009;  [Show abstract] [Hide abstract]
ABSTRACT: We give three descriptions of the factors of a Sturmian word that are standard words. We also show that all Sturmian words are socalled everywhere abelian krepetitive for all integers k ≥ 1, that is, all sufficiently long factors have an abelian kth power as a prefix. More precisely, given a Sturmian word t and an integer k, there exist two integers 1 and 2 such that each position in t has an abelian kth power with abelian period 1 or 2 .08/2008; 
Article: Transposition invariant words.
[Show abstract] [Hide abstract]
ABSTRACT: We define an operation called transposition on words of fixed length. This operation arises naturally when the letters of a word are considered as entries of a matrix. Words that are invariant with respect to transposition are of special interest. It turns out that transposition invariant words have a simple interpretation by means of elementary group theory. This leads us to investigate some properties of the ring of integers modulo nn and primitive roots. In particular, we show that there are infinitely many prime numbers pp with a primitive root dividing p+1p+1 and infinitely many prime numbers pp without a primitive root dividing p+1p+1. We also consider the orbit of a word under transposition.Theor. Comput. Sci. 01/2007; 380:377387.  [Show abstract] [Hide abstract]
ABSTRACT: Local constraints on an infinite sequence that imply global regularity are of general interest in combinatorics on words. We consider this topic by studying everywhere α repetitive sequences, sequences in which every position has an occurrence of a repetition of order α ≥ 1 of bounded length. The number of minimal such repetitions, called minimal α powers, is then finite. A natural question regarding global regularity is to determine the least number of minimal αpowers such that an αrepetitive sequence is not necessarily ultimately periodic. We solve this question for 1 ≤ α ≤ 17/8. We also show that Sturmian words are among the optimal 2  and 2 + repetitive sequences.01/2007; 
Conference Paper: On the Frequency of Letters in Morphic Sequences.
[Show abstract] [Hide abstract]
ABSTRACT: A necessary and sufficient criterion for the existence and value of the frequency of a letter in a morphic sequence is given. This is done using a certain incidence matrix associated with the morphic sequence. The characterization gives rise to a simple ifandonlyif condition that all letter frequencies exist.Computer Science  Theory and Applications, First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 812, 2006, Proceedings; 01/2006  [Show abstract] [Hide abstract]
ABSTRACT: It is wellknown that the frequency of letters in primitive morphic sequences exists. We show that the frequency of letters exists in pure binary morphic sequences generated by nonprimitive morphisms. Therefore, the letter frequency exists in every pure binary morphic sequence. We also show that this is somewhat optimal, in the sense that the result does not hold in the class of general binary morphic sequences. Finally, we give an explicit formula for the frequency of letters.01/2005; 
Publication Stats
81  Citations  
1.00  Total Impact Points  
Top Journals
Institutions

2012–2013

The University of Winnipeg
 Department of Mathematics and Statistics
Winnipeg, Manitoba, Canada


2006–2012

University of Turku
 Department of Mathematics and Statistics
Turku, Western Finland, Finland


2005

Turku centre for biotechnology, finland
Turku, Province of Western Finland, Finland
