2017/10/08 by Amy Glen, Glen, Amy, Jamie Simpson +3
Computer Science · #68R15 #Algorithms and Data Compression #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1710.02782
openalex publication_date 2017/10/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 ϕ: (2i) ↦ (2i)(2i+ 1), (2i+ 1) ↦ (2i+ 2) over all i ∈ ℕ. In this paper we investigate the occurrence of squares, palindromes, and Lyndon factors in this infinite word.