Abstract
We calculate the parity divisor functions associated to the ranks of the infinite monoletter word and to the Sturmian words and prove that there is a tilt of size proportional to log2−1/2 towards the number of odd divisors.
Original language | English (US) |
---|---|
Pages (from-to) | 329-336 |
Number of pages | 8 |
Journal | Proceedings of the Romanian Academy Series A - Mathematics Physics Technical Sciences Information Science |
Volume | 23 |
Issue number | 4 |
State | Published - Oct 1 2022 |
Keywords
- Sturmian words
- low complexity
- number of divisors
- parity
ASJC Scopus subject areas
- General Computer Science
- General Mathematics
- General Engineering
- General Physics and Astronomy