LongNbrs and palindromes: an interesting application of a class

A word is called a palindrome if it is equal to its reversal. In the paper we consider a k-abelian modification of this notion. Two words are called k-abelian equivalent if they contain the same number of occurrences of each factor of length at most k. ...

What started off as an enrichment assignment for a third grader has developed into a rich source of programming assignments. The long integers, needed to determine whether a number eventually becomes a palindrome under the process of reversal and ...

There is a very short and beautiful proof that the number of distinct non-empty palindromes in a word of length n is at most n. In this paper we show, with a very complicated proof, that the number of distinct non-empty palindromes with length at most n ...