On gapped repeats in a cyclic Fibonacci word
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914622872748032 |
|---|---|
| author | Horiyama, Takashi Numata, Yasuhide Seto, Kazuhisa Tsujie, Shuhei |
| author_facet | Horiyama, Takashi Numata, Yasuhide Seto, Kazuhisa Tsujie, Shuhei |
| contents | In this article, we consider the words with cyclic indices. For given $s$, we consider the pair $(ι,κ)$ of indices such that the word of length $s$ from $ι$ is equal to the word of length $s$ from $κ$. We give a characterization of such pairs for a cyclic Fibonacci word, and give the number of them. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2606_02071 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On gapped repeats in a cyclic Fibonacci word Horiyama, Takashi Numata, Yasuhide Seto, Kazuhisa Tsujie, Shuhei Combinatorics Formal Languages and Automata Theory 11B39, 68R15, 05A05 In this article, we consider the words with cyclic indices. For given $s$, we consider the pair $(ι,κ)$ of indices such that the word of length $s$ from $ι$ is equal to the word of length $s$ from $κ$. We give a characterization of such pairs for a cyclic Fibonacci word, and give the number of them. |
| title | On gapped repeats in a cyclic Fibonacci word |
| topic | Combinatorics Formal Languages and Automata Theory 11B39, 68R15, 05A05 |
| url | https://arxiv.org/abs/2606.02071 |