arXiv:1710.02782 [math.CO]AbstractReferencesReviewsResources
More properties of the Fibonacci word on an infinite alphabet
Amy Glen, Jamie Simpson, W. F. Smyth
Published 2017-10-08Version 1
Recently the Fibonacci word $W$ on an infinite alphabet was introduced by [Zhang et al., Electronic J. Combinatorics 24-2 (2017) #P2.52] as a fixed point of the morphism $\phi: (2i) \mapsto (2i)(2i+ 1),\ (2i+ 1) \mapsto (2i+ 2)$ over all $i \in \mathbb{N}$. In this paper we investigate the occurrence of squares, palindromes, and Lyndon factors in this infinite word.
Comments: 11 pages
Subjects: 68R15
Related articles: Most relevant | Search more
arXiv:1507.08206 [math.CO] (Published 2015-07-29)
Non-repetitive complexity of infinite words
arXiv:1301.5104 [math.CO] (Published 2013-01-22)
On a generalization of Abelian equivalence and complexity of infinite words
arXiv:1905.04746 [math.CO] (Published 2019-05-12)
Generalized Lyndon Factorizations of Infinite Words