An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F24%3A00373167" target="_blank" >RIV/68407700:21340/24:00373167 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.tcs.2024.114490" target="_blank" >https://doi.org/10.1016/j.tcs.2024.114490</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2024.114490" target="_blank" >10.1016/j.tcs.2024.114490</a>

Result language
angličtina
Original language name
An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence
Original language description
We colour the Fibonacci sequence by suitable constant gap sequences to provide an upper bound on the asymptotic repetition threshold of d-ary balanced sequences. The bound is attained for d equal to 2,4 and 8 and we conjecture that it happens for infinitely many even d's. Our bound reveals an essential difference in behaviour of the repetition threshold and the asymptotic repetition threshold of balanced sequences.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/EF16_019%2F0000778" target="_blank" >EF16_019/0000778: Center for advanced applied science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)