Palindromic Saturation
Combinatorics
2008-02-26 v2
Abstract
We consider two {seemingly} different definitions of infinite words which contain {the} utmost number of palindromes. We show that these two definitions coincide. {The keynote of the proof is a meticulous inspection of properties of complete return words and the application of some basic graph theory.} In fact, we provide another proof of the result announced in \cite{Zamboni}.
Cite
@article{arxiv.0802.2995,
title = {Palindromic Saturation},
author = {L. Balková and E. Pelantová},
journal= {arXiv preprint arXiv:0802.2995},
year = {2008}
}
Comments
6 pages