On non-repetitive complexity of Arnoux-Rauzy words

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

Result language
angličtina
Original language name
On non-repetitive complexity of Arnoux-Rauzy words
Original language description
The non-repetitive complexity nrCu and the initial non-repetitive complexity inrCu are functions which reflect the structure of the infinite word u with respect to the repetitions of factors of a given length. We determine nrCu for the Arnoux-Rauzy words and inrCu for the standard Arnoux-Rauzy words. Our main tools are S-adic representation of Arnoux-Rauzy words and description of return words to their factors. The formulas we obtain are then used to evaluate nrCu and inrCu for the d-bonacci word.
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
10102 - Applied 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)<br>S - Specificky vyzkum na vysokych skolach

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

Similar results(10)