Pith. sign in

REVIEW 2 cited by

On the Combinatorics of Palindromes and Antipalindromes

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1503.09112 v1 pith:42FQPH6U submitted 2015-03-31 cs.FL

Chuan Guo , Jeffrey Shallit , Arseny M. Shur This is my paper · ORCID
classification cs.FL
keywords antipalindromespalindromescombinatoricsconjugatescounterpartsenumerationnotionsnumber
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We prove a number of results on the structure and enumeration of palindromes and antipalindromes. In particular, we study conjugates of palindromes, palindromic pairs, rich words, and the counterparts of these notions for antipalindromes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. On the Complexity of Language Membership for Probabilistic Words

    cs.FL 2025-10 conditional novelty 7.0 of 10

    Probabilistic membership for context-free languages is in PTIME for unambiguous and poly-slicewise-unambiguous languages, #P-hard for some unions of two linear unambiguous CFLs, and tractable via complement-capable ci...

  2. 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