Related papers: Subexponential upper bound on the number of rich w…
Any finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is reached, the word $w$ is called rich. The number of rich words of length $n$ over an alphabet of cardinality $q$ is denoted…
A finite word $w$ is called \emph{rich} if it contains $\vert w\vert+1$ distinct palindromic factors including the empty word. Let $q\geq 2$ be the size of the alphabet. Let $R(n)$ be the number of rich words of length $n$. Let $d>1$ be a…
A non-empty word $w$ is a \emph{border} of a word $u$ if $\vert w\vert<\vert u\vert$ and $w$ is both a prefix and a suffix of $u$. A word $u$ is \emph{privileged} if $\vert u\vert\leq 1$ or if $u$ has a privileged border $w$ that appears…
A non-empty word $w$ is a border of the word $u$ if $\vert w\vert<\vert u\vert$ and $w$ is both a prefix and a suffix of $u$. A word $u$ with the border $w$ is closed if $u$ has exactly two occurrences of $w$. A word $u$ is privileged if…
A finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is attained, the word $w$ is called rich. An infinite word $w$ is called rich if every finite factor of $w$ is rich. Let $w$ be a word…
A word $w$ is called rich if it contains $| w|+1$ palindromic factors, including the empty word. We say that a rich word $w$ can be extended in at least two ways if there are two distinct letters $x,y$ such that $wx,wy$ are rich. Let $R$…
A word of length $n$ is rich if it contains $n$ nonempty palindromic factors. An infinite word is rich if all of its finite factors are rich. Baranwal and Shallit produced an infinite binary rich word with critical exponent $2+\sqrt{2}/2$…
Rich words are characterized by containing the maximum possible number of distinct palindromes. Several characteristic properties of rich words have been studied; yet the analysis of repetitions in rich words still involves some interesting…
From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…
Let $w$ be any word over the alphabet $\{0,1,\ldots, q-1\}$, and denote by $h$ either a polynomial of degree $d\geq 1$ or $h: n\mapsto m^n$ for a fixed $m$. Furthermore, denote by $e_q(w;h(n))$ the number of occurrences of $w$ as a subword…
A word w is rich if it has |w|+1 many distinct palindromic factors, including the empty word. A word is square-free if it does not have a factor uu, where u is a non-empty word. Pelantov\'a and Starosta (Discrete Math. 313 (2013)) proved…
Consider the set of those binary words with no non-empty factors of the form $xxx^R$. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows polynomially or exponentially with length. In this paper, we demonstrate the…
A word~$w$ has a border $u$ if $u$ is a non-empty proper prefix and suffix of $u$. A word~$w$ is said to be \emph{closed} if $w$ is of length at most $1$ or if $w$ has a border that occurs exactly twice in $w$. A word~$w$ is said to be…
In 2017, Vesti proposed the problem of determining the repetition threshold for infinite rich words, i.e., for infinite words in which all factors of length $n$ contain $n$ distinct nonempty palindromic factors. In 2020, Currie, Mol, and…
We study some properties of the growth rate of $\mathcal{L}(\mathcal{A},\mathcal{F})$, that is, the language of words over the alphabet $\mathcal{A}$ avoiding the set of forbidden factors $\mathcal{F}$. We first provide a sufficient…
In combinatorics on words, a word w of length n over an alphabet of size q is said to be privileged if n <= 1 or if n >= 2 and w has a privileged border that occurs exactly twice in w. Forsyth, Jayakumar and Shallit proved that there exist…
A word is called closed if it has a prefix which is also its suffix and there is no internal occurrences of this prefix in the word. In this paper we study words that are rich in closed factors, i.e., which contain the maximal possible…
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…
It is a fundamental property of non-letter Lyndon words that they can be expressed as a concatenation of two shorter Lyndon words. This leads to a naive lower bound log_{2}(n)} + 1 for the number of distinct Lyndon factors that a Lyndon…
We prove that a random word of length $n$ over a $k$-ary fixed alphabet contains, on expectation, $\Theta(\sqrt{n})$ distinct palindromic factors. We study this number of factors, $E(n,k)$, in detail, showing that the limit…