How many squares must a binary sequence contain?

zbMath0816.11007MaRDI QIDQ1346736

R. Jamie Simpson, Aviezri S. Fraenkel

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

zbMATH Keywords

length; distinct squares; longest binary string

Mathematics Subject Classification ID

11K16: Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc.

11A67: Other number representations

Related Items

Avoiding or Limiting Regularities in Words, Avoidability of long 𝑘-abelian repetitions, Simple and flexible detection of contiguous repeats using a suffix tree, Avoidability index for binary patterns with reversal, Square-free words with one possible mismatch, Infinite words containing the minimal number of repetitions, Nondeterministic automatic complexity of overlap-free and almost square-free words, On some generalizations of abelian power avoidability, Relations on words, 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?, Existence of words over three-letter alphabet not containing squares with replacement errors, New bounds on antipowers in words, Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101, Avoiding 2-binomial squares and cubes, Hairpin structures defined by DNA trajectories, Existence of words over a binary alphabet free from squares with mismatches, Infinite binary words containing repetitions of odd period, On the aperiodic avoidability of binary patterns with variables and reversals, Squares in partial words, A generalization of repetition threshold, Squarefree words with interior disposable factors, Fewest repetitions in infinite binary words, A generator of morphisms for infinite words