REVIEW 1 cited by
Palindromic Periodicities
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
Forward citations
Cited by 1 Pith paper
-
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.
Discussion (0). Continue with ORCID to comment.