Jan 30, 2014 · In this survey we point to the combined role played by the length and the number of distinct symbols of the string in both problems.

We present an approach to the problem of maximum number of distinct squares in a string which underlines the importance of considering as key variables both ...

Oct 22, 2024 · A d-step approach to this problem introducing the size d of the alphabet as a parameter in addition to the length n of the string was proposed ...

Let us denote @s"d(n), respectively @r"d(n), the maximum number of distinct primitively rooted squares, respectively runs, over all strings of length n ...

It is believed, that the number of distinct squares is bounded by the length of the string. There are no further results or improvements despite the fact that ...

A d-step approach to the maximum number of distinct squares and runs in strings · Mathematics. Discrete Applied Mathematics · 2014.

We propose a new approach to the analysis of runs based on the properties of subperiods: the periods of periodic parts of the runs. We show that ρ(n) ≤ 5 n.

We present an approach to the problem of maximum number of distinct squares in a string which underlines the importance of considering as key variables both ...

We present an approach to the problem of maximum num- ber of distinct squares in a string which underlines the importance of considering as key variables both ...

We conjecture that the upper bound for the maximum number of primitively rooted distinct squares is n − d. d-step approach was inspired by the techniques used ...