Skip to content

Elliptic Divisibility Sequence

An integer divisibility sequence generated by the nonlinear recurrence of elliptic-curve division polynomials, translating multiplication of a rational point into term divisibility, height growth, ranks of apparition, and primitive-divisor structure.

Version
v3 · 2026-09-19 · History
Domain-specific #
1757
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Arithmetic of Elliptic Curves → Mathematics
Aliases
EDS, Elliptic divisibility recurrence

Core Idea

An Elliptic Divisibility Sequence (EDS) is an integer sequence governed by a nonlinear recurrence inherited from division polynomials on an elliptic curve. Its defining arithmetic feature is divisibility along index divisibility: under standard normalization and nondegeneracy conditions, m | n implies W_m | W_n. The sequence converts the group law of multiples nP on an elliptic curve into explicit integer arithmetic.

Two closely connected definitions occur. Ward's recurrence approach begins with initial integer values satisfying integrality conditions and imposes a quartic bilinear recurrence, often expressed in the general form.

How would you explain it like I'm…

Magic Fitting Number List

Picture a list of numbers made by a secret rule that comes from a special curvy shape. The list has a magic trick. If one spot number fits evenly into another spot number, like spot 2 into spot 6, then the number sitting at spot 2 also fits evenly into the number at spot 6. That list is an elliptic divisibility sequence.

Curve-Made Dividing Sequence

An elliptic divisibility sequence is a list of whole numbers built by a special rule. The rule comes from an elliptic curve, a kind of curve mathematicians love. Its main trick is about dividing. Whenever one position number divides another, like 3 divides 9, the number at position 3 divides the number at position 9. You can make the list two ways: by starting with a few numbers and using a tricky formula that combines earlier ones, or by doing repeated 'jumps' on the curve and reading off numbers from where you land. Both ways connect the curve to ordinary whole-number arithmetic.

Elliptic-Curve Divisibility Sequence

An Elliptic Divisibility Sequence (EDS) is an integer sequence W₁, W₂, W₃, … defined by a nonlinear recurrence that comes from elliptic curves. Its signature property is that when m divides n, W_m divides W_n, under standard normalization and nondegeneracy conditions. One way to build one starts with a few integer starting values and a quartic recurrence relating products of terms. Another starts with an elliptic curve and a point P on it: you add P to itself n times to get nP, and the denominators of nP's coordinates form the sequence. This turns the curve's way of adding points into ordinary integer arithmetic. Degenerate (singular) cases can collapse into simpler sequences, such as the ordinary integers or parts of the Fibonacci numbers.

 

An elliptic divisibility sequence (EDS) is an integer sequence governed by a nonlinear recurrence inherited from division polynomials on an elliptic curve. Under standard normalization and nondegeneracy assumptions, it satisfies m | n ⇒ W_m | W_n. In Ward's recurrence formulation, one starts with integer initial values meeting integrality conditions and imposes the quartic bilinear relation W_(n+m) W_(n−m) W_r² = W_(n+r) W_(n−r) W_m² − W_(m+r) W_(m−r) W_n². In the geometric formulation, one takes an elliptic curve E over a number field with a rational point P. The denominators of the coordinates of nP, or normalized values of the division polynomials ψ_n(P) with sign choices, form an EDS. In this way the group law on multiples of P becomes explicit integer arithmetic. Nonsingular sequences correspond to genuine elliptic data. Singular ones can collapse to linear recurrences such as the integers or Fibonacci subsequences. The growth of the terms reflects the height of P.

Scope of Application

EDS appear in arithmetic dynamics, elliptic curves, Diophantine equations, recurrence sequences, primitive-divisor theory, logic, and pairing-based cryptography. They are tractable nonlinear recurrences because elliptic geometry supplies heights, group structure, reduction modulo primes, and division polynomials.

Over finite fields, EDS are periodic and their periods relate to the order of the point and multiplicative factors associated with pairings. Denominator sequences over number fields encode integrality properties of multiples. Primitive-divisor results play a role analogous to Zsigmondy's theorem for sequences such as a^n-b^n: after finitely many exceptional terms, new prime divisors appear.

Clarity

Always specify which definition is in use. A Ward recurrence sequence W_n, a division-polynomial value sequence ψ_n(P), and a denominator sequence D_n are closely related but can differ by predictable signs, powers, scaling, or subsequences. “Associated EDS” is safer than literal equality unless normalization is established.

Manages Complexity

Repeated elliptic-curve addition produces rational functions with rapidly growing numerators and denominators. EDS packages those computations into a recurrence with strong divisibility laws. The sequence turns geometric questions—torsion, reduction of P, height, and point order—into patterns of zeros, divisors, valuations, and growth.

Conversely, elliptic geometry explains what would otherwise be an opaque nonlinear recurrence. Canonical height gives the quadratic-exponential growth scale; reduction modulo primes helps explain ranks of apparition and periodicity; division polynomials provide universal identities; primitive-divisor theorems constrain factorization.

Abstract Reasoning

  1. If m | n, multiplication factors as nP=(n/m)(mP), and the division-polynomial structure yields corresponding term divisibility under normalization.
  2. A zero term indicates that the associated multiple reaches torsion or identity in the relevant setting; its least index is a rank of apparition.
  3. Nonzero discriminant is required before applying nonsingular elliptic-curve results.
  4. Canonical height zero versus positive height separates torsion/degenerate behavior from quadratic logarithmic growth for nontorsion points.

Knowledge Transfer

The abstraction transfers exactly among recurrence theory, elliptic arithmetic, finite fields, logic, and cryptography because the same division-polynomial identity persists. Elliptic nets generalize the construction from an integer index to higher-rank lattices, preserving much of the addition-law structure.

The broader residues belong to Recurrence, Divisibility, Periodicity, Growth, and Encoding. A biological or organizational “elliptic sequence” is not an instance absent an elliptic curve and the defining recurrence.

Relationships to Other Abstractions

Local relationship map for Elliptic Divisibility 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.EllipticDivisibility SequenceDOMAINPrime abstraction: Recurrence — includesRecurrencePRIME

Current abstraction Elliptic Divisibility Sequence Domain-specific

Parents (1) — outgoing typed relations

  • Elliptic Divisibility Sequence includes Recurrence Prime

    finite data and a nonlinear identity generate all terms.

Hierarchy path (1) — routes to 1 parentless root

  • Elliptic Divisibility Sequence → includes Recurrence

Neighborhood in Abstraction Space

Elliptic Divisibility 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 (2769 abstractions)

Nearest neighbors

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