2-Balanced Sequences Coding Rectangle Exchange Transformation

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F24%3A00377959" target="_blank" >RIV/68407700:21340/24:00377959 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s00224-024-10188-6" target="_blank" >https://doi.org/10.1007/s00224-024-10188-6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00224-024-10188-6" target="_blank" >10.1007/s00224-024-10188-6</a>

Result language
angličtina
Original language name
2-Balanced Sequences Coding Rectangle Exchange Transformation
Original language description
We define a new class of ternary sequences that are 2-balanced. These sequences are obtained by colouring of Sturmian sequences. We show that the class contains sequences of any given letter frequencies. We provide an upper bound on factor and abelian complexity of these sequences. Using the interpretation by rectangle exchange transformation, we prove that for almost all triples of letter frequencies, the upper bound on factor and abelian complexity is reached. The bound on factor complexity is given using a number-theoretical function which we compute explicitly for a class of parameters.
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
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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)