Some properties of the \(k\)-bonacci words on infinite alphabet (Q2200435)

Summary: The Fibonacci word \(W\) on an infinite alphabet was introduced in [\textit{J. Zhang} et al., Electron. J. Comb. 24, No. 2, Research Paper P2.52, 22 p. (2017; Zbl 1366.11038)] as a fixed point of the morphism \(2i\rightarrow (2i)(2i+1)\), \((2i+1) \rightarrow (2i+2)\), \(i\geq 0\). Here, for any integer \(k>2\), we define the infinite \(k\)-bonacci word \(W^{(k)}\) on the infinite alphabet as \(\varphi_k^{\omega}(0)\), where the morphism \(\varphi_k\) on the alphabet \(\mathbb{N}\) is defined for any \(i\geq 0\) and any \(0\leq j\leq k-1\), by \[\varphi_k(ki+j) = \begin{cases} (ki)(ki+j+1) \quad & \text{if } j = 0,\cdots ,k-2, \\ (ki+j+1) \quad & \text{otherwise}. \end{cases}.\] We consider the sequence of finite words \((W^{(k)}_n)_{n\geq 0} \), where \(W^{(k)}_n\) is the prefix of \(W^{(k)}\) whose length is the \((n+k)\)-th \(k\)-bonacci number. We then provide a recursive formula for the number of palindromes that occur in different positions of \(W^{(k)}_n\). Finally, we obtain the structure of all palindromes occurring in \(W^{(k)}\) and based on this, we compute the palindrome complexity of \(W^{(k)}\), for any \(k>2\).