# 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 is a subset of {0,1,2,…,n-1}. However, any subset of {0,1,2,…,n-1} is not necessarily a valid set of periods. In a seminal paper in 1981, Guibas and Odlyzko have proposed to encode the set of periods of a word into an n long binary string, called an autocorrelation, where a one at position i denotes a period of i. They considered the question of recognizing a valid period set, and also studied the number of valid period sets for length n, denoted κ_n. They conjectured that ln(κ_n) asymptotically converges to a constant times ln^2(n). If improved lower bounds for ln(κ_n)/ln^2(n) were proposed in 2001, the question of a tight upper bound has remained opened since Guibas and Odlyzko's paper. Here, we exhibit an upper bound for this fraction, which implies its convergence and closes this long standing conjecture. Moreover, we extend our result to find similar bounds for the number of correlations: a generalization of autocorrelations which encodes the overlaps between two strings.

• 5 publications
• 5 publications
• 39 publications
research
11/25/2019

### Upper bound for the number of closed and privileged words

A non-empty word w is a border of the word u if | w|<| u| and w is both ...
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
02/01/2023

### Order-Preserving Squares in Strings

An order-preserving square in a string is a fragment of the form uv wher...
research
05/24/2020

### An inequality for the number of periods in a word

We prove an inequality for the number of periods in a word x in terms of...
research
01/14/2019

### The Complexity of Unavoidable Word Patterns

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

### Weighted Shortest Common Supersequence Problem Revisited

A weighted string, also known as a position weight matrix, is a sequence...
research
02/21/2022

### Defining long words succinctly in FO and MSO

We consider the length of the longest word definable in FO and MSO via a...