Words avoiding repetitions in arithmetic progressions

@article{Kao2008WordsAR,
  title={Words avoiding repetitions in arithmetic progressions},
  author={Jui-Yi Kao and Narad Rampersad and Jeffrey Shallit and Manuel Silva},
  journal={Theor. Comput. Sci.},
  year={2008},
  volume={391},
  pages={126-137}
}

Figures from this paper

On p-adic avoidance of words

In this paper a new modification of the notion of avoidance of words is introduced. We say, that a word w p-adically avoids a word u, if u does not belong to the set of all words whose symbols occur

Some further results on squarefree arithmetic progressions in infinite words

On some problems of Harju concerning squarefree arithmetic progressions in infinite words

In a recent paper, Harju posed three open problems concerning square-free arithmetic progressions in infinite words. In this note we solve two of them.

Repetitions in Toeplitz Words and the Thue Threshold

TLDR
It is shown that the Toeplitz word generated by any sequence of primitive partial words of maximal length k is k-th power-free, and the existence of a 2-colouring of the integer lattice points in the Euclidean plane such that the sequence of colours of consecutive points on any straight line does not contain squares of length larger than 26.

A Narad Rampersad

U. Schmidt proved that any binary pattern of length at least 1 3 is avoided by either the Thue–Morse word or the Fibonacci word. We give a somewhat simpler proof of this result.

Avoiding Multiple Repetitions in Euclidean Spaces

We study colorings of Euclidean spaces avoiding specified patterns on straight lines. This extends the seminal work of Thue on avoidability properties of sequences to continuous, higher dimensional...

Abelian powers in paper-folding words

  • S. Holub
  • Mathematics
    J. Comb. Theory, Ser. A
  • 2013

A New Approach to the Paperfolding Sequences

In this paper we show how to re-derive known results about the paperfolding sequences, and obtain new ones, using a new approach using a decision method and some machine computation. We also obtain

Overlap-Free Words and Generalizations

"The research presented here was supported financially by the Natural Sciences and Engineering Research Council of Canada (NSERC)."

References

SHOWING 1-10 OF 24 REFERENCES

Non-Repetitive Tilings

TLDR
A two-dimensional version of Axel Thue's result, showing how to construct a rectangular tiling of the plane using 5 symbols which has the property that lines of tiles which are horizontal, vertical or have slope +1 or $-1$ contain no repetitions.

Multidimensional Unrepetitive Configurations

  • A. Carpi
  • Mathematics
    Theor. Comput. Sci.
  • 1988

Thue type problems for graphs, points, and numbers

Infinite 0-1-sequences without long adjacent identical blocks

On Nonrepetitive Sequences

Facteurs des suites de Rudin-Shapiro généralisées

\Integrating" paperfolding sequences yields generalized Rudin-Shapiro sequences. We study the factors (subwords) of these sequences, giving an (optimal) property of \half-synchronization" and a

The number of factors in a paperfolding sequence

  • J. Allouche
  • Mathematics
    Bulletin of the Australian Mathematical Society
  • 1992
We prove that the number of factors of length k in any paperfolding sequence is equal to 4k once k ≥ 7.

Über unendliche Zeichenreihen

  • Kra. Vidensk. Selsk. Skrifter. I. Mat. Nat. Kl. 1
  • 1906