The number of distinct subpalindromes in random words

DOI10.3233/FI-2016-1366zbMATH Open1385.68029DBLPjournals/fuin/RubinchikS16arXiv1505.08043WikidataQ96718109 ScholiaQ96718109MaRDI QIDQ4976404FDOQ4976404

Authors: Mikhail Rubinchik, Arseny M. Shur 

Publication date: 28 July 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Abstract: We prove that a random word of length $n$ over a $k$-ary fixed alphabet contains, on expectation, $Theta(sqrtn)$ distinct palindromic factors. We study this number of factors, $E(n,k)$, in detail, showing that the limit $li{m}_{noinfty}E(n,k)/sqrtn$ does not exist for any $kge2$, $limin{f}_{noinfty}E(n,k)/sqrtn=Theta(1)$, and $limsu{p}_{noinfty}E(n,k)/sqrtn=Theta(sqrtk)$. Such a complicated behaviour stems from the asymmetry between the palindromes of even and odd length. We show that a similar, but much simpler, result on the expected number of squares in random words holds. We also provide some experimental data on the number of palindromic factors in random words.

Full work available at URL: https://arxiv.org/abs/1505.08043

Recommendations

• On the expected number of distinct gapped palindromic factors
• On the average number of regularities in a word
• Properties of palindromes in finite words
• Periods and borders of random words
• scientific article; zbMATH DE number 939777

zbMATH Keywords

combinatorics on wordsexpectationpalindromesquare factors

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (13)

• Arnoux-Rauzy substitutions and Palindrome words
• Borders, palindrome prefixes, and square prefixes
• Title not available (Why is that?)
• Density dichotomy in random words
• Upper bound for palindromic and factor complexity of rich words
• Random palindromes: Multivariate generating function and Bernoulli density
• On the average number of regularities in a word
• Periods and borders of random words
• On the expected number of distinct gapped palindromic factors
• Tight tradeoffs for real-time approximation of longest palindromes in streams
• On the palindromic decomposition of binary words
• EERTREE: an efficient data structure for processing palindromes in strings
• Title not available (Why is that?)

This page was built for publication: The number of distinct subpalindromes in random words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976404)