Mikhail Rubinchik

  • Citations Per Year
Learn More
We prove that a random word of length n over a k-ary fixed alphabet contains, on expectation, Θ( √ n) distinct palindromic factors. We study this number of factors, E(n, k), in detail, showing that the limit limn→∞ E(n, k)/ √ n does not exist for any k ≥ 2, lim infn→∞ E(n, k)/ √ n = Θ(1), and lim supn→∞ E(n, k)/ √ n = Θ( √ k). Such a complicated behaviour(More)