Frequencies of letters in infinite k-balanced sequences
Open Access
- 7 November 2025
- journal article
- Published by Czech Technical University in Prague - Central Library in Acta Polytechnica
- Vol. 65 (5) , 534-538
Abstract
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 ∈ 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.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- 2-Balanced Sequences Coding Rectangle Exchange TransformationTheory of Computing Systems, 2024
- The Rauzy Gasket2013
- Substitution Dynamical Systems - Spectral Analysis2010
- Directional complexity of the hypercubic billiardDiscrete Mathematics, 2009
- Balances for fixed points of primitive substitutionsTheoretical Computer Science, 2003
- Algebraic Combinatorics on Words2002
- A Characterization of Sturmian Words by Return WordsEuropean Journal of Combinatorics, 2001
- Suites équilibréesTheoretical Computer Science, 2000
- Deviation for interval exchange transformationsErgodic Theory and Dynamical Systems, 1997
- Roots of unity and covering setsMathematische Annalen, 1971