Mathematics – Combinatorics
Scientific paper
2011-04-13
Mathematics
Combinatorics
11 pages
Scientific paper
We prove that the generalized Thue-Morse word $\mathbf{t}_{b,m}$ defined for $b \geq 2$ and $m \geq 1$ as $\mathbf{t}_{b,m} = (s_b(n) \mod m)_{n=0}^{+\infty}$, where $s_b(n)$ denotes the sum of digits in the base-$b$ representation of the integer $n$, has its language closed under all elements of a group $D_m$ isomorphic to the dihedral group of order $2m$ consisting of morphisms and antimorphisms. Considering simultaneously antimorphisms $\Theta \in D_m$, we show that $\mathbf{t}_{b,m}$ is saturated by $\Theta$-palindromes up to the highest possible level. Using the terminology generalizing the notion of palindromic richness for more antimorphisms recently introduced by the author and E. Pelantov\'a, we show that $\mathbf{t}_{b,m}$ is $D_m$-rich. We also calculate the factor complexity of $\mathbf{t}_{b,m}$.
No associations
LandOfFree
Generalized Thue-Morse words and palindromic richness does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Generalized Thue-Morse words and palindromic richness, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized Thue-Morse words and palindromic richness will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-218725