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) mod 2) n≥0 is overlap-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 intege...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2000-12-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/110 |