On gapped repeats in a cyclic Fibonacci word
classification
🧮 math.CO
cs.FL
keywords
wordcyclicconsiderfibonaccigiveindicesiotakappa
read the original abstract
In this article, we consider the words with cyclic indices. For given $s$, we consider the pair $(\iota,\kappa)$ of indices such that the word of length $s$ from $\iota$ is equal to the word of length $s$ from $\kappa$. We give a characterization of such pairs for a cyclic Fibonacci word, and give the number of them.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.