The words 0011 and 001011 are claimed to be the shortest 'interesting' binary words, illustrated through many existing and a few new results.
Palindromic Periodicities
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
A palindromic periodicity is a factor of an infinite word $(ps)^\omega$ where $p$ and $s$ are palindromes and the factor has length at least $|ps|$, for example, $accabaccab$. In this paper we describe several ways in which a palindromic periodicity may arise through the interaction of palindromes and periodicity, the simplest case being when a palindrome is itself periodic. We then consider what happens when a word is a palindromic periodicity in two ways, a situation similar to that considered in the Fine and Wilf Lemma and obtain something slightly stronger than that lemma. The paper ends with suggestions for further work.
citation-role summary
citation-polarity summary
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
The Shortest Interesting Binary Words
The words 0011 and 001011 are claimed to be the shortest 'interesting' binary words, illustrated through many existing and a few new results.