English

Some Remarks on Palindromic Periodicities

Combinatorics 2024-08-13 v2 Discrete Mathematics Formal Languages and Automata Theory

Abstract

We say a finite word xx is a palindromic periodicity if there exist two palindromes pp and ss such that xps|x| \geq |ps| and xx is a prefix of the word (ps)ω=pspsps(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.

Keywords

Cite

@article{arxiv.2407.10564,
  title  = {Some Remarks on Palindromic Periodicities},
  author = {Gabriele Fici and Jeffrey Shallit and Jamie Simpson},
  journal= {arXiv preprint arXiv:2407.10564},
  year   = {2024}
}

Comments

revised version with minor corrections and more details of proofs

R2 v1 2026-06-28T17:40:55.389Z