Pith. sign in

REVIEW 1 cited by

Some Remarks on 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

arxiv 2407.10564 v2 pith:RETKPQJ5 submitted 2024-07-15 math.CO cs.DMcs.FL

classification math.COcs.DMcs.FL
keywords wordpalindromicwordsperiodicitiesnumberproveresultssome
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The Shortest Interesting Binary Words

    math.CO 2024-12 conditional novelty 3.0 of 10

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

Pith tools