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

v2 · 2026-08-30 · History

Domain-specific #

1757

Origin domain

mathematics

Subdomain

arithmetic of elliptic curves

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.

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

Current abstraction Elliptic Divisibility Sequence Domain-specific

Parents (1) — more general patterns this builds on

• Elliptic Divisibility Sequence is part of Recurrence Prime

  finite data and a nonlinear identity generate all terms.

Hierarchy path (1) — routes to 1 parentless root

• Elliptic Divisibility Sequence → Recurrence

Neighborhood in Abstraction Space

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

Family — Elliptic Arithmetic & Group Finiteness (5 abstractions)

Nearest neighbors

• Primefree Sequence — 0.84
• Mordell–Weil Rank of an Elliptic Curve — 0.82
• Covering Set — 0.81
• Sparsely Totient Number — 0.80
• Tunnell's theorem — 0.80

Computed from structural-signature embeddings · 2026-09-08