Sums of Digits, Overlaps, and Palindromes
Let s_k(n) denote the sum of the digits in the base-k representation of n. In a celebrated paper, Thue showed that the infinite word (s_2(n) \bmod 2)_n≥ 0 is \emphoverlap-free, i.e., contains no subword of the form axaxa where x is any finite word and a is a single symbol. Let k,m be integers with k...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Discrete Mathematics & Theoretical Computer Science
2000-01-01
|
| Серии: | Discrete Mathematics & Theoretical Computer Science |
| Предметы: | |
| Online-ссылка: | https://dmtcs.episciences.org/282/pdf |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|