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: | Jean-Paul Allouche, Jeffrey Shallit |
---|---|
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 |
Similar Items
-
Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences
by: Schaeffer, Luke R., et al.
Published: (2016) -
Similarity density of the Thue-Morse word with overlap-free infinite binary words
by: Chen Fei Du, et al.
Published: (2014-05-01) -
Finding all Palindrome Subsequences and Longest Common Palindrome Subsequences
by: Kuo-Rong Chuang, et al.
Published: (2007) -
Palindromic Quadratization and Structure-Preserving Algorithm for Palindromic Matrix Polynomials
by: Su, Wei-Shuo, et al.
Published: (2013) -
Outer Reaches of the Palindrome
by: McConnell, Michael Constantine
Published: (2003)