Searcharxiv⌕ Search

arXiv subjects

Jarkko Peltomäki

Publications and source records attributed to Jarkko Peltomäki.

22 records · Page 2Linked to original sources

A square root map on Sturmian words

We introduce a square root map on Sturmian words and study its properties. Given a Sturmian word of slope $α$, there exists exactly six minimal squares in its language (a minimal square does not have a square as a proper prefix). A Sturmian word $s$ of slope $α$ can be written as a product of these six minimal squares: $s = X_1^2 X_2^2 X_3^2 \cdots$. The square root of $s$ is defined to be the word $\sqrt{s} = X_1 X_2 X_3 \cdots$. The main result of this paper is that that $\sqrt{s}$ is also a Sturmian word of slope $α$. Further, we characterize the Sturmian fixed points of the square root map, and we describe how to find the intercept of $\sqrt{s}$ and an occurrence of any prefix of $\sqrt{s}$ in $s$. Related to the square root map, we characterize the solutions of the word equation $X_1^2 X_2^2 \cdots X_n^2 = (X_1 X_2 \cdots X_n)^2$ in the language of Sturmian words of slope $α$ where the words $X_i^2$ are minimal squares of slope $α$. We also study the square root map in a more general setting. We explicitly construct an infinite set of non-Sturmian fixed points of the square root map. We show that the subshifts $Ω$ generated by these words have a curious property: for all $w \in Ω$ either $\sqrt{w} \in Ω$ or $\sqrt{w}$ is periodic. In particular, the square root map can map an aperiodic word to a periodic word.

cs.DM↗

Privileged Factors in the Thue-Morse Word - A Comparison of Privileged Words and Palindromes

In this paper we study the privileged complexity function of the Thue-Morse word. We prove a recursive formula describing this function, and using the formula we show that the function is unbounded and that the values of the function have arbitrarily large gaps of zeros. This demonstrates that the privileged complexity function of an infinite word can drastically differ from its palindromic complexity function, even though there are relations between these functions. Further we study the behavior of palindromes and privileged words in infinite words and the relation between rich words and privileged words.

math.CO↗

Characterization of repetitions in Sturmian words: A new proof

We present a new, dynamical way to study powers (that is, repetitions) in Sturmian words based on results from Diophantine approximation theory. As a result, we provide an alternative and shorter proof of a result by Damanik and Lenz characterizing powers in Sturmian words [Powers in Sturmian sequences, Eur. J. Combin. 24 (2003), 377--390]. Further, as a consequence, we obtain a previously known formula for the fractional index of a Sturmian word based on the continued fraction expansion of its slope.

cs.DM↗

Introducing Privileged Words: Privileged Complexity of Sturmian Words

In this paper we study the class of so-called privileged words which have been previously considered only a little. We develop the basic properties of privileged words, which turn out to share similar properties with palindromes. Privileged words are studied in relation to previously studied classes of words, rich words, Sturmian words and episturmian words. A new characterization of Sturmian words is given in terms of privileged complexity. The privileged complexity of the Thue-Morse word is also briefly studied.

math.CO↗