|
%I #19 Nov 04 2018 12:09:51
%S 0,1,0,2,0,1,0,3,0,1,0,2,1,0,1,3,1,0,1,2,1,3,2,0,2,1,0,1,3,0,1,0,2,0,
%T 3,0,2,0,1,2,0,2,3,1,0,1,2,0,2,3,2,0,2,1,2,3,0,3,2,3,0,1,0,2,0,3,0,2,
%U 0,1,2,1,3,0,1,0,2,0,3,0,1,3,0,3,2
%N (Conjecturally) the lexicographically earliest infinite sequence over {0,1,2,3} avoiding abelian squares.
%C An abelian square is a nonempty string where the second half is a rearrangement of the first half, like the English word "reappear". To "avoid" an abelian square means to have no contiguous block of that form. Although an easy compactness argument, combined with a result of Keränen (1992) shows that the lexicographically earliest infinite string avoiding abelian squares over the alphabet {0,1,2,3} must exist, the terms provided are only conjecturally part of the described sequence, because we have no proof currently that this particular string can be extended infinitely far to the right.
%H Veikko Keränen, <a href="https://www.researchgate.net/publication/220897559_Abelian_Squares_are_Avoidable_on_4_Letters">Abelian squares are avoidable on 4 letters</a>, in ICALP 1992, volume 623 of Lecture Notes in Comput. Sci., pages 41-52. Springer-Verlag, 1992.
%Y Cf. A272653, A272654, A272655.
%K nonn
%O 1,4
%A _Jeffrey Shallit_, Nov 01 2018
|
