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.
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.
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¶
- 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¶
Current abstraction Ducci Sequence Domain-specific
Parents (1) — more general patterns this builds on
-
Ducci Sequence is part of Iteration Prime
the same operator is repeatedly applied to its own output.
Hierarchy path (1) — routes to 1 parentless root
- Ducci Sequence → Iteration
Neighborhood in Abstraction Space¶
Ducci Sequence sits in a sparse region of the domain-specific corpus (85th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Temporal logic of actions — 0.82
- Firing-Squad Synchronization Problem — 0.81
- Multiplicative Digital Root — 0.80
- Indiscernibles — 0.80
- The Monkey and the Coconuts — 0.80
Computed from structural-signature embeddings · 2026-09-08