Palindromic Saturation
| dc.creator | Balková, L. | |
| dc.creator | Pelantová, E. | |
| dc.date | 2008-02-21 | |
| dc.date | 2008-02-26 | |
| dc.date.accessioned | 2026-07-07T09:22:52Z | |
| dc.date.available | 2026-07-07T09:22:52Z | |
| dc.description | 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}. | |
| dc.description | 6 pages | |
| dc.identifier | https://arxiv.org/abs/0802.2995 | |
| dc.identifier | http://arxiv.org/abs/0802.2995 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/155531 | |
| dc.subject | Combinatorics | |
| dc.title | Palindromic Saturation | |
| dc.type | text |