Ducci sequence

Short description: Sequence of n-tuples of integers

A Ducci sequence is a sequence of n-tuples of integers, sometimes known as "the Diffy game", because it is based on sequences.

Given an n-tuple of integers [math]\displaystyle{ (a_1,a_2,...,a_n) }[/math], the next n-tuple in the sequence is formed by taking the absolute differences of neighbouring integers:

[math]\displaystyle{ (a_1,a_2,...,a_n) \rightarrow (|a_1-a_2|, |a_2-a_3|, ..., |a_n-a_1|)\, . }[/math]

Another way of describing this is as follows. Arrange n integers in a circle and make a new circle by taking the difference between neighbours, ignoring any minus signs; then repeat the operation. Ducci sequences are named after Enrico Ducci (1864 - 1940), the Italian mathematician who discovered in the 1930s that every such sequence eventually becomes periodic.

Ducci sequences are also known as the Ducci map or the n-number game. Open problems in the study of these maps still remain.

Properties

From the second n-tuple onwards, it is clear that every integer in each n-tuple in a Ducci sequence is greater than or equal to 0 and is less than or equal to the difference between the maximum and minimum members of the first n-tuple. As there are only a finite number of possible n-tuples with these constraints, the sequence of n-tuples must sooner or later repeat itself. Every Ducci sequence therefore eventually becomes periodic.

If n is a power of 2 every Ducci sequence eventually reaches the n-tuple (0,0,...,0) in a finite number of steps.

If n is not a power of two, a Ducci sequence will either eventually reach an n-tuple of zeros or will settle into a periodic loop of 'binary' n-tuples; that is, n-tuples of form [math]\displaystyle{ k(b_1, b_2, ... b_n) }[/math], [math]\displaystyle{ k }[/math] is a constant, and [math]\displaystyle{ b_i \in \{0, 1\} }[/math].

An obvious generalisation of Ducci sequences is to allow the members of the n-tuples to be any real numbers rather than just integers. For example, this 4-tuple converges to (0, 0, 0, 0) in four iterations: [math]\displaystyle{ (e, \pi, \sqrt2, 1) \rightarrow (\pi - e, \pi - \sqrt2, \sqrt2 - 1, e - 1) \rightarrow (e - \sqrt2, \pi - 2\sqrt2 + 1, e - \sqrt2, 2e - \pi - 1) \rightarrow }[/math] [math]\displaystyle{ (\pi - e - \sqrt2 + 1, \pi - e - \sqrt2 + 1, \pi - e - \sqrt2 + 1, \pi - e - \sqrt2 + 1) \rightarrow (0, 0, 0, 0) }[/math]

The properties presented here do not always hold for these generalisations. For example, a Ducci sequence starting with the n-tuple (1, q, q², q³) where q is the (irrational) positive root of the cubic [math]\displaystyle{ x^3 - x^2 - x - 1 = 0 }[/math] does not reach (0,0,0,0) in a finite number of steps, although in the limit it converges to (0,0,0,0).

Examples

Ducci sequences may be arbitrarily long before they reach a tuple of zeros or a periodic loop. The 4-tuple sequence starting with (0, 653, 1854, 4063) takes 24 iterations to reach the zeros tuple.

[math]\displaystyle{ (0, 653, 1854, 4063) \rightarrow (653, 1201, 2209, 4063) \rightarrow (548, 1008, 1854, 3410) \rightarrow }[/math] [math]\displaystyle{ \cdots \rightarrow (0, 0, 128, 128) \rightarrow (0, 128, 0, 128) \rightarrow (128, 128, 128, 128) \rightarrow (0, 0, 0, 0) }[/math]

This 5-tuple sequence enters a period 15 binary 'loop' after 7 iterations.

[math]\displaystyle{ \begin{matrix} 1 5 7 9 9 \rightarrow & 4 2 2 0 8 \rightarrow & 2 0 2 8 4 \rightarrow & 2 2 6 4 2 \rightarrow & 0 4 2 2 0 \rightarrow & 4 2 0 2 0 \rightarrow \\ 2 2 2 2 4 \rightarrow & 0 0 0 2 2 \rightarrow & 0 0 2 0 2 \rightarrow & 0 2 2 2 2 \rightarrow & 2 0 0 0 2 \rightarrow & 2 0 0 2 0 \rightarrow \\ 2 0 2 2 2 \rightarrow & 2 2 0 0 0 \rightarrow & 0 2 0 0 2 \rightarrow & 2 2 0 2 2 \rightarrow & 0 2 2 0 0 \rightarrow & 2 0 2 0 0 \rightarrow \\ 2 2 2 0 2 \rightarrow & 0 0 2 2 0 \rightarrow & 0 2 0 2 0 \rightarrow & 2 2 2 2 0 \rightarrow & 0 0 0 2 2 \rightarrow & \cdots \quad \quad \\ \end{matrix} }[/math]

The following 6-tuple sequence shows that sequences of tuples whose length is not a power of two may still reach a tuple of zeros:

[math]\displaystyle{ \begin{matrix} 1 2 1 2 1 0 \rightarrow & 1 1 1 1 1 1 \rightarrow & 0 0 0 0 0 0 \\ \end{matrix} }[/math]

If some conditions are imposed on any "power of two"-tuple Ducci sequence, it would take that power of two or lesser iterations to reach the zeros tuple. It is hypothesized that these sequences conform to a rule.

Modulo two form

When the Ducci sequences enter binary loops, it is possible to treat the sequence in modulo two. That is:

[math]\displaystyle{ (|a_1-a_2|, |a_2-a_3|, ..., |a_n-a_1|)\ = (a_1+a_2, a_2+a_3, ..., a_n + a_1) \bmod 2 }[/math]

This forms the basis for proving when the sequence vanish to all zeros.

Cellular automata

The linear map in modulo 2 can further be identified as the cellular automata denoted as rule 102 in Wolfram code and related to rule 90 through the Martin-Odlyzko-Wolfram map. Rule 102 reproduces the Sierpinski triangle.

Other related topics

The Ducci map is an example of a difference equation, a category that also include non-linear dynamics, chaos theory and numerical analysis. Similarities to cyclotomic polynomials have also been pointed out. While there are no practical applications of the Ducci map at present, its connection to the highly applied field of difference equations led to conjecture that a form of the Ducci map may also find application in the future.

External links

• Ducci Sequence
• Integer Iterations on a Circle at Cut-the-Knot