|
%I #15 Feb 08 2020 04:08:32
%S 2,4,15,46
%N Least integer t such that every binary word of length t+1 contains a reversed split occurrence of an n-overlap.
%C An "n-overlap" is a word of the form xxx', where x is a nonempty word of length at least n, and x' is a prefix of x of length n. Thus, for example, abcdabcdab is a 2-overlap. A reversed split occurrence of a pattern p is a word of the form xyz where zx matches the pattern.
%C For n = 0,1,2,3 words achieving the bound a(n) are as follows:
%C n = 0: 01
%C n = 1: 0011
%C n = 2: 010001100111001
%C n = 3: 0010100110100011111000111010000011101010001100
%H D. Gabric and J. Shallit, <a href="https://arxiv.org/abs/2002.01968">Avoidance of split overlaps</a>, arxiv preprint arXiv:2002.01968 [cs.DM], February 5 2020.
%Y Cf. A332235.
%K nonn,more
%O 0,1
%A _Jeffrey Shallit_, Feb 07 2020
|
