More properties of the Fibonacci word on an infinite alphabet
Amy Glen, Jamie Simpson, W. F. Smyth

TL;DR
This paper explores the Fibonacci word on an infinite alphabet, analyzing its structural properties such as squares, palindromes, and Lyndon factors, revealing new combinatorial insights about this infinite word.
Contribution
It provides new results on the occurrence and structure of squares, palindromes, and Lyndon factors within the Fibonacci word on an infinite alphabet.
Findings
Characterization of squares in the Fibonacci word
Identification of palindromes and their distribution
Analysis of Lyndon factors in the infinite Fibonacci word
Abstract
Recently the Fibonacci word 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 over all . In this paper we investigate the occurrence of squares, palindromes, and Lyndon factors in this infinite word.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Algorithms and Data Compression · Coding theory and cryptography
