How many squares must a binary sequence contain?
From MaRDI portal
Publication:1346736
zbMath0816.11007MaRDI QIDQ1346736
Aviezri S. Fraenkel, R. Jamie Simpson
Publication date: 6 April 1995
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/118610
11K16: Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc.
11A67: Other number representations
Related Items
Simple and flexible detection of contiguous repeats using a suffix tree, Spiraling and folding: the word view, Avoiding large squares in partial words, Avoiding large squares in infinite binary words, Fewest repetitions versus maximal-exponent powers in infinite binary words, On the number of frames in binary words, Cyclically repetition-free words on small alphabets, A generalization of Thue freeness for partial words, How many squares can a string contain?, Hairpin structures defined by DNA trajectories, Squares in partial words, A generalization of repetition threshold, Fewest repetitions in infinite binary words, A generator of morphisms for infinite words