On a theorem concerning partially overlapping subpalindromes of a binary word
The paper contains an alternative and maybe more natural proof of a technical theorem earlier proven and used by the authors in a previous paper [Discrete Appl. Math. 284, 434--443 (2020; Zbl 1448.68363)]: Let \(u \in \{1, 2\}^*\), let \(t, v \in 2^*\), and let \(p\) and \(q\) be subpalindromes of \(tu\) and \(uv\), respectively (meaning that they are palindromic scattered subwords of respective words). If the sum of lengths of \(p\) and \(q\) is at least twice the length of \(u\), then the number of \(1\)s in \(u\) is majorized by \(\frac{|tv|- 1}{|tv|} |tuv|_2\).
- Abelian bordered factors and periodicity
- Abelian borders in binary words
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
- Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words
- Dyck words, lattice paths, and abelian borders
- On highly palindromic words
- On highly palindromic words: the ternary case
- On the number of abelian bordered words (with an example of automatic theorem-proving)
This page was built for publication: On a theorem concerning partially overlapping subpalindromes of a binary word
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2070082)
