Frequencies of letters in infinite k-balanced sequences

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F25%3A00389232" target="_blank" >RIV/68407700:21340/25:00389232 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.14311/AP.2025.65.0534" target="_blank" >https://doi.org/10.14311/AP.2025.65.0534</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.14311/AP.2025.65.0534" target="_blank" >10.14311/AP.2025.65.0534</a>

Result language
angličtina
Original language name
Frequencies of letters in infinite k-balanced sequences
Original language description
The frequency of letters in a symbolic sequence u over a finite alphabet is one of the basic characteristics of u. The notion of k-balancedness captures the property that the number of any letter occurring in two arbitrary factors of u of equal length differs at most by k. For a fixed integer k and alphabet size d element N, we discuss possible frequencies of letters in k-balanced d-ary sequences. For the size d of the alphabet, we introduce the notion of balancedness threshold BT(d) and provide an upper bound on it, where BT(d) is the minimum k such that there exists a k-balanced sequence over a d-letter alphabet for all possible letter frequencies.
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
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)