
Palindromes in twodimensional Words
A twodimensional (2D) word is a 2D palindrome if it is equal to its rev...
read it

Upper bound for the number of closed and privileged words
A nonempty word w is a border of the word u if  w< u and w is both ...
read it

Palindromic Subsequences in Finite Words
In 1999 Lyngsø and Pedersen proposed a conjecture stating that every bin...
read it

Borders, Palindrome Prefixes, and Square Prefixes
We show that the number of lengthn words over a kletter alphabet havin...
read it

Avoiding conjugacy classes on the 5letter alphabet
We construct an infinite word w over the 5letter alphabet such that for...
read it

WordLevel Coreference Resolution
Recent coreference resolution models rely heavily on span representation...
read it

Gray Cycles of Maximum Length Related to kCharacter Substitutions
Given a word binary relation τ we define a τGray cycle over a finite la...
read it
Counting scattered palindromes in a finite word
We investigate the scattered palindromic subwords in a finite word. We start by characterizing the words with the least number of scattered palindromic subwords. Then, we give an upper bound for the total number of palindromic subwords in a word of length n in terms of Fibonacci number F_n by proving that at most F_n new scattered palindromic subwords can be created on the concatenation of a letter to a word of length n1. We propose a conjecture on the maximum number of scattered palindromic subwords in a word of length n with q distinct letters. We support the conjecture by showing its validity for words where q≥n/2.
READ FULL TEXT
Comments
There are no comments yet.