No label defined (Q3924262)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3737740
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3737740

      Statements

      1981
      0 references
      Beatty sequence
      0 references
      substitution
      0 references
      non-periodic tilings of plane
      0 references
      infinite sequences
      0 references
      infinitely many predecessors
      0 references
      0 references
      This paper is a predecessor to two papers [ibid. 43, 39--52 (1981; Zbl 0457.05021); ibid. 43, 53--66 (1981; Zbl 0457.05022)] in which the author gives a beautiful analysis of Penrose's non-periodic tilings of the plane. The starting point of this analysis is the special hierarchical structure of these tilings, which can be expressed as follows. There are two types of tiles, \(D\) and \(K\), and these can be replaced respectively by two combinations of tiles \((D,K)\) and \((D,K,K)\) in such a way that a new tiling results, which is moreover (apart from a scaling factor) a shift of the original tiling. This leads to the study of substitutions, i.e., maps which assign words to symbols, like above \(0\to 01\), \(1\to 011\). For a finite or infinite sequence of zeros and ones its successor is obtained by replacing each \(0\) by \(01\), and each \(1\) by \(011\). Now if a finite or infinite sequence is composed of words \(01\) and \(011\), then one can perform the inverse operation, and the new sequence is called a predecessor to the old one. This paper treats the question which infinite sequences have infinitely many predecessors. For a very special class of substitutions there is a neat answer to this question in terms of sequences \(([\alpha(n +1) + \beta] - [\alpha n +\beta])\) for some real numbers \(\alpha, \beta\). The latter sequences have been studied extensively. The author gives some general theorems relevant to the study of this type of sequences (see \textit{A. Mc. D. Mercer} [Int. J. Math. Math. Sci. 1, 525--528 (1978; Zbl 0401.10021)] -- for a related recent result), and solves the above mentioned problem for the substitution given by \(0\to 10\), \(1\to 100\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references