Pith. sign in

Some Remarks on Palindromic Periodicities

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

We say a finite word $x$ is a palindromic periodicity if there exist two palindromes $p$ and $s$ such that $|x| \geq |ps|$ and $x$ is a prefix of the word $(ps)^\omega = pspsps\cdots$. In this paper we examine the palindromic periodicities occurring in some classical infinite words, such as Sturmian words, episturmian words, the Thue-Morse word, the period-doubling word, the Rudin-Shapiro word, the paperfolding word, and the Tribonacci word, and prove a number of results about them. We also prove results about words with the smallest number of palindromic periodicities.

citation-role summary

background 1

citation-polarity summary

fields

math.CO 1

years

2024 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

The Shortest Interesting Binary Words

math.CO · 2024-12-30 · conditional · novelty 3.0

The words 0011 and 001011 are claimed to be the shortest 'interesting' binary words, illustrated through many existing and a few new results.

citing papers explorer

Showing 1 of 1 citing paper.

  • The Shortest Interesting Binary Words math.CO · 2024-12-30 · conditional · none · ref 24 · internal anchor

    The words 0011 and 001011 are claimed to be the shortest 'interesting' binary words, illustrated through many existing and a few new results.