No label defined (Q4355053)

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 1062566
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1062566

      Statements

      0 references
      17 September 1997
      0 references
      4-tuples
      0 references
      recurrence
      0 references
      arithmetical functions
      0 references
      Ducci-process
      0 references
      Ducci-sequences
      0 references
      The successive iterations of a function \(f\) are called a Ducci-process if \(f \) satisfies the following conditions: 1. There exists a function \(g(x,y)\) whose domain is the set of pairs of nonnegative integers and whose range is the set of nonnegative integers. 2. \(f(x_1, x_2, \dots, x_n)= (g(x_1,x_2)\), \(g(x_2,x_3), \dots, g(x_n,x_1))\). 3. The \(n\) entries of \(f^k(x_1, x_2, \dots, x_n)\) are bounded for all \(k\). The bound depends on the initial choice of \(x_1,x_2, \dots, x_n\) [see \textit{F.-B. Wong}, Fibonacci Q. 20, 97--105 (1982; Zbl 0484.10007)]. For \(g(x,y) = |x-y|\) we obtain so-called Ducci-sequences of \(n\)-tuples. The following three questions arise: (1) Does every sequence of \(n\)-tuples lead to \((0, \dots, 0)\)? (2) How many steps in the sequence of a given \(n\)-tuple are necessary to reach \((0, \dots, 0)\) or a cycle of \(n\)-tuples? (3) What can be said about the length of the cycles? In this paper, answers are given in the case \(n=4\).
      0 references

      Identifiers