Home Science On gapped repeats in a cyclic Fibonacci word
Science

On gapped repeats in a cyclic Fibonacci word

Key Points

Combinatorics [Submitted on 1 Jun 2026] Title:On gapped repeats in a cyclic Fibonacci word View PDFAbstract: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.

Mathematics > Combinatorics [Submitted on 1 Jun 2026] Title:On gapped repeats in a cyclic Fibonacci word View PDFAbstract: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. Current browse context: math.CO References & Citations Loading... Bibliographic and Citation Tools Bibliographic Explorer (What is the Explorer?) Connected Papers (What is Connected Papers?) Litmaps (What is Litmaps?) scite Smart Citations (What are Smart Citations?) Code, Data and Media Associated with this Article alphaXiv (What is alphaXiv?) CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub (What is DagsHub?) Gotit.pub (What is GotitPub?) Hugging Face (What is Huggingface?) ScienceCast (What is ScienceCast?) Demos Recommenders and Search Tools Influence Flower (What are Influence Flowers?) CORE Recommender (What is CORE?) arXivLabs: experimental projects with community collaborators Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Fibonacci (ORG) CO References & Citations Loading (ORG) Bibliographic (PERSON) Data (ORG) Media Associated (ORG) DagsHub (PERSON) Gotit.pub (PERSON) Huggingface (ORG) Demos Recommenders (PERSON) CORE Recommender (ORG) CORE (ORG) arXiv (ORG)
Originally published by arXiv CS Read original →