Toeplitz sequences, paperfolding, towers of Hanoi and progression-free sequences of integers (Q1803626): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 09:10, 1 February 2024

scientific article
Language Label Description Also known as
English
Toeplitz sequences, paperfolding, towers of Hanoi and progression-free sequences of integers
scientific article

    Statements

    Toeplitz sequences, paperfolding, towers of Hanoi and progression-free sequences of integers (English)
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    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.
    0 references
    tower of Hanoi algorithm
    0 references
    maximal sequences of integers having no \(p\) terms in arithmetic progression
    0 references
    Toeplitz sequence
    0 references
    aperiodic sequence
    0 references

    Identifiers