Asymptotic formula for balanced words
From MaRDI portal
Publication:2116747
Recommendations
Cites work
- scientific article; zbMATH DE number 3885787 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3995796 (Why is no real title available?)
- scientific article; zbMATH DE number 2121181 (Why is no real title available?)
- scientific article; zbMATH DE number 3235403 (Why is no real title available?)
- scientific article; zbMATH DE number 3255845 (Why is no real title available?)
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- A new geometric approach to Sturmian words
- A zero-density theorem for the Riemann zeta-function
- Farey series and the Riemann hypothesis
- Fluctuations in the mean of Euler's phi function
- Multiplicative number theory. I. Classical theory
- On the Changes of Sign of a Certain Error Function
- On the Farey series and the Hecke \(L\)-functions
- On the Farey series and the Riemann hypothesis
- On the arithmetical complexity of Sturmian words
- Oscillations of the remainder term related to the Euler totient function
- Some combinatorial properties of Sturmian words
- Statistical problems related to irrational rotations
- The continued fraction expansion of α with μ(α) = 3
- The distribution of Farey points
Cited in
(7)- Balances of m-bonacci Words
- On factorially balanced sets of words
- On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet
- Some results on digital segments and balanced words
- Triangular partitions: enumeration, structure, and generation
- The most unbalanced words \(0^{q-p}1^{p}\) and majorization
- Balanced words and majorization
This page was built for publication: Asymptotic formula for balanced words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116747)