Upper bound for the number of closed and privileged words

11/25/2019
by   Josef Rukavicka, et al.
0

A non-empty word w is a border of the word u if | w|<| u| 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 | u|≤ 1 or if u contains a privileged border w that appears exactly twice in u. Peltomäki (2016) presented the following open problem: "Give a nontrivial upper bound for B(n)", where B(n) denotes the number of privileged words of length n. Let D(n) denote the number of closed words of length n. Let q>1 be the size of the alphabet. We show that there is a positive real constant c such that D(n)≤ clnnq^n/√(n)n>1 Privileged words are a subset of closed words, hence we show also an upper bound for the number of privileged words.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2022

Upper bound for the number of privileged words

A non-empty word w is a border of a word u if | w|<| u| and w is both a ...
research
12/18/2022

Property of upper bounds on the number of rich words

A finite word w is called rich if it contains | w|+1 distinct palindromi...
research
06/28/2022

Asymptotic bounds for the number of closed and privileged words

A word w has a border u if u is a non-empty proper prefix and suffix of ...
research
01/14/2019

The Complexity of Unavoidable Word Patterns

The avoidability, or unavoidability of patterns in words over finite alp...
research
09/19/2022

Convergence of the number of period sets in strings

Consider words of length n. The set of all periods of a word of length n...
research
08/31/2021

Non-homotopic Loops with a Bounded Number of Pairwise Intersections

Let V_n be a set of n points in the plane and let x ∉ V_n. An x-loop is ...
research
06/24/2020

Lyndon Words, the Three Squares Lemma, and Primitive Squares

We revisit the so-called "Three Squares Lemma" by Crochemore and Rytter ...

Please sign up or login with your details

Forgot password? Click here to reset