Skip to content

Ducci Sequence

An orbit of a cyclic integer tuple under repeated replacement by the absolute differences of adjacent entries, studied through its transient, zero-reaching, and periodic behavior.

Version
v2 · 2026-09-19 · History
Domain-specific #
1725
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomains
Discrete Mathematics, Integer Dynamical Systems → Mathematics
Aliases
Ducci map, N-number game, Diffy game

Core Idea

A Ducci Sequence is the orbit produced by repeatedly applying one fixed difference operation to a cyclic tuple of integers. For a tuple (a1, a2, ..., an), form the next tuple as (|a1-a2|, |a2-a3|, ..., |an-a1|). The last and first entries are neighbors, so the operation wraps around. Iterating that map creates a discrete dynamical system whose salient questions concern the transient before repetition, arrival at the all-zero tuple, and the length and form of eventual cycles.

The locked identity is finite ordered integer tuple + cyclic adjacency + coordinatewise absolute differences + repeated application of the same map -> a Ducci orbit. Each element alone is too broad.

How would you explain it like I'm…

The Circle Subtraction Game

Write some numbers in a circle. Under each pair of neighbors, write how far apart they are, going all the way around so the last number and the first number are neighbors too. Then do it again with the new numbers, and again. Sometimes they all turn into zeros, and otherwise a pattern starts repeating.

Differences Around a Circle

A Ducci sequence starts with a list of whole numbers arranged in a circle, so the last number is next to the first. To make the next list, you take the difference between each neighbor pair and ignore minus signs. For example, 1, 5, 2, 8 becomes 4, 3, 6, 7, then 1, 3, 1, 3, then 2, 2, 2, 2, then 0, 0, 0, 0. Because the numbers can never get bigger than the biggest gap you started with, the lists must eventually repeat. When the list has 4 or 8 or 16 numbers, it always ends at all zeros, but with other lengths it can get stuck in a repeating loop instead.

Iterated Cyclic Difference Map

A Ducci sequence comes from repeatedly applying one rule to a list of integers arranged in a cycle: (a1, a2, …, an) becomes (|a1 − a2|, |a2 − a3|, …, |an − a1|), where the last entry wraps around to the first. Doing this again and again is a simple dynamical system, and the questions are how long it takes to start repeating, whether it reaches all zeros, and what repeating cycles look like. Some basic facts help: adding the same number to every entry disappears after one step, multiplying every entry by a nonnegative integer multiplies the whole sequence, and the gap between largest and smallest never grows. Since every later entry lies between zero and the original range, there are only finitely many possible lists, so the sequence must eventually repeat. If the length n is a power of two, it always reaches zero, but that isn't true for other lengths or if you allow real numbers.

 

A Ducci sequence is the orbit of a cyclic integer tuple under the Ducci map D(a1, ..., an) = (|a1 - a2|, |a2 - a3|, ..., |an - a1|), where the cyclic adjacency makes the last and first entries neighbors. Iterating D defines a discrete dynamical system whose central questions concern the transient before repetition, arrival at the zero tuple, and the length and form of eventual cycles. The identity requires all four ingredients: a finite ordered integer tuple, cyclic adjacency, coordinatewise absolute differences and repeated application of the same map; ordinary finite differences along a line, a single difference tuple or an arbitrary recurrence are different objects. Several invariances simplify analysis: adding a common constant to all entries is erased after one step, scaling by a nonnegative integer scales the whole orbit, and the range never increases. Because every subsequent entry lies between zero and the original range, the orbit lives in a finite state set and must eventually become periodic, a structural consequence of bounded integrality rather than an observed pattern. Stronger conclusions depend on n and the coefficient domain: every orbit reaches zero when n is a power of two, but this does not carry over to other n or to real-valued versions.

Scope of Application

The primary scope is discrete mathematics and the study of elementary dynamical systems. A small rule generates nontrivial global behavior, making the map useful for questions about invariants, periodicity, parity, modular reduction, and dependence on dimension. The map also appears as the n-number game or Diffy game in mathematical recreation and education, where learners can calculate short orbits by hand and then formulate conjectures.

Clarity

Two conventions need explicit control. First, “sequence” can mean the entire orbit, while an individual object is an n-tuple. Second, cycle statements may be literal or normalized. Because multiplying an initial tuple multiplies every future tuple, infinitely many numerically distinct cycles can represent the same shape at different scales. Authors sometimes reduce by a common factor, take parity, or work modulo an integer before classifying cycles. A reference-grade claim must say which equivalence is used.

Manages Complexity

The named abstraction compresses a full experimental specification. “Apply the Ducci map” communicates the state shape, circular topology, local operator, synchronization, and iterative regime. Researchers can then focus on the property being compared rather than restating the recurrence.

It also separates levels of explanation. Local differences determine one update; invariants and finite-state arguments explain eventual behavior; algebra over finite fields can explain dependence on n; computation can enumerate cases.

Abstract Reasoning

  1. Adding the same integer c to every coordinate does not affect the first difference tuple, because common translation cancels.
  2. Multiplying all entries by a nonnegative integer k multiplies all subsequent entries by k, permitting scale-normalized comparison.
  3. Each new coordinate is no larger than the preceding tuple's range, so an integer orbit remains bounded.
  4. A bounded integer state space with deterministic update must eventually revisit a state and thereafter be periodic.

Knowledge Transfer

The transferable skeleton is finite state + local synchronous map + iteration -> orbit classification. That structure can guide analysis of cellular automata, chip-firing systems, and other recurrence maps. The Ducci name should transfer only when cyclic absolute differences remain the update rule. If the local function, topology, or coefficient semantics changes, the new system may be inspired by Ducci sequences without being one.

Relationships to Other Abstractions

Local relationship map for Ducci SequenceParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Ducci SequenceDOMAINPrime abstraction: Iteration — includesIterationPRIME

Current abstraction Ducci Sequence Domain-specific

Parents (1) — outgoing typed relations

  • Ducci Sequence includes Iteration Prime

    the same operator is repeatedly applied to its own output.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Ducci Sequence sits in a sparse region of the domain-specific corpus (87th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25