Toeplitz sequences, paperfolding, towers of Hanoi and progression-free sequences of integers
What is the relationship between folding a piece of paper, moving disks in the classical tower of Hanoi algorithm, and searching for maximal sequences of integers having no \(p\) terms in arithmetic progression? Well might one ask. The authors do, and answer their question by showing that the notion of Toeplitz sequence -- to wit an aperiodic sequence obtained by sequentially filling the `holes' in a periodic sequence by a periodic sequence, as introduced in \textit{K. Jacobs} and \textit{M. Keane} [Z. Wahrscheinlichkeitstheor. Verw. Geb. 13, 123-131 (1969; Zbl 0195.527)], allows a unified description of these matters. The authors' interesting remarks and the extensive list of references makes this a paper well worth study.
- Toeplitz sequences, \(p\)-paperfolding, automatic sequences and polynomials
- Canonical positions for the factors in paperfolding sequences
- About the p-paperfolding words
- Square-free tower of Hanoi sequences
- Uniform tag systems for paperfolding sequences
- Complexity of Toeplitz sequences
- Mock characters and the Kronecker symbol
- A relative of the Thue-Morse sequence
- Almost automorphy profile of solutions for difference equations of Volterra type
- FLIPPING COINS, FOLDING PAPER, AND FINDING FAMILIAR FRACTALS IN THE TOWER OF HANOI
- Toeplitz words, generalized periodicity and periodically iterated morphisms
- scientific article; zbMATH DE number 7734740 (Why is no real title available?)
This page was built for publication: Toeplitz sequences, paperfolding, towers of Hanoi and progression-free sequences of integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803626)
