Some properties of the k-bonacci words on infinite alphabet

DOI10.37236/9406zbMATH Open1451.68216arXiv1911.12416OpenAlexW3106927214MaRDI QIDQ2200435FDOQ2200435

Authors: Narges Ghareghani, Morteza Mohammad-Noori, Pouyeh Sharifani 

Publication date: 21 September 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: The Fibonacci word $W$ on an infinite alphabet was introduced in [Zhang et al., Electronic J. Combinatorics 2017 24(2), 2-52] as a fixed point of the morphism $2iightarrow(2i)(2i+1)$, $(2i+1)ightarrow(2i+2)$, $igeq0$. Here, for any integer $k>2$, we define the infinite $k$-bonacci word $W^{(k)}$ on the infinite alphabet as the fixed point of the morphism $varph{i}_k$ on the alphabet $mathbbN$ defined for any $igeq0$ and any $0leqjleqk-1$, as �egin{equation*} varphi_k(ki+j) = left{ �egin{array}{ll} (ki)(ki+j+1) & ext{if } j = 0,cdots ,k-2,\ (ki+j+1)& ext{otherwise}. end{array} ight. end{equation*} We consider the sequence of finite words $(W_n^{(k)}{)}_{ngeq0}$, where $W_n^{(k)}$ 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 occur in different positions of $W_n^{(k)}$. 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$.

Full work available at URL: https://arxiv.org/abs/1911.12416

Recommendations

• On square factors and critical factors of \(k\)-bonacci words on infinite alphabet
• More properties of the Fibonacci word on an infinite alphabet
• On the Complexity of the Generalized Fibonacci Words
• Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words
• scientific article; zbMATH DE number 1111405

Mathematics Subject Classification ID

Combinatorics on words (68R15) Sequences (mod (m)) (11B50)

Cites Work

• Palindrome complexity.
• Return words in Sturmian and episturmian words
• Episturmian words and some constructions of de Luca and Rauzy
• Some properties of the Tribonacci sequence
• Sturmian and Episturmian Words
• Symbolic Dynamics II. Sturmian Trajectories
• Episturmian words and episturmian morphisms
• Palindromic complexity of infinite words associated with simple Parry numbers
• Episturmian words: a survey
• A combinatorial property of the Fibonacci words
• Palindromic prefixes and episturmian words
• Title not available (Why is that?)
• On a combinatorial property of Sturmian words
• More properties of the Fibonacci word on an infinite alphabet

Cited In (7)

• The numbers of repeated palindromes in the Fibonacci and Tribonacci words
• Title not available (Why is that?)
• On the \(k\)-Fibonacci words
• Mixing properties and entropy bounds of a family of Pisot random substitutions
• Kernel words and factorization of the \(k\)-bonacci sequence
• On square factors and critical factors of \(k\)-bonacci words on infinite alphabet
• Title not available (Why is that?)

This page was built for publication: Some properties of the \(k\)-bonacci words on infinite alphabet

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200435)