Pith. sign in

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

arxiv 2402.05381 v2 pith:ICMQVYPL submitted 2024-02-08 math.CO

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

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