How many squares must a binary sequence contain?
From MaRDI portal
Publication:1346736
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
Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Other number representations (11A67)
Related Items (36)
On the aperiodic avoidability of binary patterns with variables and reversals ⋮ Clusters of repetition roots: single chains ⋮ Square-free words with one possible mismatch ⋮ Fewest repetitions in infinite binary words ⋮ Squarefree words with interior disposable factors ⋮ Infinite words containing the minimal number of repetitions ⋮ Constructing Words with High Distinct Square Densities ⋮ Long twins in random words ⋮ On shuffled-square-free words ⋮ New bounds on antipowers in words ⋮ Squares in partial words ⋮ Avoiding or Limiting Regularities in Words ⋮ Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101 ⋮ Fewest repetitions versus maximal-exponent powers in infinite binary words ⋮ Nondeterministic automatic complexity of overlap-free and almost square-free words ⋮ On some generalizations of abelian power avoidability ⋮ Relations on words ⋮ Avoiding 2-binomial squares and cubes ⋮ Avoidability of long 𝑘-abelian repetitions ⋮ Spiraling and folding: the word view ⋮ Avoiding large squares in partial words ⋮ Avoiding large squares in infinite binary words ⋮ Hairpin structures defined by DNA trajectories ⋮ On the number of frames in binary words ⋮ Simple and flexible detection of contiguous repeats using a suffix tree ⋮ Existence of words over three-letter alphabet not containing squares with replacement errors ⋮ A generalization of Thue freeness for partial words ⋮ How many squares can a string contain? ⋮ Cyclically repetition-free words on small alphabets ⋮ A generator of morphisms for infinite words ⋮ Existence of words over a binary alphabet free from squares with mismatches ⋮ A generalization of repetition threshold ⋮ Infinite binary words containing repetitions of odd period ⋮ The simplest binary word with only three squares ⋮ Clusters of repetition roots forming prefix chains ⋮ Avoidability index for binary patterns with reversal
This page was built for publication: How many squares must a binary sequence contain?
