Palindromic Saturation

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages

Scientific paper

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

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Palindromic Saturation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Palindromic Saturation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Palindromic Saturation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-578479

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.